./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 16:51:43,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 16:51:43,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 16:51:43,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 16:51:43,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 16:51:43,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 16:51:43,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 16:51:43,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 16:51:43,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 16:51:43,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 16:51:43,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 16:51:43,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 16:51:43,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 16:51:43,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 16:51:43,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 16:51:43,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 16:51:43,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 16:51:43,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 16:51:43,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 16:51:43,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 16:51:43,521 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 16:51:43,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 16:51:43,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 16:51:43,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 16:51:43,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 16:51:43,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 16:51:43,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 16:51:43,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 16:51:43,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 16:51:43,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 16:51:43,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 16:51:43,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 16:51:43,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 16:51:43,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 16:51:43,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 16:51:43,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 16:51:43,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 16:51:43,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 16:51:43,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 16:51:43,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 16:51:43,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 16:51:43,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 16:51:43,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 16:51:43,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 16:51:43,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 16:51:43,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 16:51:43,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 16:51:43,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 16:51:43,555 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 16:51:43,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 16:51:43,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 16:51:43,556 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 16:51:43,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 16:51:43,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 16:51:43,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 16:51:43,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 16:51:43,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 16:51:43,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 16:51:43,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 16:51:43,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 16:51:43,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 16:51:43,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 16:51:43,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 16:51:43,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 16:51:43,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:51:43,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 16:51:43,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 16:51:43,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 16:51:43,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 16:51:43,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 16:51:43,560 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 16:51:43,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 16:51:43,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 16:51:43,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e98c668899fc19a628c1d936389b59135bc3426718905326099068187537de8 [2022-07-12 16:51:43,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 16:51:43,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 16:51:43,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 16:51:43,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 16:51:43,736 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 16:51:43,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2022-07-12 16:51:43,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693f9701d/d818c68142a343cfb298cc9afb6147b0/FLAGa41c18cf3 [2022-07-12 16:51:44,424 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 16:51:44,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2022-07-12 16:51:44,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693f9701d/d818c68142a343cfb298cc9afb6147b0/FLAGa41c18cf3 [2022-07-12 16:51:44,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693f9701d/d818c68142a343cfb298cc9afb6147b0 [2022-07-12 16:51:44,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 16:51:44,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 16:51:44,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 16:51:44,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 16:51:44,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 16:51:44,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:51:44" (1/1) ... [2022-07-12 16:51:44,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33861560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:44, skipping insertion in model container [2022-07-12 16:51:44,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:51:44" (1/1) ... [2022-07-12 16:51:44,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 16:51:44,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 16:51:47,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2022-07-12 16:51:47,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2022-07-12 16:51:47,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2022-07-12 16:51:47,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2022-07-12 16:51:47,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2022-07-12 16:51:47,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2022-07-12 16:51:47,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2022-07-12 16:51:47,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2022-07-12 16:51:47,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2022-07-12 16:51:47,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2022-07-12 16:51:47,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2022-07-12 16:51:47,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2022-07-12 16:51:47,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2022-07-12 16:51:47,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2022-07-12 16:51:47,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2022-07-12 16:51:47,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2022-07-12 16:51:47,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2022-07-12 16:51:47,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2022-07-12 16:51:47,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2022-07-12 16:51:47,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2022-07-12 16:51:47,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2022-07-12 16:51:47,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2022-07-12 16:51:47,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2022-07-12 16:51:47,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2022-07-12 16:51:47,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2022-07-12 16:51:47,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2022-07-12 16:51:47,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2022-07-12 16:51:47,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2022-07-12 16:51:47,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2022-07-12 16:51:47,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2022-07-12 16:51:47,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2022-07-12 16:51:47,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2022-07-12 16:51:47,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2022-07-12 16:51:47,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2022-07-12 16:51:47,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2022-07-12 16:51:47,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2022-07-12 16:51:47,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2022-07-12 16:51:47,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2022-07-12 16:51:47,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2022-07-12 16:51:47,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2022-07-12 16:51:47,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2022-07-12 16:51:47,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2022-07-12 16:51:47,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2022-07-12 16:51:47,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2022-07-12 16:51:47,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2022-07-12 16:51:47,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2022-07-12 16:51:47,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2022-07-12 16:51:47,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2022-07-12 16:51:47,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2022-07-12 16:51:47,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2022-07-12 16:51:47,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2022-07-12 16:51:47,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2022-07-12 16:51:47,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2022-07-12 16:51:47,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2022-07-12 16:51:47,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2022-07-12 16:51:47,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2022-07-12 16:51:47,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2022-07-12 16:51:47,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2022-07-12 16:51:47,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2022-07-12 16:51:47,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2022-07-12 16:51:47,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2022-07-12 16:51:47,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2022-07-12 16:51:47,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2022-07-12 16:51:47,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2022-07-12 16:51:47,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2022-07-12 16:51:47,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2022-07-12 16:51:47,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2022-07-12 16:51:47,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2022-07-12 16:51:47,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2022-07-12 16:51:47,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2022-07-12 16:51:47,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2022-07-12 16:51:47,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2022-07-12 16:51:47,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2022-07-12 16:51:47,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2022-07-12 16:51:47,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2022-07-12 16:51:47,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2022-07-12 16:51:47,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2022-07-12 16:51:47,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2022-07-12 16:51:47,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2022-07-12 16:51:47,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2022-07-12 16:51:47,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2022-07-12 16:51:47,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2022-07-12 16:51:47,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2022-07-12 16:51:47,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2022-07-12 16:51:47,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2022-07-12 16:51:47,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2022-07-12 16:51:47,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2022-07-12 16:51:47,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2022-07-12 16:51:47,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:51:47,984 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 16:51:48,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2022-07-12 16:51:48,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2022-07-12 16:51:48,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2022-07-12 16:51:48,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2022-07-12 16:51:48,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2022-07-12 16:51:48,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2022-07-12 16:51:48,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2022-07-12 16:51:48,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2022-07-12 16:51:48,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2022-07-12 16:51:48,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2022-07-12 16:51:48,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2022-07-12 16:51:48,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2022-07-12 16:51:48,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2022-07-12 16:51:48,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2022-07-12 16:51:48,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2022-07-12 16:51:48,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2022-07-12 16:51:48,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2022-07-12 16:51:48,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2022-07-12 16:51:48,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2022-07-12 16:51:48,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2022-07-12 16:51:48,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2022-07-12 16:51:48,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2022-07-12 16:51:48,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2022-07-12 16:51:48,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2022-07-12 16:51:48,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2022-07-12 16:51:48,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2022-07-12 16:51:48,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2022-07-12 16:51:48,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2022-07-12 16:51:48,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2022-07-12 16:51:48,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2022-07-12 16:51:48,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2022-07-12 16:51:48,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2022-07-12 16:51:48,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2022-07-12 16:51:48,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2022-07-12 16:51:48,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2022-07-12 16:51:48,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2022-07-12 16:51:48,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2022-07-12 16:51:48,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2022-07-12 16:51:48,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2022-07-12 16:51:48,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2022-07-12 16:51:48,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2022-07-12 16:51:48,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2022-07-12 16:51:48,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2022-07-12 16:51:48,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2022-07-12 16:51:48,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2022-07-12 16:51:48,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2022-07-12 16:51:48,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2022-07-12 16:51:48,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2022-07-12 16:51:48,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2022-07-12 16:51:48,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2022-07-12 16:51:48,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2022-07-12 16:51:48,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2022-07-12 16:51:48,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2022-07-12 16:51:48,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2022-07-12 16:51:48,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2022-07-12 16:51:48,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2022-07-12 16:51:48,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2022-07-12 16:51:48,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2022-07-12 16:51:48,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2022-07-12 16:51:48,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2022-07-12 16:51:48,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2022-07-12 16:51:48,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2022-07-12 16:51:48,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2022-07-12 16:51:48,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2022-07-12 16:51:48,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2022-07-12 16:51:48,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2022-07-12 16:51:48,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2022-07-12 16:51:48,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2022-07-12 16:51:48,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2022-07-12 16:51:48,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2022-07-12 16:51:48,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2022-07-12 16:51:48,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2022-07-12 16:51:48,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2022-07-12 16:51:48,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2022-07-12 16:51:48,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2022-07-12 16:51:48,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2022-07-12 16:51:48,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2022-07-12 16:51:48,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2022-07-12 16:51:48,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2022-07-12 16:51:48,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2022-07-12 16:51:48,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2022-07-12 16:51:48,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2022-07-12 16:51:48,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2022-07-12 16:51:48,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2022-07-12 16:51:48,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2022-07-12 16:51:48,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2022-07-12 16:51:48,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2022-07-12 16:51:48,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2022-07-12 16:51:48,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:51:48,556 INFO L208 MainTranslator]: Completed translation [2022-07-12 16:51:48,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48 WrapperNode [2022-07-12 16:51:48,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 16:51:48,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 16:51:48,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 16:51:48,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 16:51:48,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,758 INFO L137 Inliner]: procedures = 673, calls = 2647, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6079 [2022-07-12 16:51:48,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 16:51:48,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 16:51:48,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 16:51:48,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 16:51:48,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 16:51:48,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 16:51:48,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 16:51:48,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 16:51:48,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (1/1) ... [2022-07-12 16:51:48,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:51:48,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:51:48,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 16:51:48,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 16:51:49,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2022-07-12 16:51:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2022-07-12 16:51:49,002 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2022-07-12 16:51:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2022-07-12 16:51:49,002 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2022-07-12 16:51:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2022-07-12 16:51:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-12 16:51:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-12 16:51:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:51:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:51:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2022-07-12 16:51:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2022-07-12 16:51:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 16:51:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 16:51:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2022-07-12 16:51:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2022-07-12 16:51:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 16:51:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 16:51:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2022-07-12 16:51:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2022-07-12 16:51:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:51:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:51:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2022-07-12 16:51:49,008 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2022-07-12 16:51:49,008 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2022-07-12 16:51:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2022-07-12 16:51:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2022-07-12 16:51:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2022-07-12 16:51:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 16:51:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 16:51:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-12 16:51:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-12 16:51:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 16:51:49,009 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 16:51:49,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:51:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:51:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:51:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:51:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 16:51:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 16:51:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2022-07-12 16:51:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2022-07-12 16:51:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2022-07-12 16:51:49,010 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2022-07-12 16:51:49,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 16:51:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 16:51:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:51:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:51:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 16:51:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2022-07-12 16:51:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2022-07-12 16:51:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2022-07-12 16:51:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2022-07-12 16:51:49,011 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2022-07-12 16:51:49,011 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2022-07-12 16:51:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:51:49,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:51:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 16:51:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-12 16:51:49,012 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-12 16:51:49,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 16:51:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 16:51:49,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 16:51:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 16:51:49,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 16:51:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-12 16:51:49,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-12 16:51:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2022-07-12 16:51:49,013 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2022-07-12 16:51:49,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:51:49,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:51:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 16:51:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:51:49,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-12 16:51:49,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-12 16:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 16:51:49,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 16:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 16:51:49,017 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 16:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2022-07-12 16:51:49,018 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2022-07-12 16:51:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:51:49,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:51:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-12 16:51:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-12 16:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 16:51:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 16:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2022-07-12 16:51:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2022-07-12 16:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:51:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-12 16:51:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-12 16:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:51:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 16:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 16:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2022-07-12 16:51:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2022-07-12 16:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 16:51:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 16:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 16:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:51:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-12 16:51:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-12 16:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-12 16:51:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-12 16:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:51:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-12 16:51:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-12 16:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2022-07-12 16:51:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2022-07-12 16:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2022-07-12 16:51:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2022-07-12 16:51:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2022-07-12 16:51:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2022-07-12 16:51:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-12 16:51:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-12 16:51:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2022-07-12 16:51:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2022-07-12 16:51:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-12 16:51:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-12 16:51:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:51:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:51:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-12 16:51:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-12 16:51:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 16:51:49,023 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 16:51:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2022-07-12 16:51:49,024 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2022-07-12 16:51:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2022-07-12 16:51:49,024 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2022-07-12 16:51:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 16:51:49,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 16:51:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2022-07-12 16:51:49,024 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2022-07-12 16:51:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-12 16:51:49,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-12 16:51:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-12 16:51:49,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-12 16:51:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 16:51:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 16:51:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 16:51:49,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 16:51:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 16:51:49,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 16:51:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2022-07-12 16:51:49,025 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2022-07-12 16:51:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2022-07-12 16:51:49,025 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2022-07-12 16:51:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-12 16:51:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-12 16:51:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2022-07-12 16:51:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2022-07-12 16:51:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2022-07-12 16:51:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2022-07-12 16:51:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-12 16:51:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-12 16:51:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:51:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:51:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2022-07-12 16:51:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2022-07-12 16:51:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:51:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:51:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2022-07-12 16:51:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2022-07-12 16:51:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 16:51:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:51:49,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:51:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 16:51:49,027 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2022-07-12 16:51:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2022-07-12 16:51:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2022-07-12 16:51:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2022-07-12 16:51:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 16:51:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 16:51:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 16:51:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 16:51:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 16:51:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2022-07-12 16:51:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2022-07-12 16:51:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 16:51:49,029 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 16:51:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2022-07-12 16:51:49,029 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2022-07-12 16:51:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:51:49,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:51:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 16:51:49,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 16:51:49,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-12 16:51:49,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-12 16:51:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 16:51:49,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 16:51:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2022-07-12 16:51:49,030 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2022-07-12 16:51:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2022-07-12 16:51:49,030 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2022-07-12 16:51:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-12 16:51:49,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-12 16:51:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:51:49,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:51:49,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:51:49,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:51:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:51:49,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:51:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 16:51:49,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 16:51:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 16:51:49,031 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 16:51:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2022-07-12 16:51:49,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2022-07-12 16:51:49,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:51:49,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:51:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 16:51:49,032 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 16:51:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:51:49,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:51:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2022-07-12 16:51:49,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2022-07-12 16:51:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 16:51:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:51:49,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:51:49,032 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2022-07-12 16:51:49,033 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2022-07-12 16:51:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 16:51:49,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 16:51:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:51:49,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:51:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-12 16:51:49,033 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-12 16:51:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-12 16:51:49,033 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-12 16:51:49,033 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2022-07-12 16:51:49,034 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2022-07-12 16:51:49,034 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2022-07-12 16:51:49,034 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2022-07-12 16:51:49,034 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2022-07-12 16:51:49,034 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2022-07-12 16:51:49,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 16:51:49,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 16:51:49,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:51:49,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:51:49,034 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-12 16:51:49,035 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-12 16:51:49,035 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2022-07-12 16:51:49,035 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2022-07-12 16:51:49,035 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2022-07-12 16:51:49,035 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2022-07-12 16:51:49,035 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 16:51:49,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 16:51:49,035 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-12 16:51:49,035 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-12 16:51:49,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 16:51:49,035 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-12 16:51:49,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-12 16:51:49,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-12 16:51:49,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-12 16:51:49,036 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2022-07-12 16:51:49,036 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2022-07-12 16:51:49,804 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 16:51:49,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 16:51:50,114 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 16:51:54,046 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 16:51:54,066 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 16:51:54,066 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 16:51:54,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:51:54 BoogieIcfgContainer [2022-07-12 16:51:54,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 16:51:54,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 16:51:54,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 16:51:54,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 16:51:54,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:51:44" (1/3) ... [2022-07-12 16:51:54,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ab888a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:51:54, skipping insertion in model container [2022-07-12 16:51:54,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:51:48" (2/3) ... [2022-07-12 16:51:54,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ab888a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:51:54, skipping insertion in model container [2022-07-12 16:51:54,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:51:54" (3/3) ... [2022-07-12 16:51:54,077 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2022-07-12 16:51:54,086 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 16:51:54,086 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-12 16:51:54,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 16:51:54,182 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1256d193, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a23e13b [2022-07-12 16:51:54,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-12 16:51:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 1985 states, 1344 states have (on average 1.2961309523809523) internal successors, (1742), 1405 states have internal predecessors, (1742), 488 states have call successors, (488), 123 states have call predecessors, (488), 122 states have return successors, (483), 474 states have call predecessors, (483), 483 states have call successors, (483) [2022-07-12 16:51:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 16:51:54,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:51:54,200 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:51:54,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:51:54,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:51:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1268169960, now seen corresponding path program 1 times [2022-07-12 16:51:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:51:54,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118397518] [2022-07-12 16:51:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:51:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:51:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:51:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:51:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:51:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:51:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:51:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:51:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:51:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:51:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:51:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:51:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:51:54,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:51:54,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118397518] [2022-07-12 16:51:54,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118397518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:51:54,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:51:54,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:51:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801994533] [2022-07-12 16:51:54,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:51:54,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:51:54,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:51:54,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:51:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:51:54,825 INFO L87 Difference]: Start difference. First operand has 1985 states, 1344 states have (on average 1.2961309523809523) internal successors, (1742), 1405 states have internal predecessors, (1742), 488 states have call successors, (488), 123 states have call predecessors, (488), 122 states have return successors, (483), 474 states have call predecessors, (483), 483 states have call successors, (483) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 16:51:56,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:52:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:52:04,090 INFO L93 Difference]: Finished difference Result 5888 states and 8392 transitions. [2022-07-12 16:52:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 16:52:04,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-12 16:52:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:52:04,120 INFO L225 Difference]: With dead ends: 5888 [2022-07-12 16:52:04,121 INFO L226 Difference]: Without dead ends: 3905 [2022-07-12 16:52:04,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 16:52:04,145 INFO L413 NwaCegarLoop]: 2477 mSDtfsCounter, 7596 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 6489 mSolverCounterSat, 4215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7681 SdHoareTripleChecker+Valid, 3448 SdHoareTripleChecker+Invalid, 10704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4215 IncrementalHoareTripleChecker+Valid, 6489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:52:04,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7681 Valid, 3448 Invalid, 10704 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4215 Valid, 6489 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-07-12 16:52:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2022-07-12 16:52:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3713. [2022-07-12 16:52:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3713 states, 2539 states have (on average 1.257975580937377) internal successors, (3194), 2626 states have internal predecessors, (3194), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-12 16:52:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 5065 transitions. [2022-07-12 16:52:04,361 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 5065 transitions. Word has length 64 [2022-07-12 16:52:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:52:04,362 INFO L495 AbstractCegarLoop]: Abstraction has 3713 states and 5065 transitions. [2022-07-12 16:52:04,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 16:52:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 5065 transitions. [2022-07-12 16:52:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 16:52:04,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:52:04,370 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:52:04,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 16:52:04,370 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:52:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:52:04,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1435080531, now seen corresponding path program 1 times [2022-07-12 16:52:04,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:52:04,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670453855] [2022-07-12 16:52:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:52:04,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:52:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:52:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:52:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:52:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:52:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:52:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:52:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:52:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:52:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:52:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:52:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:52:04,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:52:04,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670453855] [2022-07-12 16:52:04,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670453855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:52:04,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:52:04,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:52:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973159612] [2022-07-12 16:52:04,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:52:04,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:52:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:52:04,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:52:04,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:52:04,660 INFO L87 Difference]: Start difference. First operand 3713 states and 5065 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 16:52:06,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:52:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:52:10,058 INFO L93 Difference]: Finished difference Result 3713 states and 5065 transitions. [2022-07-12 16:52:10,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:52:10,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-07-12 16:52:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:52:10,074 INFO L225 Difference]: With dead ends: 3713 [2022-07-12 16:52:10,075 INFO L226 Difference]: Without dead ends: 3711 [2022-07-12 16:52:10,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:52:10,076 INFO L413 NwaCegarLoop]: 2247 mSDtfsCounter, 4725 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4814 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 5436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:52:10,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4814 Valid, 2878 Invalid, 5436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-12 16:52:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2022-07-12 16:52:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2022-07-12 16:52:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3711 states, 2538 states have (on average 1.2576832151300237) internal successors, (3192), 2624 states have internal predecessors, (3192), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-12 16:52:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 5063 transitions. [2022-07-12 16:52:10,213 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 5063 transitions. Word has length 70 [2022-07-12 16:52:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:52:10,214 INFO L495 AbstractCegarLoop]: Abstraction has 3711 states and 5063 transitions. [2022-07-12 16:52:10,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 16:52:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 5063 transitions. [2022-07-12 16:52:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 16:52:10,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:52:10,215 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:52:10,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 16:52:10,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:52:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:52:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1860087943, now seen corresponding path program 1 times [2022-07-12 16:52:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:52:10,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000311616] [2022-07-12 16:52:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:52:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:52:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:52:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:52:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:52:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:52:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:52:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:52:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:52:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:52:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:52:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:52:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:52:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:52:10,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:52:10,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000311616] [2022-07-12 16:52:10,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000311616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:52:10,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:52:10,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:52:10,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850309966] [2022-07-12 16:52:10,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:52:10,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:52:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:52:10,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:52:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:52:10,493 INFO L87 Difference]: Start difference. First operand 3711 states and 5063 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 16:52:11,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:52:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:52:16,317 INFO L93 Difference]: Finished difference Result 3711 states and 5063 transitions. [2022-07-12 16:52:16,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:52:16,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-07-12 16:52:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:52:16,333 INFO L225 Difference]: With dead ends: 3711 [2022-07-12 16:52:16,333 INFO L226 Difference]: Without dead ends: 3709 [2022-07-12 16:52:16,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:52:16,335 INFO L413 NwaCegarLoop]: 2245 mSDtfsCounter, 4719 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4807 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 5434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:52:16,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4807 Valid, 2876 Invalid, 5434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 16:52:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2022-07-12 16:52:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3709. [2022-07-12 16:52:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3709 states, 2537 states have (on average 1.257390618841151) internal successors, (3190), 2622 states have internal predecessors, (3190), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-12 16:52:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5061 transitions. [2022-07-12 16:52:16,437 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5061 transitions. Word has length 76 [2022-07-12 16:52:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:52:16,438 INFO L495 AbstractCegarLoop]: Abstraction has 3709 states and 5061 transitions. [2022-07-12 16:52:16,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 16:52:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5061 transitions. [2022-07-12 16:52:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 16:52:16,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:52:16,440 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:52:16,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 16:52:16,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:52:16,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:52:16,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1019236422, now seen corresponding path program 1 times [2022-07-12 16:52:16,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:52:16,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875709885] [2022-07-12 16:52:16,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:52:16,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:52:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:52:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:52:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:52:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:52:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:52:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:52:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:52:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:52:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:52:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:52:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:52:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:52:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:52:16,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:52:16,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875709885] [2022-07-12 16:52:16,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875709885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:52:16,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:52:16,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:52:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499081621] [2022-07-12 16:52:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:52:16,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:52:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:52:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:52:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:52:16,713 INFO L87 Difference]: Start difference. First operand 3709 states and 5061 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 16:52:18,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:52:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:52:22,320 INFO L93 Difference]: Finished difference Result 3709 states and 5061 transitions. [2022-07-12 16:52:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:52:22,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-07-12 16:52:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:52:22,336 INFO L225 Difference]: With dead ends: 3709 [2022-07-12 16:52:22,336 INFO L226 Difference]: Without dead ends: 3707 [2022-07-12 16:52:22,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:52:22,338 INFO L413 NwaCegarLoop]: 2243 mSDtfsCounter, 4713 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4800 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 5432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:52:22,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4800 Valid, 2874 Invalid, 5432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 16:52:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-07-12 16:52:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2022-07-12 16:52:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 2536 states have (on average 1.2570977917981072) internal successors, (3188), 2620 states have internal predecessors, (3188), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-12 16:52:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 5059 transitions. [2022-07-12 16:52:22,437 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 5059 transitions. Word has length 82 [2022-07-12 16:52:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:52:22,437 INFO L495 AbstractCegarLoop]: Abstraction has 3707 states and 5059 transitions. [2022-07-12 16:52:22,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 16:52:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 5059 transitions. [2022-07-12 16:52:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 16:52:22,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:52:22,439 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:52:22,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 16:52:22,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:52:22,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:52:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1523732060, now seen corresponding path program 1 times [2022-07-12 16:52:22,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:52:22,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390269400] [2022-07-12 16:52:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:52:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:52:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:52:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:52:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:52:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:52:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:52:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:52:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:52:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:52:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:52:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:52:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:52:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:52:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:52:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:52:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:52:22,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390269400] [2022-07-12 16:52:22,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390269400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:52:22,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:52:22,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:52:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852739836] [2022-07-12 16:52:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:52:22,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:52:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:52:22,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:52:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:52:22,674 INFO L87 Difference]: Start difference. First operand 3707 states and 5059 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:52:24,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:52:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:52:27,871 INFO L93 Difference]: Finished difference Result 3707 states and 5059 transitions. [2022-07-12 16:52:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:52:27,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-07-12 16:52:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:52:27,884 INFO L225 Difference]: With dead ends: 3707 [2022-07-12 16:52:27,885 INFO L226 Difference]: Without dead ends: 3705 [2022-07-12 16:52:27,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:52:27,886 INFO L413 NwaCegarLoop]: 2241 mSDtfsCounter, 4707 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 2872 SdHoareTripleChecker+Invalid, 5430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:52:27,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 2872 Invalid, 5430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-12 16:52:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2022-07-12 16:52:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3705. [2022-07-12 16:52:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3705 states, 2535 states have (on average 1.2568047337278105) internal successors, (3186), 2618 states have internal predecessors, (3186), 920 states have call successors, (920), 225 states have call predecessors, (920), 224 states have return successors, (951), 898 states have call predecessors, (951), 918 states have call successors, (951) [2022-07-12 16:52:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5057 transitions. [2022-07-12 16:52:28,006 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5057 transitions. Word has length 88 [2022-07-12 16:52:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:52:28,007 INFO L495 AbstractCegarLoop]: Abstraction has 3705 states and 5057 transitions. [2022-07-12 16:52:28,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:52:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5057 transitions. [2022-07-12 16:52:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 16:52:28,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:52:28,013 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:52:28,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 16:52:28,013 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:52:28,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:52:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1546673947, now seen corresponding path program 1 times [2022-07-12 16:52:28,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:52:28,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500600669] [2022-07-12 16:52:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:52:28,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:52:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:52:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:52:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:52:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:52:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:52:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:52:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:52:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:52:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:52:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:52:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:52:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:52:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:52:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:52:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:52:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 16:52:28,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:52:28,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500600669] [2022-07-12 16:52:28,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500600669] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:52:28,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331347368] [2022-07-12 16:52:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:52:28,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:52:28,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:52:28,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:52:28,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 16:52:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:29,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 16:52:29,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:52:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 16:52:29,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:52:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 16:52:29,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331347368] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:52:29,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:52:29,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 23 [2022-07-12 16:52:29,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925260189] [2022-07-12 16:52:29,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:52:29,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 16:52:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:52:29,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 16:52:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2022-07-12 16:52:29,682 INFO L87 Difference]: Start difference. First operand 3705 states and 5057 transitions. Second operand has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 18 states have internal predecessors, (69), 7 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-12 16:52:30,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:52:32,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:52:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:52:58,493 INFO L93 Difference]: Finished difference Result 4846 states and 6526 transitions. [2022-07-12 16:52:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 16:52:58,494 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 18 states have internal predecessors, (69), 7 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) Word has length 99 [2022-07-12 16:52:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:52:58,508 INFO L225 Difference]: With dead ends: 4846 [2022-07-12 16:52:58,509 INFO L226 Difference]: Without dead ends: 3911 [2022-07-12 16:52:58,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2022-07-12 16:52:58,513 INFO L413 NwaCegarLoop]: 2251 mSDtfsCounter, 3780 mSDsluCounter, 5047 mSDsCounter, 0 mSdLazyCounter, 42957 mSolverCounterSat, 2774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3799 SdHoareTripleChecker+Valid, 7298 SdHoareTripleChecker+Invalid, 45731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2774 IncrementalHoareTripleChecker+Valid, 42957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:52:58,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3799 Valid, 7298 Invalid, 45731 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2774 Valid, 42957 Invalid, 0 Unknown, 0 Unchecked, 28.2s Time] [2022-07-12 16:52:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2022-07-12 16:52:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3742. [2022-07-12 16:52:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 2561 states have (on average 1.254978524014057) internal successors, (3214), 2646 states have internal predecessors, (3214), 926 states have call successors, (926), 225 states have call predecessors, (926), 229 states have return successors, (969), 908 states have call predecessors, (969), 924 states have call successors, (969) [2022-07-12 16:52:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 5109 transitions. [2022-07-12 16:52:58,646 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 5109 transitions. Word has length 99 [2022-07-12 16:52:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:52:58,647 INFO L495 AbstractCegarLoop]: Abstraction has 3742 states and 5109 transitions. [2022-07-12 16:52:58,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 18 states have internal predecessors, (69), 7 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-12 16:52:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 5109 transitions. [2022-07-12 16:52:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 16:52:58,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:52:58,648 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:52:58,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 16:52:58,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 16:52:58,855 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:52:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:52:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1428851801, now seen corresponding path program 1 times [2022-07-12 16:52:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:52:58,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619727101] [2022-07-12 16:52:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:52:58,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:52:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:58,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:52:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:52:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:52:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:52:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:52:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:52:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:59,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:52:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:59,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:52:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:52:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:52:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:52:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:52:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:52:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:52:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:52:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:52:59,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:52:59,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619727101] [2022-07-12 16:52:59,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619727101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:52:59,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:52:59,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:52:59,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363694510] [2022-07-12 16:52:59,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:52:59,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:52:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:52:59,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:52:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:52:59,053 INFO L87 Difference]: Start difference. First operand 3742 states and 5109 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:53:00,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:53:02,684 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:53:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:53:06,469 INFO L93 Difference]: Finished difference Result 3742 states and 5109 transitions. [2022-07-12 16:53:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:53:06,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-12 16:53:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:53:06,483 INFO L225 Difference]: With dead ends: 3742 [2022-07-12 16:53:06,483 INFO L226 Difference]: Without dead ends: 3740 [2022-07-12 16:53:06,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:53:06,485 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 4701 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:53:06,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 2870 Invalid, 5428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2931 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-07-12 16:53:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2022-07-12 16:53:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2022-07-12 16:53:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 2560 states have (on average 1.2546875) internal successors, (3212), 2644 states have internal predecessors, (3212), 926 states have call successors, (926), 225 states have call predecessors, (926), 229 states have return successors, (969), 908 states have call predecessors, (969), 924 states have call successors, (969) [2022-07-12 16:53:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5107 transitions. [2022-07-12 16:53:06,634 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5107 transitions. Word has length 94 [2022-07-12 16:53:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:53:06,635 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 5107 transitions. [2022-07-12 16:53:06,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:53:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5107 transitions. [2022-07-12 16:53:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 16:53:06,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:53:06,637 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:53:06,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 16:53:06,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:53:06,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:53:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1577371483, now seen corresponding path program 1 times [2022-07-12 16:53:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:53:06,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948488799] [2022-07-12 16:53:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:53:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:53:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:53:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:53:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:53:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:53:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:53:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:53:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:53:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:53:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:53:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:53:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 16:53:06,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:53:06,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948488799] [2022-07-12 16:53:06,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948488799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:53:06,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:53:06,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 16:53:06,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182855803] [2022-07-12 16:53:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:53:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:53:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:53:06,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:53:06,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 16:53:06,853 INFO L87 Difference]: Start difference. First operand 3740 states and 5107 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:53:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:53:12,882 INFO L93 Difference]: Finished difference Result 7670 states and 10549 transitions. [2022-07-12 16:53:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:53:12,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2022-07-12 16:53:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:53:12,897 INFO L225 Difference]: With dead ends: 7670 [2022-07-12 16:53:12,897 INFO L226 Difference]: Without dead ends: 3965 [2022-07-12 16:53:12,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:53:12,908 INFO L413 NwaCegarLoop]: 2074 mSDtfsCounter, 6102 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 3966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6200 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 6280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3966 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:53:12,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6200 Valid, 2582 Invalid, 6280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3966 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 16:53:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-07-12 16:53:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3741. [2022-07-12 16:53:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 2559 states have (on average 1.2532239155920282) internal successors, (3207), 2644 states have internal predecessors, (3207), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-12 16:53:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5114 transitions. [2022-07-12 16:53:13,083 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5114 transitions. Word has length 115 [2022-07-12 16:53:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:53:13,083 INFO L495 AbstractCegarLoop]: Abstraction has 3741 states and 5114 transitions. [2022-07-12 16:53:13,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:53:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5114 transitions. [2022-07-12 16:53:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 16:53:13,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:53:13,086 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:53:13,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 16:53:13,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:53:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:53:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash -250727530, now seen corresponding path program 1 times [2022-07-12 16:53:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:53:13,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053618679] [2022-07-12 16:53:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:53:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:53:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:53:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:53:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:53:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:53:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:53:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:53:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:53:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:53:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:53:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:53:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:53:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:53:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:53:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:53:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:53:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:53:13,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053618679] [2022-07-12 16:53:13,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053618679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:53:13,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:53:13,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:53:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571271708] [2022-07-12 16:53:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:53:13,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:53:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:53:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:53:13,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:53:13,266 INFO L87 Difference]: Start difference. First operand 3741 states and 5114 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 16:53:15,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:53:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:53:19,186 INFO L93 Difference]: Finished difference Result 3741 states and 5114 transitions. [2022-07-12 16:53:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:53:19,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-12 16:53:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:53:19,200 INFO L225 Difference]: With dead ends: 3741 [2022-07-12 16:53:19,200 INFO L226 Difference]: Without dead ends: 3739 [2022-07-12 16:53:19,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:53:19,202 INFO L413 NwaCegarLoop]: 2232 mSDtfsCounter, 4690 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 2928 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4774 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 5425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2928 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:53:19,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4774 Valid, 2849 Invalid, 5425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2928 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 16:53:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2022-07-12 16:53:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2022-07-12 16:53:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 2558 states have (on average 1.2529319781078967) internal successors, (3205), 2642 states have internal predecessors, (3205), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-12 16:53:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5112 transitions. [2022-07-12 16:53:19,325 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5112 transitions. Word has length 100 [2022-07-12 16:53:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:53:19,326 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5112 transitions. [2022-07-12 16:53:19,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 16:53:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5112 transitions. [2022-07-12 16:53:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 16:53:19,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:53:19,327 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:53:19,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 16:53:19,327 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:53:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:53:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1733111734, now seen corresponding path program 1 times [2022-07-12 16:53:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:53:19,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123409879] [2022-07-12 16:53:19,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:53:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:53:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:53:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:53:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:53:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:53:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:53:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:53:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:53:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:53:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:53:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:53:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:53:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-12 16:53:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:53:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123409879] [2022-07-12 16:53:19,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123409879] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:53:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893759619] [2022-07-12 16:53:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:53:19,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:53:19,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:53:19,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:53:19,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 16:53:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 16:53:20,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:53:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 16:53:20,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:53:20,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893759619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:53:20,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:53:20,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-12 16:53:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674770743] [2022-07-12 16:53:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:53:20,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 16:53:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:53:20,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 16:53:20,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:53:20,290 INFO L87 Difference]: Start difference. First operand 3739 states and 5112 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:53:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:53:20,426 INFO L93 Difference]: Finished difference Result 7437 states and 10168 transitions. [2022-07-12 16:53:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 16:53:20,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2022-07-12 16:53:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:53:20,438 INFO L225 Difference]: With dead ends: 7437 [2022-07-12 16:53:20,438 INFO L226 Difference]: Without dead ends: 3733 [2022-07-12 16:53:20,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:53:20,447 INFO L413 NwaCegarLoop]: 2611 mSDtfsCounter, 2590 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:53:20,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2590 Valid, 2611 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 16:53:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2022-07-12 16:53:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3733. [2022-07-12 16:53:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 2553 states have (on average 1.2518605562083822) internal successors, (3196), 2636 states have internal predecessors, (3196), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-12 16:53:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5103 transitions. [2022-07-12 16:53:20,579 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5103 transitions. Word has length 121 [2022-07-12 16:53:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:53:20,579 INFO L495 AbstractCegarLoop]: Abstraction has 3733 states and 5103 transitions. [2022-07-12 16:53:20,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:53:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5103 transitions. [2022-07-12 16:53:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 16:53:20,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:53:20,581 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:53:20,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 16:53:20,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 16:53:20,787 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:53:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:53:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1292108662, now seen corresponding path program 1 times [2022-07-12 16:53:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:53:20,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514631955] [2022-07-12 16:53:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:53:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:53:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:53:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:53:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:53:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:53:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:53:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:53:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:53:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:53:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:53:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:20,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:53:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 16:53:21,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:53:21,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514631955] [2022-07-12 16:53:21,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514631955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:53:21,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:53:21,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:53:21,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111391629] [2022-07-12 16:53:21,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:53:21,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:53:21,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:53:21,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:53:21,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:53:21,004 INFO L87 Difference]: Start difference. First operand 3733 states and 5103 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:53:22,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:53:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:53:31,006 INFO L93 Difference]: Finished difference Result 7594 states and 10483 transitions. [2022-07-12 16:53:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 16:53:31,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2022-07-12 16:53:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:53:31,026 INFO L225 Difference]: With dead ends: 7594 [2022-07-12 16:53:31,026 INFO L226 Difference]: Without dead ends: 3896 [2022-07-12 16:53:31,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-07-12 16:53:31,036 INFO L413 NwaCegarLoop]: 2232 mSDtfsCounter, 3718 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 9104 mSolverCounterSat, 2444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3718 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 11548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2444 IncrementalHoareTripleChecker+Valid, 9104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:53:31,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3718 Valid, 3535 Invalid, 11548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2444 Valid, 9104 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-07-12 16:53:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2022-07-12 16:53:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3739. [2022-07-12 16:53:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 2559 states have (on average 1.2512700273544353) internal successors, (3202), 2642 states have internal predecessors, (3202), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-12 16:53:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5109 transitions. [2022-07-12 16:53:31,167 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5109 transitions. Word has length 125 [2022-07-12 16:53:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:53:31,167 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5109 transitions. [2022-07-12 16:53:31,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:53:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5109 transitions. [2022-07-12 16:53:31,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 16:53:31,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:53:31,169 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:53:31,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 16:53:31,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:53:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:53:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash 562293705, now seen corresponding path program 1 times [2022-07-12 16:53:31,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:53:31,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078115790] [2022-07-12 16:53:31,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:53:31,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:53:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:53:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:53:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:53:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:53:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:53:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:53:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:53:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:53:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:53:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:53:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:53:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:53:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:53:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:53:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:53:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:53:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:53:31,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078115790] [2022-07-12 16:53:31,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078115790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:53:31,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:53:31,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:53:31,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428316690] [2022-07-12 16:53:31,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:53:31,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:53:31,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:53:31,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:53:31,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:53:31,352 INFO L87 Difference]: Start difference. First operand 3739 states and 5109 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:53:32,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:53:33,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:53:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:53:37,749 INFO L93 Difference]: Finished difference Result 3739 states and 5109 transitions. [2022-07-12 16:53:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:53:37,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-12 16:53:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:53:37,759 INFO L225 Difference]: With dead ends: 3739 [2022-07-12 16:53:37,759 INFO L226 Difference]: Without dead ends: 3737 [2022-07-12 16:53:37,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:53:37,761 INFO L413 NwaCegarLoop]: 2225 mSDtfsCounter, 4683 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2922 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4766 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 5418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:53:37,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4766 Valid, 2828 Invalid, 5418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2922 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-12 16:53:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2022-07-12 16:53:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3737. [2022-07-12 16:53:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3737 states, 2558 states have (on average 1.2509773260359656) internal successors, (3200), 2640 states have internal predecessors, (3200), 926 states have call successors, (926), 225 states have call predecessors, (926), 232 states have return successors, (981), 909 states have call predecessors, (981), 924 states have call successors, (981) [2022-07-12 16:53:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 5107 transitions. [2022-07-12 16:53:37,923 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 5107 transitions. Word has length 106 [2022-07-12 16:53:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:53:37,925 INFO L495 AbstractCegarLoop]: Abstraction has 3737 states and 5107 transitions. [2022-07-12 16:53:37,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:53:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 5107 transitions. [2022-07-12 16:53:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 16:53:37,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:53:37,926 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:53:37,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 16:53:37,927 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:53:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:53:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1412084910, now seen corresponding path program 1 times [2022-07-12 16:53:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:53:37,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347546030] [2022-07-12 16:53:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:53:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:53:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:53:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:53:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:53:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:53:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:53:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:53:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:53:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:53:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:53:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:53:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 16:53:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:53:38,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347546030] [2022-07-12 16:53:38,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347546030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:53:38,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:53:38,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 16:53:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60736537] [2022-07-12 16:53:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:53:38,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 16:53:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:53:38,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 16:53:38,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 16:53:38,175 INFO L87 Difference]: Start difference. First operand 3737 states and 5107 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:53:39,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:53:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:53:50,513 INFO L93 Difference]: Finished difference Result 8857 states and 12124 transitions. [2022-07-12 16:53:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 16:53:50,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2022-07-12 16:53:50,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:53:50,532 INFO L225 Difference]: With dead ends: 8857 [2022-07-12 16:53:50,532 INFO L226 Difference]: Without dead ends: 5155 [2022-07-12 16:53:50,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-07-12 16:53:50,544 INFO L413 NwaCegarLoop]: 2233 mSDtfsCounter, 6825 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 10560 mSolverCounterSat, 4000 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6916 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 14560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4000 IncrementalHoareTripleChecker+Valid, 10560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:53:50,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6916 Valid, 3435 Invalid, 14560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4000 Valid, 10560 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-07-12 16:53:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2022-07-12 16:53:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 4892. [2022-07-12 16:53:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 3348 states have (on average 1.246415770609319) internal successors, (4173), 3450 states have internal predecessors, (4173), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-12 16:53:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 6570 transitions. [2022-07-12 16:53:50,734 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 6570 transitions. Word has length 128 [2022-07-12 16:53:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:53:50,735 INFO L495 AbstractCegarLoop]: Abstraction has 4892 states and 6570 transitions. [2022-07-12 16:53:50,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:53:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 6570 transitions. [2022-07-12 16:53:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 16:53:50,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:53:50,736 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:53:50,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 16:53:50,736 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:53:50,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:53:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1412144492, now seen corresponding path program 1 times [2022-07-12 16:53:50,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:53:50,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316059253] [2022-07-12 16:53:50,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:53:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:53:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:53:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:53:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:53:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:53:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:53:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:53:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:53:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:53:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:53:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:53:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:53:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:50,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:53:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 16:53:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:53:51,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316059253] [2022-07-12 16:53:51,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316059253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:53:51,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:53:51,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 16:53:51,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099463961] [2022-07-12 16:53:51,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:53:51,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:53:51,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:53:51,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:53:51,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 16:53:51,004 INFO L87 Difference]: Start difference. First operand 4892 states and 6570 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 16:53:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:53:58,891 INFO L93 Difference]: Finished difference Result 5165 states and 6992 transitions. [2022-07-12 16:53:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:53:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 128 [2022-07-12 16:53:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:53:58,908 INFO L225 Difference]: With dead ends: 5165 [2022-07-12 16:53:58,908 INFO L226 Difference]: Without dead ends: 5163 [2022-07-12 16:53:58,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:53:58,911 INFO L413 NwaCegarLoop]: 2218 mSDtfsCounter, 3772 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 6665 mSolverCounterSat, 2462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3772 SdHoareTripleChecker+Valid, 3252 SdHoareTripleChecker+Invalid, 9127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2462 IncrementalHoareTripleChecker+Valid, 6665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:53:58,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3772 Valid, 3252 Invalid, 9127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2462 Valid, 6665 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-07-12 16:53:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2022-07-12 16:53:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4896. [2022-07-12 16:53:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4896 states, 3352 states have (on average 1.2455250596658711) internal successors, (4175), 3454 states have internal predecessors, (4175), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-12 16:53:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 6572 transitions. [2022-07-12 16:53:59,167 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 6572 transitions. Word has length 128 [2022-07-12 16:53:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:53:59,167 INFO L495 AbstractCegarLoop]: Abstraction has 4896 states and 6572 transitions. [2022-07-12 16:53:59,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 16:53:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 6572 transitions. [2022-07-12 16:53:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 16:53:59,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:53:59,169 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:53:59,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 16:53:59,169 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:53:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:53:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash -801451636, now seen corresponding path program 1 times [2022-07-12 16:53:59,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:53:59,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206983927] [2022-07-12 16:53:59,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:53:59,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:53:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:53:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:53:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:53:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:53:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:53:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:53:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:53:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:53:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:53:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:53:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:53:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:53:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:53:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:53:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:53:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:53:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:53:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:53:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:53:59,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206983927] [2022-07-12 16:53:59,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206983927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:53:59,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:53:59,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:53:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623192976] [2022-07-12 16:53:59,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:53:59,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:53:59,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:53:59,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:53:59,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:53:59,351 INFO L87 Difference]: Start difference. First operand 4896 states and 6572 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:54:01,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:05,658 INFO L93 Difference]: Finished difference Result 4896 states and 6572 transitions. [2022-07-12 16:54:05,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:05,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-12 16:54:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:05,671 INFO L225 Difference]: With dead ends: 4896 [2022-07-12 16:54:05,671 INFO L226 Difference]: Without dead ends: 4894 [2022-07-12 16:54:05,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:54:05,675 INFO L413 NwaCegarLoop]: 2223 mSDtfsCounter, 4671 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 5420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:05,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 2826 Invalid, 5420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2924 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-12 16:54:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2022-07-12 16:54:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4894. [2022-07-12 16:54:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4894 states, 3351 states have (on average 1.2452999104744853) internal successors, (4173), 3452 states have internal predecessors, (4173), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-12 16:54:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 6570 transitions. [2022-07-12 16:54:05,912 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 6570 transitions. Word has length 108 [2022-07-12 16:54:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:05,912 INFO L495 AbstractCegarLoop]: Abstraction has 4894 states and 6570 transitions. [2022-07-12 16:54:05,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:54:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 6570 transitions. [2022-07-12 16:54:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 16:54:05,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:05,914 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:05,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 16:54:05,914 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:54:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash -82159438, now seen corresponding path program 1 times [2022-07-12 16:54:05,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:05,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118327431] [2022-07-12 16:54:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:05,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:54:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:54:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:54:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:54:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:54:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:54:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:54:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:54:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:54:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:54:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:54:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:54:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:54:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:54:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:54:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 16:54:06,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:06,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118327431] [2022-07-12 16:54:06,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118327431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:06,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:06,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182978170] [2022-07-12 16:54:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:06,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:06,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:06,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:06,176 INFO L87 Difference]: Start difference. First operand 4894 states and 6570 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:54:09,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:13,885 INFO L93 Difference]: Finished difference Result 9992 states and 13573 transitions. [2022-07-12 16:54:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:13,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2022-07-12 16:54:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:13,903 INFO L225 Difference]: With dead ends: 9992 [2022-07-12 16:54:13,903 INFO L226 Difference]: Without dead ends: 5133 [2022-07-12 16:54:13,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:54:13,915 INFO L413 NwaCegarLoop]: 2211 mSDtfsCounter, 5437 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 3297 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5530 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 5245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3297 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:13,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5530 Valid, 2707 Invalid, 5245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3297 Valid, 1947 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-07-12 16:54:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2022-07-12 16:54:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 4884. [2022-07-12 16:54:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4884 states, 3342 states have (on average 1.2435667265110713) internal successors, (4156), 3442 states have internal predecessors, (4156), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-12 16:54:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 6553 transitions. [2022-07-12 16:54:14,149 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 6553 transitions. Word has length 132 [2022-07-12 16:54:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:14,151 INFO L495 AbstractCegarLoop]: Abstraction has 4884 states and 6553 transitions. [2022-07-12 16:54:14,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:54:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 6553 transitions. [2022-07-12 16:54:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 16:54:14,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:14,152 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:14,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 16:54:14,153 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:54:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash -199200027, now seen corresponding path program 1 times [2022-07-12 16:54:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:14,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738492211] [2022-07-12 16:54:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:54:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:54:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:54:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:54:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:54:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:54:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:54:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:54:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:54:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:54:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:54:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:54:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:54:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:54:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:54:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:54:14,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:14,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738492211] [2022-07-12 16:54:14,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738492211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:14,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:14,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:14,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806337643] [2022-07-12 16:54:14,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:14,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:14,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:14,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:14,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:14,315 INFO L87 Difference]: Start difference. First operand 4884 states and 6553 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:54:16,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:20,519 INFO L93 Difference]: Finished difference Result 4884 states and 6553 transitions. [2022-07-12 16:54:20,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:20,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-07-12 16:54:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:20,565 INFO L225 Difference]: With dead ends: 4884 [2022-07-12 16:54:20,565 INFO L226 Difference]: Without dead ends: 4882 [2022-07-12 16:54:20,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:54:20,568 INFO L413 NwaCegarLoop]: 2216 mSDtfsCounter, 4652 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:20,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 2819 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2916 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-07-12 16:54:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2022-07-12 16:54:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4882. [2022-07-12 16:54:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4882 states, 3341 states have (on average 1.2433403172702784) internal successors, (4154), 3440 states have internal predecessors, (4154), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-12 16:54:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 6551 transitions. [2022-07-12 16:54:20,764 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 6551 transitions. Word has length 114 [2022-07-12 16:54:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:20,764 INFO L495 AbstractCegarLoop]: Abstraction has 4882 states and 6551 transitions. [2022-07-12 16:54:20,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:54:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 6551 transitions. [2022-07-12 16:54:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 16:54:20,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:20,766 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:20,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 16:54:20,766 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:54:20,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash 755987782, now seen corresponding path program 1 times [2022-07-12 16:54:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:20,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632460784] [2022-07-12 16:54:20,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:54:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:54:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:54:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:54:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:54:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:54:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:54:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:54:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:54:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:54:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:54:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:54:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:54:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:54:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:54:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:54:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:54:20,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:20,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632460784] [2022-07-12 16:54:20,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632460784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:20,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:20,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3908525] [2022-07-12 16:54:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:20,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:20,991 INFO L87 Difference]: Start difference. First operand 4882 states and 6551 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 16:54:23,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:24,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:27,960 INFO L93 Difference]: Finished difference Result 4882 states and 6551 transitions. [2022-07-12 16:54:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:27,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-12 16:54:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:27,970 INFO L225 Difference]: With dead ends: 4882 [2022-07-12 16:54:27,970 INFO L226 Difference]: Without dead ends: 4880 [2022-07-12 16:54:27,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:54:27,972 INFO L413 NwaCegarLoop]: 2214 mSDtfsCounter, 4646 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2914 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 5411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2914 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:27,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 2817 Invalid, 5411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2914 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-07-12 16:54:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2022-07-12 16:54:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4880. [2022-07-12 16:54:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 3340 states have (on average 1.2431137724550898) internal successors, (4152), 3438 states have internal predecessors, (4152), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-12 16:54:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 6549 transitions. [2022-07-12 16:54:28,176 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 6549 transitions. Word has length 120 [2022-07-12 16:54:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:28,176 INFO L495 AbstractCegarLoop]: Abstraction has 4880 states and 6549 transitions. [2022-07-12 16:54:28,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 16:54:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 6549 transitions. [2022-07-12 16:54:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 16:54:28,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:28,178 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:28,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 16:54:28,178 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:54:28,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash 453861164, now seen corresponding path program 1 times [2022-07-12 16:54:28,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:28,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440649818] [2022-07-12 16:54:28,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:28,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:54:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:54:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:54:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:54:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:54:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:54:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:54:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:54:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:54:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:54:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:54:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:54:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:54:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:54:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:54:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:54:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:54:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:54:28,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:28,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440649818] [2022-07-12 16:54:28,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440649818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:28,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:28,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913893821] [2022-07-12 16:54:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:28,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:28,370 INFO L87 Difference]: Start difference. First operand 4880 states and 6549 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 16:54:29,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:30,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:34,560 INFO L93 Difference]: Finished difference Result 4880 states and 6549 transitions. [2022-07-12 16:54:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:34,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-12 16:54:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:34,568 INFO L225 Difference]: With dead ends: 4880 [2022-07-12 16:54:34,569 INFO L226 Difference]: Without dead ends: 4878 [2022-07-12 16:54:34,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:54:34,570 INFO L413 NwaCegarLoop]: 2212 mSDtfsCounter, 4640 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 5409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:34,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 2815 Invalid, 5409 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2496 Valid, 2913 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-12 16:54:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2022-07-12 16:54:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4878. [2022-07-12 16:54:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 3339 states have (on average 1.2428870919436956) internal successors, (4150), 3436 states have internal predecessors, (4150), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-12 16:54:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6547 transitions. [2022-07-12 16:54:34,754 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 6547 transitions. Word has length 126 [2022-07-12 16:54:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:34,754 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 6547 transitions. [2022-07-12 16:54:34,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 16:54:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 6547 transitions. [2022-07-12 16:54:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 16:54:34,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:34,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:34,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 16:54:34,756 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:54:34,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:34,756 INFO L85 PathProgramCache]: Analyzing trace with hash 51485224, now seen corresponding path program 1 times [2022-07-12 16:54:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:34,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273995251] [2022-07-12 16:54:34,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:54:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:54:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:54:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:54:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:54:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:54:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:54:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:54:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:54:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:54:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:54:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:54:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:54:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:54:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:54:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:54:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:54:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:54:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:54:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:34,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273995251] [2022-07-12 16:54:34,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273995251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:34,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:34,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977510474] [2022-07-12 16:54:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:34,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:34,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:34,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:34,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:34,940 INFO L87 Difference]: Start difference. First operand 4878 states and 6547 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 16:54:36,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:38,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:42,801 INFO L93 Difference]: Finished difference Result 4878 states and 6547 transitions. [2022-07-12 16:54:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:42,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-07-12 16:54:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:42,810 INFO L225 Difference]: With dead ends: 4878 [2022-07-12 16:54:42,810 INFO L226 Difference]: Without dead ends: 4876 [2022-07-12 16:54:42,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:54:42,812 INFO L413 NwaCegarLoop]: 2210 mSDtfsCounter, 4634 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 2496 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4713 SdHoareTripleChecker+Valid, 2813 SdHoareTripleChecker+Invalid, 5407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:42,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4713 Valid, 2813 Invalid, 5407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2909 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-07-12 16:54:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4876 states. [2022-07-12 16:54:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4876 to 4876. [2022-07-12 16:54:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 3338 states have (on average 1.2426602756141403) internal successors, (4148), 3434 states have internal predecessors, (4148), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-12 16:54:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 6545 transitions. [2022-07-12 16:54:43,018 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 6545 transitions. Word has length 132 [2022-07-12 16:54:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:43,019 INFO L495 AbstractCegarLoop]: Abstraction has 4876 states and 6545 transitions. [2022-07-12 16:54:43,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 16:54:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 6545 transitions. [2022-07-12 16:54:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 16:54:43,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:43,020 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:43,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 16:54:43,021 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:54:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash -421925399, now seen corresponding path program 1 times [2022-07-12 16:54:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:43,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012225528] [2022-07-12 16:54:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:43,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:54:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:54:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:54:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:54:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:54:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:54:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:54:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:54:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:54:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:54:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:54:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:54:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:54:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:54:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:54:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:54:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:54:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:54:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:54:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:54:43,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:43,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012225528] [2022-07-12 16:54:43,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012225528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:43,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:43,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:54:43,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119884814] [2022-07-12 16:54:43,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:43,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:54:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:54:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:54:43,224 INFO L87 Difference]: Start difference. First operand 4876 states and 6545 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 16:54:44,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:54:49,031 INFO L93 Difference]: Finished difference Result 4876 states and 6545 transitions. [2022-07-12 16:54:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:54:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-07-12 16:54:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:54:49,041 INFO L225 Difference]: With dead ends: 4876 [2022-07-12 16:54:49,041 INFO L226 Difference]: Without dead ends: 4874 [2022-07-12 16:54:49,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:54:49,042 INFO L413 NwaCegarLoop]: 2208 mSDtfsCounter, 4628 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4706 SdHoareTripleChecker+Valid, 2811 SdHoareTripleChecker+Invalid, 5405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:54:49,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4706 Valid, 2811 Invalid, 5405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2909 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 16:54:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2022-07-12 16:54:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4874. [2022-07-12 16:54:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 3337 states have (on average 1.2424333233443212) internal successors, (4146), 3432 states have internal predecessors, (4146), 1166 states have call successors, (1166), 347 states have call predecessors, (1166), 357 states have return successors, (1231), 1138 states have call predecessors, (1231), 1164 states have call successors, (1231) [2022-07-12 16:54:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6543 transitions. [2022-07-12 16:54:49,238 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6543 transitions. Word has length 138 [2022-07-12 16:54:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:54:49,238 INFO L495 AbstractCegarLoop]: Abstraction has 4874 states and 6543 transitions. [2022-07-12 16:54:49,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 16:54:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6543 transitions. [2022-07-12 16:54:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-12 16:54:49,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:54:49,239 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:54:49,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 16:54:49,240 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:54:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:54:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1058198755, now seen corresponding path program 1 times [2022-07-12 16:54:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:54:49,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656734233] [2022-07-12 16:54:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:54:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:54:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:54:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:54:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:54:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:54:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:54:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:54:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:54:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:54:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:54:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:54:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:54:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:54:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:54:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:54:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:54:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:54:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:54:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:54:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:54:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:54:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:54:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 16:54:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 16:54:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:54:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-12 16:54:49,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:54:49,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656734233] [2022-07-12 16:54:49,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656734233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:54:49,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:54:49,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-12 16:54:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844955060] [2022-07-12 16:54:49,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:54:49,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 16:54:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:54:49,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 16:54:49,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2022-07-12 16:54:49,774 INFO L87 Difference]: Start difference. First operand 4874 states and 6543 transitions. Second operand has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-07-12 16:54:51,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:54:53,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:55:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:18,946 INFO L93 Difference]: Finished difference Result 10732 states and 14604 transitions. [2022-07-12 16:55:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 16:55:18,948 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 167 [2022-07-12 16:55:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:18,962 INFO L225 Difference]: With dead ends: 10732 [2022-07-12 16:55:18,962 INFO L226 Difference]: Without dead ends: 5891 [2022-07-12 16:55:19,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1632, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 16:55:19,014 INFO L413 NwaCegarLoop]: 2513 mSDtfsCounter, 4931 mSDsluCounter, 6932 mSDsCounter, 0 mSdLazyCounter, 37960 mSolverCounterSat, 3831 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5014 SdHoareTripleChecker+Valid, 9445 SdHoareTripleChecker+Invalid, 41792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3831 IncrementalHoareTripleChecker+Valid, 37960 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:19,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5014 Valid, 9445 Invalid, 41792 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3831 Valid, 37960 Invalid, 1 Unknown, 0 Unchecked, 28.1s Time] [2022-07-12 16:55:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5891 states. [2022-07-12 16:55:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5891 to 4910. [2022-07-12 16:55:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4910 states, 3363 states have (on average 1.2405590246803448) internal successors, (4172), 3457 states have internal predecessors, (4172), 1174 states have call successors, (1174), 347 states have call predecessors, (1174), 359 states have return successors, (1243), 1148 states have call predecessors, (1243), 1172 states have call successors, (1243) [2022-07-12 16:55:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 6589 transitions. [2022-07-12 16:55:19,254 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 6589 transitions. Word has length 167 [2022-07-12 16:55:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:19,255 INFO L495 AbstractCegarLoop]: Abstraction has 4910 states and 6589 transitions. [2022-07-12 16:55:19,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 14 states have internal predecessors, (67), 6 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-07-12 16:55:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 6589 transitions. [2022-07-12 16:55:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 16:55:19,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:19,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:19,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 16:55:19,257 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:55:19,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1162726059, now seen corresponding path program 1 times [2022-07-12 16:55:19,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:19,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16825733] [2022-07-12 16:55:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:19,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:55:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:55:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:55:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:55:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:55:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:55:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:55:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:55:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:55:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:55:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:55:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:55:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:55:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:55:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:55:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:55:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:55:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:55:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:55:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:55:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 16:55:19,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:19,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16825733] [2022-07-12 16:55:19,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16825733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:55:19,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:55:19,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:55:19,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296368406] [2022-07-12 16:55:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:55:19,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:55:19,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:19,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:55:19,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:55:19,460 INFO L87 Difference]: Start difference. First operand 4910 states and 6589 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 16:55:21,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:55:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:55:26,014 INFO L93 Difference]: Finished difference Result 4910 states and 6589 transitions. [2022-07-12 16:55:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:55:26,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-12 16:55:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:55:26,024 INFO L225 Difference]: With dead ends: 4910 [2022-07-12 16:55:26,024 INFO L226 Difference]: Without dead ends: 4908 [2022-07-12 16:55:26,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:55:26,026 INFO L413 NwaCegarLoop]: 2206 mSDtfsCounter, 4622 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4699 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 5403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:55:26,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4699 Valid, 2809 Invalid, 5403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 16:55:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2022-07-12 16:55:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 4908. [2022-07-12 16:55:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 3362 states have (on average 1.2403331350386675) internal successors, (4170), 3455 states have internal predecessors, (4170), 1174 states have call successors, (1174), 347 states have call predecessors, (1174), 359 states have return successors, (1243), 1148 states have call predecessors, (1243), 1172 states have call successors, (1243) [2022-07-12 16:55:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 6587 transitions. [2022-07-12 16:55:26,272 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 6587 transitions. Word has length 144 [2022-07-12 16:55:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:55:26,272 INFO L495 AbstractCegarLoop]: Abstraction has 4908 states and 6587 transitions. [2022-07-12 16:55:26,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 16:55:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 6587 transitions. [2022-07-12 16:55:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 16:55:26,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:55:26,274 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:55:26,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 16:55:26,274 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:55:26,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:55:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash 88155449, now seen corresponding path program 1 times [2022-07-12 16:55:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:55:26,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147447153] [2022-07-12 16:55:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:26,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:55:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:55:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:55:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:55:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 16:55:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:55:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:55:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:55:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:55:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:55:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:55:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:55:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:55:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:55:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:55:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:55:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:55:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:55:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:55:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:55:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:55:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 16:55:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 16:55:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:55:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:55:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:55:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:55:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2022-07-12 16:55:26,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:55:26,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147447153] [2022-07-12 16:55:26,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147447153] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:55:26,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519579491] [2022-07-12 16:55:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:55:26,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:55:26,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:55:26,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:55:26,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 16:55:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:55:27,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 2222 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 16:55:27,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:55:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 179 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-12 16:55:27,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:55:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-07-12 16:55:28,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519579491] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:55:28,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:55:28,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 18 [2022-07-12 16:55:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400438348] [2022-07-12 16:55:28,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:55:28,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 16:55:28,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:55:28,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 16:55:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-12 16:55:28,191 INFO L87 Difference]: Start difference. First operand 4908 states and 6587 transitions. Second operand has 18 states, 17 states have (on average 5.705882352941177) internal successors, (97), 12 states have internal predecessors, (97), 5 states have call successors, (52), 6 states have call predecessors, (52), 5 states have return successors, (45), 6 states have call predecessors, (45), 5 states have call successors, (45) [2022-07-12 16:55:29,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:55:31,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []