./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 f4b24e32 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-?-f4b24e3 [2022-07-14 04:33:36,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:33:36,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:33:36,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:33:36,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:33:36,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:33:36,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:33:36,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:33:36,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:33:36,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:33:36,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:33:36,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:33:36,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:33:36,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:33:36,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:33:36,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:33:36,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:33:36,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:33:36,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:33:36,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:33:36,513 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:33:36,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:33:36,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:33:36,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:33:36,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:33:36,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:33:36,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:33:36,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:33:36,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:33:36,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:33:36,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:33:36,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:33:36,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:33:36,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:33:36,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:33:36,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:33:36,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:33:36,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:33:36,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:33:36,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:33:36,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:33:36,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:33:36,525 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:33:36,538 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:33:36,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:33:36,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:33:36,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:33:36,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:33:36,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:33:36,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:33:36,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:33:36,541 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:33:36,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:33:36,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:33:36,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:33:36,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:33:36,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:33:36,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:33:36,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:33:36,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:33:36,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:33:36,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:33:36,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:33:36,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:33:36,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:33:36,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:33:36,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:33:36,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:33:36,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:33:36,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:33:36,545 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:33:36,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:33:36,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:33:36,546 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-14 04:33:36,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:33:36,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:33:36,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:33:36,737 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:33:36,738 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:33:36,739 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-14 04:33:36,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893cf9e07/53944f476c3e431cb952aba49d636554/FLAG16a1197c1 [2022-07-14 04:33:37,484 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:33:37,485 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-14 04:33:37,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893cf9e07/53944f476c3e431cb952aba49d636554/FLAG16a1197c1 [2022-07-14 04:33:38,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893cf9e07/53944f476c3e431cb952aba49d636554 [2022-07-14 04:33:38,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:33:38,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:33:38,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:33:38,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:33:38,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:33:38,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:33:38" (1/1) ... [2022-07-14 04:33:38,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f28cc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:38, skipping insertion in model container [2022-07-14 04:33:38,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:33:38" (1/1) ... [2022-07-14 04:33:38,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:33:38,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:33:40,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2022-07-14 04:33:40,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,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[480943,480956] [2022-07-14 04:33:40,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,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[481242,481255] [2022-07-14 04:33:40,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[481385,481398] [2022-07-14 04:33:40,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[481537,481550] [2022-07-14 04:33:40,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[481683,481696] [2022-07-14 04:33:40,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[481828,481841] [2022-07-14 04:33:40,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[481982,481995] [2022-07-14 04:33:40,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[482133,482146] [2022-07-14 04:33:40,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[482288,482301] [2022-07-14 04:33:40,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[482440,482453] [2022-07-14 04:33:40,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[482595,482608] [2022-07-14 04:33:40,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[482759,482772] [2022-07-14 04:33:40,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[482915,482928] [2022-07-14 04:33:40,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[483079,483092] [2022-07-14 04:33:40,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[483221,483234] [2022-07-14 04:33:40,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[483379,483392] [2022-07-14 04:33:40,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[483546,483559] [2022-07-14 04:33:40,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[483705,483718] [2022-07-14 04:33:40,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[483864,483877] [2022-07-14 04:33:40,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[484013,484026] [2022-07-14 04:33:40,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[484160,484173] [2022-07-14 04:33:40,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[484299,484312] [2022-07-14 04:33:40,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[484462,484475] [2022-07-14 04:33:40,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[484628,484641] [2022-07-14 04:33:40,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[484792,484805] [2022-07-14 04:33:40,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[484957,484970] [2022-07-14 04:33:40,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[485122,485135] [2022-07-14 04:33:40,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[485288,485301] [2022-07-14 04:33:40,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[485453,485466] [2022-07-14 04:33:40,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[485620,485633] [2022-07-14 04:33:40,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[485780,485793] [2022-07-14 04:33:40,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[485942,485955] [2022-07-14 04:33:40,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[486101,486114] [2022-07-14 04:33:40,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[486247,486260] [2022-07-14 04:33:40,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[486390,486403] [2022-07-14 04:33:40,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[486534,486547] [2022-07-14 04:33:40,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[486677,486690] [2022-07-14 04:33:40,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[486821,486834] [2022-07-14 04:33:40,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[486962,486975] [2022-07-14 04:33:40,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[487100,487113] [2022-07-14 04:33:40,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[487258,487271] [2022-07-14 04:33:40,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[487417,487430] [2022-07-14 04:33:40,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[487573,487586] [2022-07-14 04:33:40,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[487722,487735] [2022-07-14 04:33:40,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[487874,487887] [2022-07-14 04:33:40,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[488025,488038] [2022-07-14 04:33:40,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[488174,488187] [2022-07-14 04:33:40,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[488326,488339] [2022-07-14 04:33:40,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[488474,488487] [2022-07-14 04:33:40,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[488627,488640] [2022-07-14 04:33:40,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[488778,488791] [2022-07-14 04:33:40,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[488928,488941] [2022-07-14 04:33:40,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[489075,489088] [2022-07-14 04:33:40,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[489226,489239] [2022-07-14 04:33:40,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[489377,489390] [2022-07-14 04:33:40,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:40,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:33:41,017 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:33:41,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-14 04:33:41,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:33:41,659 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:33:41,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41 WrapperNode [2022-07-14 04:33:41,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:33:41,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:33:41,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:33:41,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:33:41,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:41,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:41,865 INFO L137 Inliner]: procedures = 673, calls = 2647, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6079 [2022-07-14 04:33:41,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:33:41,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:33:41,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:33:41,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:33:41,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:41,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:41,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:41,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:42,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:42,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:42,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:42,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:33:42,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:33:42,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:33:42,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:33:42,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (1/1) ... [2022-07-14 04:33:42,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:33:42,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:33:42,116 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-14 04:33:42,133 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-14 04:33:42,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2022-07-14 04:33:42,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2022-07-14 04:33:42,143 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2022-07-14 04:33:42,143 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2022-07-14 04:33:42,143 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2022-07-14 04:33:42,143 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2022-07-14 04:33:42,143 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-14 04:33:42,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-14 04:33:42,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:33:42,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:33:42,144 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2022-07-14 04:33:42,144 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2022-07-14 04:33:42,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:33:42,144 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:33:42,144 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2022-07-14 04:33:42,144 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2022-07-14 04:33:42,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:33:42,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:33:42,145 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2022-07-14 04:33:42,145 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2022-07-14 04:33:42,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:33:42,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:33:42,145 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2022-07-14 04:33:42,145 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2022-07-14 04:33:42,145 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2022-07-14 04:33:42,145 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2022-07-14 04:33:42,145 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2022-07-14 04:33:42,146 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2022-07-14 04:33:42,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:33:42,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:33:42,146 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-14 04:33:42,146 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-14 04:33:42,146 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 04:33:42,146 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 04:33:42,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:33:42,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:33:42,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:33:42,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:33:42,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:33:42,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:33:42,147 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2022-07-14 04:33:42,147 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2022-07-14 04:33:42,147 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2022-07-14 04:33:42,147 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2022-07-14 04:33:42,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:33:42,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:33:42,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:33:42,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:33:42,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:33:42,148 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2022-07-14 04:33:42,148 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2022-07-14 04:33:42,148 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2022-07-14 04:33:42,148 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2022-07-14 04:33:42,148 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2022-07-14 04:33:42,148 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2022-07-14 04:33:42,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:33:42,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:33:42,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:33:42,149 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-14 04:33:42,149 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-14 04:33:42,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:33:42,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:33:42,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:33:42,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:33:42,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:33:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-14 04:33:42,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-14 04:33:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2022-07-14 04:33:42,150 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2022-07-14 04:33:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:33:42,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:33:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:33:42,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:33:42,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:33:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-14 04:33:42,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-14 04:33:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-14 04:33:42,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-14 04:33:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:33:42,151 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:33:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2022-07-14 04:33:42,151 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2022-07-14 04:33:42,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:33:42,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:33:42,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-14 04:33:42,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-14 04:33:42,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:33:42,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:33:42,152 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2022-07-14 04:33:42,152 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2022-07-14 04:33:42,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:33:42,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:33:42,152 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-14 04:33:42,152 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-14 04:33:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:33:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:33:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:33:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:33:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2022-07-14 04:33:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2022-07-14 04:33:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:33:42,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:33:42,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:33:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:33:42,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:33:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-14 04:33:42,154 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-14 04:33:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-14 04:33:42,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-14 04:33:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:33:42,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:33:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-14 04:33:42,154 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-14 04:33:42,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2022-07-14 04:33:42,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2022-07-14 04:33:42,155 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2022-07-14 04:33:42,155 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2022-07-14 04:33:42,155 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2022-07-14 04:33:42,155 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2022-07-14 04:33:42,155 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-14 04:33:42,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-14 04:33:42,155 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2022-07-14 04:33:42,155 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2022-07-14 04:33:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-14 04:33:42,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-14 04:33:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:33:42,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:33:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-14 04:33:42,156 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-14 04:33:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-14 04:33:42,156 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-14 04:33:42,156 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2022-07-14 04:33:42,156 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2022-07-14 04:33:42,157 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2022-07-14 04:33:42,157 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2022-07-14 04:33:42,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:33:42,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:33:42,157 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2022-07-14 04:33:42,157 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2022-07-14 04:33:42,157 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-14 04:33:42,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-14 04:33:42,157 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-14 04:33:42,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-14 04:33:42,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:33:42,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:33:42,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:33:42,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:33:42,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:33:42,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:33:42,158 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2022-07-14 04:33:42,158 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2022-07-14 04:33:42,158 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2022-07-14 04:33:42,158 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2022-07-14 04:33:42,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-14 04:33:42,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-14 04:33:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2022-07-14 04:33:42,159 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2022-07-14 04:33:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2022-07-14 04:33:42,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2022-07-14 04:33:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-14 04:33:42,159 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-14 04:33:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:33:42,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:33:42,159 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2022-07-14 04:33:42,160 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2022-07-14 04:33:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:33:42,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:33:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2022-07-14 04:33:42,160 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2022-07-14 04:33:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:33:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:33:42,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:33:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:33:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2022-07-14 04:33:42,160 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2022-07-14 04:33:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2022-07-14 04:33:42,161 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2022-07-14 04:33:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:33:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-14 04:33:42,161 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-14 04:33:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-14 04:33:42,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-14 04:33:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2022-07-14 04:33:42,161 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2022-07-14 04:33:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 04:33:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 04:33:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2022-07-14 04:33:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2022-07-14 04:33:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:33:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:33:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:33:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:33:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-14 04:33:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-14 04:33:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 04:33:42,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 04:33:42,163 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2022-07-14 04:33:42,163 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2022-07-14 04:33:42,163 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2022-07-14 04:33:42,163 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2022-07-14 04:33:42,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-14 04:33:42,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-14 04:33:42,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:33:42,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:33:42,163 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:33:42,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:33:42,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:33:42,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:33:42,164 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-14 04:33:42,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-14 04:33:42,164 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 04:33:42,164 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 04:33:42,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2022-07-14 04:33:42,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2022-07-14 04:33:42,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:33:42,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:33:42,165 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:33:42,165 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:33:42,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:33:42,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:33:42,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2022-07-14 04:33:42,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2022-07-14 04:33:42,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:33:42,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:33:42,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:33:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2022-07-14 04:33:42,166 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2022-07-14 04:33:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:33:42,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:33:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:33:42,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:33:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-14 04:33:42,166 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-14 04:33:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-14 04:33:42,166 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-14 04:33:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2022-07-14 04:33:42,167 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2022-07-14 04:33:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2022-07-14 04:33:42,167 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2022-07-14 04:33:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2022-07-14 04:33:42,167 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2022-07-14 04:33:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:33:42,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:33:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:33:42,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:33:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-14 04:33:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-14 04:33:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2022-07-14 04:33:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2022-07-14 04:33:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2022-07-14 04:33:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2022-07-14 04:33:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 04:33:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 04:33:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-14 04:33:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-14 04:33:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:33:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-14 04:33:42,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-14 04:33:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-14 04:33:42,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-14 04:33:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2022-07-14 04:33:42,169 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2022-07-14 04:33:42,874 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:33:42,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:33:43,178 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:33:47,194 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:33:47,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:33:47,230 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 04:33:47,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:33:47 BoogieIcfgContainer [2022-07-14 04:33:47,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:33:47,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:33:47,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:33:47,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:33:47,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:33:38" (1/3) ... [2022-07-14 04:33:47,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb6765b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:33:47, skipping insertion in model container [2022-07-14 04:33:47,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:33:41" (2/3) ... [2022-07-14 04:33:47,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb6765b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:33:47, skipping insertion in model container [2022-07-14 04:33:47,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:33:47" (3/3) ... [2022-07-14 04:33:47,240 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2022-07-14 04:33:47,252 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:33:47,252 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-14 04:33:47,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:33:47,328 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@4d3b27c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b1eac72 [2022-07-14 04:33:47,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-14 04:33:47,335 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-14 04:33:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 04:33:47,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:33:47,342 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-14 04:33:47,343 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-14 04:33:47,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:33:47,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1268169960, now seen corresponding path program 1 times [2022-07-14 04:33:47,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:33:47,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971205507] [2022-07-14 04:33:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:33:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:33:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:33:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:33:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:33:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:33:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:33:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:33:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:33:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:33:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:33:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:47,879 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-14 04:33:47,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:33:47,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971205507] [2022-07-14 04:33:47,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971205507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:33:47,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:33:47,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:33:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358267324] [2022-07-14 04:33:47,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:33:47,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:33:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:33:47,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:33:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:33:47,907 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-14 04:33:49,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:33:57,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:33:57,580 INFO L93 Difference]: Finished difference Result 5888 states and 8392 transitions. [2022-07-14 04:33:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:33:57,592 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-14 04:33:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:33:57,635 INFO L225 Difference]: With dead ends: 5888 [2022-07-14 04:33:57,636 INFO L226 Difference]: Without dead ends: 3905 [2022-07-14 04:33:57,685 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-14 04:33:57,687 INFO L413 NwaCegarLoop]: 2477 mSDtfsCounter, 7596 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 6489 mSolverCounterSat, 4215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s 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, 9.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:33:57,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7681 Valid, 3448 Invalid, 10704 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4215 Valid, 6489 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-07-14 04:33:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2022-07-14 04:33:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3713. [2022-07-14 04:33:57,888 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-14 04:33:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 5065 transitions. [2022-07-14 04:33:57,910 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 5065 transitions. Word has length 64 [2022-07-14 04:33:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:33:57,912 INFO L495 AbstractCegarLoop]: Abstraction has 3713 states and 5065 transitions. [2022-07-14 04:33:57,912 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-14 04:33:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 5065 transitions. [2022-07-14 04:33:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 04:33:57,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:33:57,919 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-14 04:33:57,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:33:57,920 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-14 04:33:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:33:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1435080531, now seen corresponding path program 1 times [2022-07-14 04:33:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:33:57,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581577106] [2022-07-14 04:33:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:33:57,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:33:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:33:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:33:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:33:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:33:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:33:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:33:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:33:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:33:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:33:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:33:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:33:58,226 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-14 04:33:58,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:33:58,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581577106] [2022-07-14 04:33:58,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581577106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:33:58,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:33:58,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:33:58,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247654707] [2022-07-14 04:33:58,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:33:58,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:33:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:33:58,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:33:58,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:33:58,230 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-14 04:33:59,795 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-14 04:34:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:34:03,833 INFO L93 Difference]: Finished difference Result 3713 states and 5065 transitions. [2022-07-14 04:34:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:34:03,833 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-14 04:34:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:34:03,848 INFO L225 Difference]: With dead ends: 3713 [2022-07-14 04:34:03,848 INFO L226 Difference]: Without dead ends: 3711 [2022-07-14 04:34:03,850 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-14 04:34:03,850 INFO L413 NwaCegarLoop]: 2247 mSDtfsCounter, 4725 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:34:03,851 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.4s Time] [2022-07-14 04:34:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2022-07-14 04:34:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2022-07-14 04:34:03,949 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-14 04:34:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 5063 transitions. [2022-07-14 04:34:03,964 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 5063 transitions. Word has length 70 [2022-07-14 04:34:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:34:03,965 INFO L495 AbstractCegarLoop]: Abstraction has 3711 states and 5063 transitions. [2022-07-14 04:34:03,965 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-14 04:34:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 5063 transitions. [2022-07-14 04:34:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 04:34:03,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:34:03,966 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-14 04:34:03,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:34:03,967 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-14 04:34:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:34:03,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1860087943, now seen corresponding path program 1 times [2022-07-14 04:34:03,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:34:03,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681034326] [2022-07-14 04:34:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:34:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:34:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:34:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:34:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:34:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:34:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:34:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:34:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:34:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:34:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:34:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:34:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:34:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:04,211 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-14 04:34:04,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:34:04,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681034326] [2022-07-14 04:34:04,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681034326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:34:04,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:34:04,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:34:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472278699] [2022-07-14 04:34:04,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:34:04,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:34:04,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:34:04,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:34:04,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:34:04,213 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-14 04:34:05,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:34:09,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:34:09,578 INFO L93 Difference]: Finished difference Result 3711 states and 5063 transitions. [2022-07-14 04:34:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:34:09,579 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-14 04:34:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:34:09,592 INFO L225 Difference]: With dead ends: 3711 [2022-07-14 04:34:09,592 INFO L226 Difference]: Without dead ends: 3709 [2022-07-14 04:34:09,594 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-14 04:34:09,596 INFO L413 NwaCegarLoop]: 2245 mSDtfsCounter, 4719 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:34:09,597 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.1s Time] [2022-07-14 04:34:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2022-07-14 04:34:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3709. [2022-07-14 04:34:09,682 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-14 04:34:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5061 transitions. [2022-07-14 04:34:09,694 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5061 transitions. Word has length 76 [2022-07-14 04:34:09,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:34:09,694 INFO L495 AbstractCegarLoop]: Abstraction has 3709 states and 5061 transitions. [2022-07-14 04:34:09,694 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-14 04:34:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5061 transitions. [2022-07-14 04:34:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 04:34:09,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:34:09,696 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-14 04:34:09,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:34:09,696 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-14 04:34:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:34:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1019236422, now seen corresponding path program 1 times [2022-07-14 04:34:09,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:34:09,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546079434] [2022-07-14 04:34:09,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:34:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:34:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:34:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:34:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:34:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:34:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:34:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:34:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:34:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:34:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:34:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:34:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:34:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:34:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:09,931 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-14 04:34:09,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:34:09,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546079434] [2022-07-14 04:34:09,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546079434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:34:09,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:34:09,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:34:09,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909284922] [2022-07-14 04:34:09,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:34:09,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:34:09,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:34:09,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:34:09,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:34:09,933 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-14 04:34:11,346 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:34:12,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:34:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:34:16,020 INFO L93 Difference]: Finished difference Result 3709 states and 5061 transitions. [2022-07-14 04:34:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:34:16,020 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-14 04:34:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:34:16,035 INFO L225 Difference]: With dead ends: 3709 [2022-07-14 04:34:16,036 INFO L226 Difference]: Without dead ends: 3707 [2022-07-14 04:34:16,037 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-14 04:34:16,038 INFO L413 NwaCegarLoop]: 2243 mSDtfsCounter, 4713 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:34:16,038 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.9s Time] [2022-07-14 04:34:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-07-14 04:34:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2022-07-14 04:34:16,207 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-14 04:34:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 5059 transitions. [2022-07-14 04:34:16,219 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 5059 transitions. Word has length 82 [2022-07-14 04:34:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:34:16,220 INFO L495 AbstractCegarLoop]: Abstraction has 3707 states and 5059 transitions. [2022-07-14 04:34:16,221 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-14 04:34:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 5059 transitions. [2022-07-14 04:34:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 04:34:16,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:34:16,222 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-14 04:34:16,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:34:16,222 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-14 04:34:16,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:34:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1523732060, now seen corresponding path program 1 times [2022-07-14 04:34:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:34:16,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533750745] [2022-07-14 04:34:16,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:34:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:34:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:34:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:34:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:34:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:34:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:34:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:34:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:34:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:34:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:34:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:34:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:34:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:34:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:34:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:16,451 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-14 04:34:16,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:34:16,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533750745] [2022-07-14 04:34:16,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533750745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:34:16,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:34:16,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:34:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132237695] [2022-07-14 04:34:16,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:34:16,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:34:16,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:34:16,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:34:16,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:34:16,453 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-14 04:34:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:34:21,079 INFO L93 Difference]: Finished difference Result 3707 states and 5059 transitions. [2022-07-14 04:34:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:34:21,080 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-14 04:34:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:34:21,094 INFO L225 Difference]: With dead ends: 3707 [2022-07-14 04:34:21,094 INFO L226 Difference]: Without dead ends: 3705 [2022-07-14 04:34:21,096 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-14 04:34:21,097 INFO L413 NwaCegarLoop]: 2241 mSDtfsCounter, 4707 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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, 4.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:34:21,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 2872 Invalid, 5430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-14 04:34:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2022-07-14 04:34:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3705. [2022-07-14 04:34:21,184 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-14 04:34:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5057 transitions. [2022-07-14 04:34:21,270 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5057 transitions. Word has length 88 [2022-07-14 04:34:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:34:21,270 INFO L495 AbstractCegarLoop]: Abstraction has 3705 states and 5057 transitions. [2022-07-14 04:34:21,271 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-14 04:34:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5057 transitions. [2022-07-14 04:34:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-14 04:34:21,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:34:21,272 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-14 04:34:21,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:34:21,272 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-14 04:34:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:34:21,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1546673947, now seen corresponding path program 1 times [2022-07-14 04:34:21,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:34:21,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717018055] [2022-07-14 04:34:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:34:21,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:34:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:34:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:34:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:34:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:34:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:34:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:34:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:34:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:34:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:34:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 04:34:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:34:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:34:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:34:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:34:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:34:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:21,912 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-14 04:34:21,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:34:21,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717018055] [2022-07-14 04:34:21,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717018055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:34:21,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209417532] [2022-07-14 04:34:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:34:21,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:34:21,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:34:21,915 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-14 04:34:21,919 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-14 04:34:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:22,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-14 04:34:22,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:34:22,791 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-14 04:34:22,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:34:23,014 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-14 04:34:23,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209417532] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:34:23,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:34:23,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 23 [2022-07-14 04:34:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72805426] [2022-07-14 04:34:23,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:34:23,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 04:34:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:34:23,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 04:34:23,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2022-07-14 04:34:23,016 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-14 04:34:24,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:34:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:34:51,413 INFO L93 Difference]: Finished difference Result 4846 states and 6526 transitions. [2022-07-14 04:34:51,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 04:34:51,413 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-14 04:34:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:34:51,429 INFO L225 Difference]: With dead ends: 4846 [2022-07-14 04:34:51,429 INFO L226 Difference]: Without dead ends: 3911 [2022-07-14 04:34:51,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2022-07-14 04:34:51,433 INFO L413 NwaCegarLoop]: 2264 mSDtfsCounter, 3760 mSDsluCounter, 5047 mSDsCounter, 0 mSdLazyCounter, 43253 mSolverCounterSat, 2757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3779 SdHoareTripleChecker+Valid, 7311 SdHoareTripleChecker+Invalid, 46010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2757 IncrementalHoareTripleChecker+Valid, 43253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:34:51,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3779 Valid, 7311 Invalid, 46010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2757 Valid, 43253 Invalid, 0 Unknown, 0 Unchecked, 27.7s Time] [2022-07-14 04:34:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2022-07-14 04:34:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3742. [2022-07-14 04:34:51,532 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-14 04:34:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 5109 transitions. [2022-07-14 04:34:51,542 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 5109 transitions. Word has length 99 [2022-07-14 04:34:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:34:51,542 INFO L495 AbstractCegarLoop]: Abstraction has 3742 states and 5109 transitions. [2022-07-14 04:34:51,542 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-14 04:34:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 5109 transitions. [2022-07-14 04:34:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 04:34:51,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:34:51,543 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-14 04:34:51,569 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-14 04:34:51,766 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-14 04:34:51,766 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-14 04:34:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:34:51,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1428851801, now seen corresponding path program 1 times [2022-07-14 04:34:51,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:34:51,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039303740] [2022-07-14 04:34:51,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:34:51,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:34:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:34:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:34:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:34:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:34:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:34:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:34:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:34:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:34:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:34:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:34:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:34:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:34:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:52,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:34:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:34:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:52,016 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-14 04:34:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:34:52,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039303740] [2022-07-14 04:34:52,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039303740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:34:52,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:34:52,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:34:52,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516865408] [2022-07-14 04:34:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:34:52,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:34:52,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:34:52,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:34:52,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:34:52,018 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-14 04:34:54,035 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-14 04:34:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:34:58,536 INFO L93 Difference]: Finished difference Result 3742 states and 5109 transitions. [2022-07-14 04:34:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:34:58,536 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-14 04:34:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:34:58,551 INFO L225 Difference]: With dead ends: 3742 [2022-07-14 04:34:58,551 INFO L226 Difference]: Without dead ends: 3740 [2022-07-14 04:34:58,552 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-14 04:34:58,553 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 4701 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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, 6.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:34:58,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 2870 Invalid, 5428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2931 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-14 04:34:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2022-07-14 04:34:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2022-07-14 04:34:58,655 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-14 04:34:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5107 transitions. [2022-07-14 04:34:58,664 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5107 transitions. Word has length 94 [2022-07-14 04:34:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:34:58,665 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 5107 transitions. [2022-07-14 04:34:58,665 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-14 04:34:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5107 transitions. [2022-07-14 04:34:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-14 04:34:58,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:34:58,666 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-14 04:34:58,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:34:58,667 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-14 04:34:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:34:58,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1577371483, now seen corresponding path program 1 times [2022-07-14 04:34:58,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:34:58,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354094625] [2022-07-14 04:34:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:34:58,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:34:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:34:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:34:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:34:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:34:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:34:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:34:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:34:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:34:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:34:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:34:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:34:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:34:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:34:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:34:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:34:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:34:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:34:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:34:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:34:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:34:58,890 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-14 04:34:58,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:34:58,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354094625] [2022-07-14 04:34:58,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354094625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:34:58,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:34:58,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:34:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66481447] [2022-07-14 04:34:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:34:58,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:34:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:34:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:34:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:34:58,892 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-14 04:35:00,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:35:01,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:35:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:35:06,396 INFO L93 Difference]: Finished difference Result 7670 states and 10549 transitions. [2022-07-14 04:35:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:35:06,396 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-14 04:35:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:35:06,417 INFO L225 Difference]: With dead ends: 7670 [2022-07-14 04:35:06,421 INFO L226 Difference]: Without dead ends: 3965 [2022-07-14 04:35:06,432 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-14 04:35:06,433 INFO L413 NwaCegarLoop]: 2084 mSDtfsCounter, 6078 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 3945 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6176 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 6265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3945 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:35:06,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6176 Valid, 2592 Invalid, 6265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3945 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-07-14 04:35:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-07-14 04:35:06,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3741. [2022-07-14 04:35:06,565 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-14 04:35:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5114 transitions. [2022-07-14 04:35:06,576 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5114 transitions. Word has length 115 [2022-07-14 04:35:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:35:06,576 INFO L495 AbstractCegarLoop]: Abstraction has 3741 states and 5114 transitions. [2022-07-14 04:35:06,576 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-14 04:35:06,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5114 transitions. [2022-07-14 04:35:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 04:35:06,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:35:06,580 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-14 04:35:06,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:35:06,580 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-14 04:35:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:35:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash -250727530, now seen corresponding path program 1 times [2022-07-14 04:35:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:35:06,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889292539] [2022-07-14 04:35:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:35:06,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:35:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:35:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:35:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:35:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:35:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:35:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:35:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:35:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:35:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:35:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:35:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:35:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:35:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:35:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:35:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:06,785 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-14 04:35:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:35:06,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889292539] [2022-07-14 04:35:06,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889292539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:35:06,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:35:06,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:35:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697954696] [2022-07-14 04:35:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:35:06,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:35:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:35:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:35:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:35:06,787 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-14 04:35:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:35:11,673 INFO L93 Difference]: Finished difference Result 3741 states and 5114 transitions. [2022-07-14 04:35:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:35:11,673 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-14 04:35:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:35:11,683 INFO L225 Difference]: With dead ends: 3741 [2022-07-14 04:35:11,683 INFO L226 Difference]: Without dead ends: 3739 [2022-07-14 04:35:11,684 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-14 04:35:11,685 INFO L413 NwaCegarLoop]: 2232 mSDtfsCounter, 4690 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 2929 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 2929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:35:11,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4774 Valid, 2849 Invalid, 5425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2929 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-14 04:35:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2022-07-14 04:35:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2022-07-14 04:35:11,802 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-14 04:35:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5112 transitions. [2022-07-14 04:35:11,812 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5112 transitions. Word has length 100 [2022-07-14 04:35:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:35:11,812 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5112 transitions. [2022-07-14 04:35:11,813 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-14 04:35:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5112 transitions. [2022-07-14 04:35:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-14 04:35:11,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:35:11,814 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-14 04:35:11,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:35:11,814 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-14 04:35:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:35:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1733111734, now seen corresponding path program 1 times [2022-07-14 04:35:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:35:11,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147394367] [2022-07-14 04:35:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:35:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:35:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:35:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:35:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:35:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:35:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:35:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:35:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:35:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:35:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:11,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:35:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:12,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:35:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:35:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:12,047 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-14 04:35:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:35:12,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147394367] [2022-07-14 04:35:12,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147394367] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:35:12,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333414405] [2022-07-14 04:35:12,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:35:12,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:35:12,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:35:12,049 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-14 04:35:12,050 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-14 04:35:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:12,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 04:35:12,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:35:12,809 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-14 04:35:12,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:35:12,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333414405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:35:12,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:35:12,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-14 04:35:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607831466] [2022-07-14 04:35:12,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:35:12,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:35:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:35:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:35:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:35:12,810 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-14 04:35:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:35:12,957 INFO L93 Difference]: Finished difference Result 7437 states and 10168 transitions. [2022-07-14 04:35:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:35:12,958 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-14 04:35:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:35:12,972 INFO L225 Difference]: With dead ends: 7437 [2022-07-14 04:35:12,973 INFO L226 Difference]: Without dead ends: 3733 [2022-07-14 04:35:12,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:35:12,983 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-14 04:35:12,983 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-14 04:35:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2022-07-14 04:35:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3733. [2022-07-14 04:35:13,112 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-14 04:35:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5103 transitions. [2022-07-14 04:35:13,122 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5103 transitions. Word has length 121 [2022-07-14 04:35:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:35:13,123 INFO L495 AbstractCegarLoop]: Abstraction has 3733 states and 5103 transitions. [2022-07-14 04:35:13,123 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-14 04:35:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5103 transitions. [2022-07-14 04:35:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-14 04:35:13,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:35:13,125 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-14 04:35:13,147 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-14 04:35:13,339 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-14 04:35:13,340 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-14 04:35:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:35:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1292108662, now seen corresponding path program 1 times [2022-07-14 04:35:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:35:13,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062093552] [2022-07-14 04:35:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:35:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:35:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:35:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:35:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:35:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:35:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:35:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:35:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:35:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:35:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:35:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:35:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:13,586 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-14 04:35:13,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:35:13,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062093552] [2022-07-14 04:35:13,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062093552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:35:13,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:35:13,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:35:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511442382] [2022-07-14 04:35:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:35:13,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:35:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:35:13,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:35:13,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:35:13,588 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-14 04:35:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:35:23,575 INFO L93 Difference]: Finished difference Result 7594 states and 10483 transitions. [2022-07-14 04:35:23,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 04:35:23,579 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-14 04:35:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:35:23,593 INFO L225 Difference]: With dead ends: 7594 [2022-07-14 04:35:23,593 INFO L226 Difference]: Without dead ends: 3896 [2022-07-14 04:35:23,604 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-14 04:35:23,604 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 3706 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 9129 mSolverCounterSat, 2439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3706 SdHoareTripleChecker+Valid, 3542 SdHoareTripleChecker+Invalid, 11568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2439 IncrementalHoareTripleChecker+Valid, 9129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:35:23,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3706 Valid, 3542 Invalid, 11568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2439 Valid, 9129 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-07-14 04:35:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2022-07-14 04:35:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3739. [2022-07-14 04:35:23,779 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-14 04:35:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5109 transitions. [2022-07-14 04:35:23,789 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5109 transitions. Word has length 125 [2022-07-14 04:35:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:35:23,792 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5109 transitions. [2022-07-14 04:35:23,792 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-14 04:35:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5109 transitions. [2022-07-14 04:35:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 04:35:23,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:35:23,793 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-14 04:35:23,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:35:23,794 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-14 04:35:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:35:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash 562293705, now seen corresponding path program 1 times [2022-07-14 04:35:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:35:23,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218821439] [2022-07-14 04:35:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:35:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:35:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:35:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:35:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:35:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:35:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:35:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:35:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:35:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:35:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:35:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:35:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:35:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:35:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:35:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:35:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:35:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:23,984 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-14 04:35:23,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:35:23,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218821439] [2022-07-14 04:35:23,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218821439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:35:23,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:35:23,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:35:23,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899100389] [2022-07-14 04:35:23,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:35:23,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:35:23,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:35:23,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:35:23,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:35:23,986 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-14 04:35:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:35:29,270 INFO L93 Difference]: Finished difference Result 3739 states and 5109 transitions. [2022-07-14 04:35:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:35:29,271 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-14 04:35:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:35:29,281 INFO L225 Difference]: With dead ends: 3739 [2022-07-14 04:35:29,281 INFO L226 Difference]: Without dead ends: 3737 [2022-07-14 04:35:29,283 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-14 04:35:29,283 INFO L413 NwaCegarLoop]: 2225 mSDtfsCounter, 4683 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2922 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:35:29,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4766 Valid, 2828 Invalid, 5418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2922 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-14 04:35:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2022-07-14 04:35:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3737. [2022-07-14 04:35:29,493 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-14 04:35:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 5107 transitions. [2022-07-14 04:35:29,503 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 5107 transitions. Word has length 106 [2022-07-14 04:35:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:35:29,503 INFO L495 AbstractCegarLoop]: Abstraction has 3737 states and 5107 transitions. [2022-07-14 04:35:29,504 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-14 04:35:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 5107 transitions. [2022-07-14 04:35:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-14 04:35:29,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:35:29,505 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-14 04:35:29,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:35:29,506 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-14 04:35:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:35:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1412084910, now seen corresponding path program 1 times [2022-07-14 04:35:29,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:35:29,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595775703] [2022-07-14 04:35:29,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:35:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:35:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:35:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:35:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:35:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:35:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:35:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:35:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:35:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:35:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:35:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:35:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:29,751 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-14 04:35:29,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:35:29,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595775703] [2022-07-14 04:35:29,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595775703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:35:29,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:35:29,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:35:29,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33251421] [2022-07-14 04:35:29,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:35:29,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:35:29,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:35:29,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:35:29,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:35:29,753 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-14 04:35:31,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:35:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:35:42,060 INFO L93 Difference]: Finished difference Result 8857 states and 12124 transitions. [2022-07-14 04:35:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 04:35:42,061 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-14 04:35:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:35:42,074 INFO L225 Difference]: With dead ends: 8857 [2022-07-14 04:35:42,074 INFO L226 Difference]: Without dead ends: 5155 [2022-07-14 04:35:42,085 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-14 04:35:42,089 INFO L413 NwaCegarLoop]: 2233 mSDtfsCounter, 6825 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 10550 mSolverCounterSat, 4006 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6916 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 14556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4006 IncrementalHoareTripleChecker+Valid, 10550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:35:42,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6916 Valid, 3435 Invalid, 14556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4006 Valid, 10550 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-07-14 04:35:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2022-07-14 04:35:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 4892. [2022-07-14 04:35:42,273 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-14 04:35:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 6570 transitions. [2022-07-14 04:35:42,286 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 6570 transitions. Word has length 128 [2022-07-14 04:35:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:35:42,286 INFO L495 AbstractCegarLoop]: Abstraction has 4892 states and 6570 transitions. [2022-07-14 04:35:42,286 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-14 04:35:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 6570 transitions. [2022-07-14 04:35:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-14 04:35:42,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:35:42,288 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-14 04:35:42,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:35:42,288 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-14 04:35:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:35:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1412144492, now seen corresponding path program 1 times [2022-07-14 04:35:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:35:42,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233553219] [2022-07-14 04:35:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:35:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:35:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:35:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:35:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:35:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:35:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:35:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:35:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:35:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:35:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:35:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:35:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:42,486 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-14 04:35:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:35:42,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233553219] [2022-07-14 04:35:42,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233553219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:35:42,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:35:42,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:35:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271475458] [2022-07-14 04:35:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:35:42,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:35:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:35:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:35:42,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:35:42,490 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-14 04:35:43,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:35:45,620 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-14 04:35:47,626 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-14 04:35:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:35:53,897 INFO L93 Difference]: Finished difference Result 5165 states and 6992 transitions. [2022-07-14 04:35:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:35:53,898 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-14 04:35:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:35:53,913 INFO L225 Difference]: With dead ends: 5165 [2022-07-14 04:35:53,913 INFO L226 Difference]: Without dead ends: 5163 [2022-07-14 04:35:53,915 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-14 04:35:53,915 INFO L413 NwaCegarLoop]: 2235 mSDtfsCounter, 3748 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 6704 mSolverCounterSat, 2443 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3748 SdHoareTripleChecker+Valid, 3269 SdHoareTripleChecker+Invalid, 9149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2443 IncrementalHoareTripleChecker+Valid, 6704 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:35:53,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3748 Valid, 3269 Invalid, 9149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2443 Valid, 6704 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2022-07-14 04:35:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2022-07-14 04:35:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4896. [2022-07-14 04:35:54,114 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-14 04:35:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 6572 transitions. [2022-07-14 04:35:54,129 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 6572 transitions. Word has length 128 [2022-07-14 04:35:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:35:54,129 INFO L495 AbstractCegarLoop]: Abstraction has 4896 states and 6572 transitions. [2022-07-14 04:35:54,129 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-14 04:35:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 6572 transitions. [2022-07-14 04:35:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-14 04:35:54,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:35:54,131 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-14 04:35:54,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:35:54,132 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-14 04:35:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:35:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash -801451636, now seen corresponding path program 1 times [2022-07-14 04:35:54,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:35:54,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339307618] [2022-07-14 04:35:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:35:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:35:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:35:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:35:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:35:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:35:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:35:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:35:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:35:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:35:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:35:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:35:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:35:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:35:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:35:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:35:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:35:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:54,381 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-14 04:35:54,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:35:54,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339307618] [2022-07-14 04:35:54,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339307618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:35:54,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:35:54,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:35:54,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240621912] [2022-07-14 04:35:54,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:35:54,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:35:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:35:54,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:35:54,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:35:54,385 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-14 04:35:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:35:59,458 INFO L93 Difference]: Finished difference Result 4896 states and 6572 transitions. [2022-07-14 04:35:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:35:59,459 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-14 04:35:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:35:59,471 INFO L225 Difference]: With dead ends: 4896 [2022-07-14 04:35:59,471 INFO L226 Difference]: Without dead ends: 4894 [2022-07-14 04:35:59,473 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-14 04:35:59,473 INFO L413 NwaCegarLoop]: 2223 mSDtfsCounter, 4671 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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, 4.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:35:59,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 2826 Invalid, 5420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2924 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-14 04:35:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2022-07-14 04:35:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4894. [2022-07-14 04:35:59,662 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-14 04:35:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 6570 transitions. [2022-07-14 04:35:59,675 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 6570 transitions. Word has length 108 [2022-07-14 04:35:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:35:59,675 INFO L495 AbstractCegarLoop]: Abstraction has 4894 states and 6570 transitions. [2022-07-14 04:35:59,676 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-14 04:35:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 6570 transitions. [2022-07-14 04:35:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-14 04:35:59,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:35:59,677 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-14 04:35:59,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:35:59,677 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-14 04:35:59,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:35:59,678 INFO L85 PathProgramCache]: Analyzing trace with hash -82159438, now seen corresponding path program 1 times [2022-07-14 04:35:59,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:35:59,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951384971] [2022-07-14 04:35:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:35:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:35:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:35:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:35:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:35:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:35:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:35:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:35:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:35:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:35:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:35:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:35:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:35:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:35:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:35:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:35:59,942 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-14 04:35:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:35:59,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951384971] [2022-07-14 04:35:59,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951384971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:35:59,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:35:59,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:35:59,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403571618] [2022-07-14 04:35:59,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:35:59,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:35:59,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:35:59,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:35:59,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:35:59,944 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-14 04:36:01,961 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-14 04:36:03,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:36:05,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:36:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:09,042 INFO L93 Difference]: Finished difference Result 9992 states and 13573 transitions. [2022-07-14 04:36:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:09,043 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-14 04:36:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:09,057 INFO L225 Difference]: With dead ends: 9992 [2022-07-14 04:36:09,058 INFO L226 Difference]: Without dead ends: 5133 [2022-07-14 04:36:09,073 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-14 04:36:09,074 INFO L413 NwaCegarLoop]: 2211 mSDtfsCounter, 5437 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 3291 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5530 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 5243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3291 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:09,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5530 Valid, 2707 Invalid, 5243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3291 Valid, 1951 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2022-07-14 04:36:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2022-07-14 04:36:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 4884. [2022-07-14 04:36:09,284 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-14 04:36:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 6553 transitions. [2022-07-14 04:36:09,402 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 6553 transitions. Word has length 132 [2022-07-14 04:36:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:09,403 INFO L495 AbstractCegarLoop]: Abstraction has 4884 states and 6553 transitions. [2022-07-14 04:36:09,403 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-14 04:36:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 6553 transitions. [2022-07-14 04:36:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 04:36:09,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:09,405 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-14 04:36:09,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:36:09,405 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-14 04:36:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash -199200027, now seen corresponding path program 1 times [2022-07-14 04:36:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:09,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502760499] [2022-07-14 04:36:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:36:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:36:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:36:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:36:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:36:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:36:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:36:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:36:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:36:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:36:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:36:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:36:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:36:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:36:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:09,576 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-14 04:36:09,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:09,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502760499] [2022-07-14 04:36:09,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502760499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:09,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:09,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:09,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128205191] [2022-07-14 04:36:09,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:09,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:09,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:09,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:09,579 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-14 04:36:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:14,735 INFO L93 Difference]: Finished difference Result 4884 states and 6553 transitions. [2022-07-14 04:36:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:14,735 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-14 04:36:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:14,746 INFO L225 Difference]: With dead ends: 4884 [2022-07-14 04:36:14,747 INFO L226 Difference]: Without dead ends: 4882 [2022-07-14 04:36:14,748 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-14 04:36:14,748 INFO L413 NwaCegarLoop]: 2216 mSDtfsCounter, 4652 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:14,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 2819 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2917 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-14 04:36:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2022-07-14 04:36:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4882. [2022-07-14 04:36:15,000 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-14 04:36:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 6551 transitions. [2022-07-14 04:36:15,015 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 6551 transitions. Word has length 114 [2022-07-14 04:36:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:15,015 INFO L495 AbstractCegarLoop]: Abstraction has 4882 states and 6551 transitions. [2022-07-14 04:36:15,015 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-14 04:36:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 6551 transitions. [2022-07-14 04:36:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:36:15,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:15,017 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-14 04:36:15,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:36:15,017 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-14 04:36:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:15,017 INFO L85 PathProgramCache]: Analyzing trace with hash 755987782, now seen corresponding path program 1 times [2022-07-14 04:36:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:15,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047178344] [2022-07-14 04:36:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:15,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:36:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:36:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:36:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:36:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:36:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:36:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:36:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:36:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:36:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:36:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:36:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:36:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:36:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:36:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:36:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:15,236 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-14 04:36:15,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:15,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047178344] [2022-07-14 04:36:15,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047178344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:15,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:15,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:15,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787494288] [2022-07-14 04:36:15,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:15,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:15,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:15,238 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-14 04:36:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:20,278 INFO L93 Difference]: Finished difference Result 4882 states and 6551 transitions. [2022-07-14 04:36:20,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:20,278 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-14 04:36:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:20,290 INFO L225 Difference]: With dead ends: 4882 [2022-07-14 04:36:20,290 INFO L226 Difference]: Without dead ends: 4880 [2022-07-14 04:36:20,291 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-14 04:36:20,292 INFO L413 NwaCegarLoop]: 2214 mSDtfsCounter, 4646 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2915 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 5411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:20,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 2817 Invalid, 5411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2915 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-14 04:36:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2022-07-14 04:36:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4880. [2022-07-14 04:36:20,518 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-14 04:36:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 6549 transitions. [2022-07-14 04:36:20,532 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 6549 transitions. Word has length 120 [2022-07-14 04:36:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:20,532 INFO L495 AbstractCegarLoop]: Abstraction has 4880 states and 6549 transitions. [2022-07-14 04:36:20,532 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-14 04:36:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 6549 transitions. [2022-07-14 04:36:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-14 04:36:20,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:20,534 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-14 04:36:20,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:36:20,535 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-14 04:36:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 453861164, now seen corresponding path program 1 times [2022-07-14 04:36:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:20,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394582241] [2022-07-14 04:36:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:36:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:36:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:36:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:36:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:36:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:36:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:36:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:36:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:36:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:36:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:36:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:36:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:36:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:36:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:36:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:36:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:20,737 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-14 04:36:20,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:20,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394582241] [2022-07-14 04:36:20,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394582241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:20,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:20,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:20,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897220991] [2022-07-14 04:36:20,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:20,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:20,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:20,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:20,740 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-14 04:36:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:25,710 INFO L93 Difference]: Finished difference Result 4880 states and 6549 transitions. [2022-07-14 04:36:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:25,716 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-14 04:36:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:25,725 INFO L225 Difference]: With dead ends: 4880 [2022-07-14 04:36:25,725 INFO L226 Difference]: Without dead ends: 4878 [2022-07-14 04:36:25,726 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-14 04:36:25,727 INFO L413 NwaCegarLoop]: 2212 mSDtfsCounter, 4640 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 5409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:25,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 2815 Invalid, 5409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2913 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-14 04:36:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2022-07-14 04:36:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4878. [2022-07-14 04:36:25,918 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-14 04:36:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6547 transitions. [2022-07-14 04:36:25,931 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 6547 transitions. Word has length 126 [2022-07-14 04:36:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:25,932 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 6547 transitions. [2022-07-14 04:36:25,932 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-14 04:36:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 6547 transitions. [2022-07-14 04:36:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-14 04:36:25,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:25,933 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-14 04:36:25,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:36:25,934 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-14 04:36:25,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash 51485224, now seen corresponding path program 1 times [2022-07-14 04:36:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:25,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624687010] [2022-07-14 04:36:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:36:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:36:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:36:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:36:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:36:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:36:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:36:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:36:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:36:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:36:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:36:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:36:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:36:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:36:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:36:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:36:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:36:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:26,141 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-14 04:36:26,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:26,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624687010] [2022-07-14 04:36:26,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624687010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:26,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:26,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:26,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356087651] [2022-07-14 04:36:26,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:26,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:26,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:26,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:26,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:26,144 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-14 04:36:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:31,149 INFO L93 Difference]: Finished difference Result 4878 states and 6547 transitions. [2022-07-14 04:36:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:31,149 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-14 04:36:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:31,159 INFO L225 Difference]: With dead ends: 4878 [2022-07-14 04:36:31,159 INFO L226 Difference]: Without dead ends: 4876 [2022-07-14 04:36:31,160 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-14 04:36:31,161 INFO L413 NwaCegarLoop]: 2210 mSDtfsCounter, 4634 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4713 SdHoareTripleChecker+Valid, 2813 SdHoareTripleChecker+Invalid, 5407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:31,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4713 Valid, 2813 Invalid, 5407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-14 04:36:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4876 states. [2022-07-14 04:36:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4876 to 4876. [2022-07-14 04:36:31,360 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-14 04:36:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 6545 transitions. [2022-07-14 04:36:31,371 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 6545 transitions. Word has length 132 [2022-07-14 04:36:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:31,372 INFO L495 AbstractCegarLoop]: Abstraction has 4876 states and 6545 transitions. [2022-07-14 04:36:31,372 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-14 04:36:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 6545 transitions. [2022-07-14 04:36:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 04:36:31,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:31,373 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-14 04:36:31,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:36:31,374 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-14 04:36:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash -421925399, now seen corresponding path program 1 times [2022-07-14 04:36:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:31,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301590565] [2022-07-14 04:36:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:36:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:36:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:36:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:36:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:36:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:36:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:36:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:36:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:36:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:36:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:36:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:36:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:36:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:36:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:36:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:36:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:36:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:36:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:36:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:31,563 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-14 04:36:31,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:31,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301590565] [2022-07-14 04:36:31,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301590565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:31,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:31,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:36:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313852552] [2022-07-14 04:36:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:31,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:36:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:36:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:36:31,567 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-14 04:36:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:36:36,622 INFO L93 Difference]: Finished difference Result 4876 states and 6545 transitions. [2022-07-14 04:36:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:36:36,623 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-14 04:36:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:36:36,633 INFO L225 Difference]: With dead ends: 4876 [2022-07-14 04:36:36,633 INFO L226 Difference]: Without dead ends: 4874 [2022-07-14 04:36:36,635 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-14 04:36:36,635 INFO L413 NwaCegarLoop]: 2208 mSDtfsCounter, 4628 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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, 4.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:36:36,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4706 Valid, 2811 Invalid, 5405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2909 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-14 04:36:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2022-07-14 04:36:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4874. [2022-07-14 04:36:36,838 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-14 04:36:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6543 transitions. [2022-07-14 04:36:36,851 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6543 transitions. Word has length 138 [2022-07-14 04:36:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:36:36,851 INFO L495 AbstractCegarLoop]: Abstraction has 4874 states and 6543 transitions. [2022-07-14 04:36:36,851 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-14 04:36:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6543 transitions. [2022-07-14 04:36:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-14 04:36:36,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:36:36,853 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-14 04:36:36,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:36:36,854 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-14 04:36:36,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:36:36,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1058198755, now seen corresponding path program 1 times [2022-07-14 04:36:36,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:36:36,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676029453] [2022-07-14 04:36:36,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:36:36,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:36:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:36:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:36:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:36:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:36:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:36:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:36:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:36:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:36:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:36:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:36:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:36:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:36:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:36:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:36:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:36:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:36:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:36:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:36:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:36:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:36:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:36:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 04:36:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 04:36:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:36:37,377 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-14 04:36:37,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:36:37,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676029453] [2022-07-14 04:36:37,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676029453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:36:37,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:36:37,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-14 04:36:37,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717735280] [2022-07-14 04:36:37,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:36:37,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 04:36:37,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:36:37,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 04:36:37,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2022-07-14 04:36:37,380 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-14 04:36:39,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:07,215 INFO L93 Difference]: Finished difference Result 10732 states and 14604 transitions. [2022-07-14 04:37:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 04:37:07,216 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-14 04:37:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:07,229 INFO L225 Difference]: With dead ends: 10732 [2022-07-14 04:37:07,229 INFO L226 Difference]: Without dead ends: 5891 [2022-07-14 04:37:07,237 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-14 04:37:07,238 INFO L413 NwaCegarLoop]: 2514 mSDtfsCounter, 4929 mSDsluCounter, 6932 mSDsCounter, 0 mSdLazyCounter, 37929 mSolverCounterSat, 3842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5012 SdHoareTripleChecker+Valid, 9446 SdHoareTripleChecker+Invalid, 41771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3842 IncrementalHoareTripleChecker+Valid, 37929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:07,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5012 Valid, 9446 Invalid, 41771 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3842 Valid, 37929 Invalid, 0 Unknown, 0 Unchecked, 28.7s Time] [2022-07-14 04:37:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5891 states. [2022-07-14 04:37:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5891 to 4910. [2022-07-14 04:37:07,472 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-14 04:37:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 6589 transitions. [2022-07-14 04:37:07,486 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 6589 transitions. Word has length 167 [2022-07-14 04:37:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:07,486 INFO L495 AbstractCegarLoop]: Abstraction has 4910 states and 6589 transitions. [2022-07-14 04:37:07,486 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-14 04:37:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 6589 transitions. [2022-07-14 04:37:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-14 04:37:07,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:07,488 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-14 04:37:07,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:37:07,488 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-14 04:37:07,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1162726059, now seen corresponding path program 1 times [2022-07-14 04:37:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:07,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001650555] [2022-07-14 04:37:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:37:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:37:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:37:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:37:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:37:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:37:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:37:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:37:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:37:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:37:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:37:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:37:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:37:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:37:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:37:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:37:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:37:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:37:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:07,683 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-14 04:37:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:07,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001650555] [2022-07-14 04:37:07,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001650555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:37:07,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:37:07,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:37:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878695392] [2022-07-14 04:37:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:37:07,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:37:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:37:07,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:37:07,685 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-14 04:37:10,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:37:14,548 INFO L93 Difference]: Finished difference Result 4910 states and 6589 transitions. [2022-07-14 04:37:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:37:14,549 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-14 04:37:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:37:14,560 INFO L225 Difference]: With dead ends: 4910 [2022-07-14 04:37:14,560 INFO L226 Difference]: Without dead ends: 4908 [2022-07-14 04:37:14,561 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-14 04:37:14,562 INFO L413 NwaCegarLoop]: 2206 mSDtfsCounter, 4622 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s 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.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:37:14,562 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.5s Time] [2022-07-14 04:37:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2022-07-14 04:37:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 4908. [2022-07-14 04:37:14,788 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-14 04:37:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 6587 transitions. [2022-07-14 04:37:14,798 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 6587 transitions. Word has length 144 [2022-07-14 04:37:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:37:14,799 INFO L495 AbstractCegarLoop]: Abstraction has 4908 states and 6587 transitions. [2022-07-14 04:37:14,799 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-14 04:37:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 6587 transitions. [2022-07-14 04:37:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-14 04:37:14,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:37:14,800 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-14 04:37:14,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 04:37:14,801 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-14 04:37:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:37:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash 88155449, now seen corresponding path program 1 times [2022-07-14 04:37:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:37:14,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359818971] [2022-07-14 04:37:14,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:37:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:37:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:37:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:37:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:37:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:37:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:37:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:37:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:37:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:37:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:37:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:37:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:37:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:37:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:37:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:37:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:37:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:37:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:37:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-14 04:37:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-14 04:37:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:37:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:37:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:37:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:37:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:37:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-14 04:37:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:15,258 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-14 04:37:15,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:37:15,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359818971] [2022-07-14 04:37:15,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359818971] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:37:15,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113126541] [2022-07-14 04:37:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:37:15,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:37:15,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:37:15,260 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-14 04:37:15,261 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-14 04:37:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:37:16,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 2222 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 04:37:16,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:37:16,480 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-14 04:37:16,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 04:37:16,835 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-14 04:37:16,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113126541] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 04:37:16,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 04:37:16,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 18 [2022-07-14 04:37:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688181931] [2022-07-14 04:37:16,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 04:37:16,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 04:37:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:37:16,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 04:37:16,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-14 04:37:16,837 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-14 04:37:18,854 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-14 04:37:20,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:37:21,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []