./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 35987657 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-?-3598765 [2022-07-21 15:25:00,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:25:00,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:25:00,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:25:00,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:25:00,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:25:00,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:25:00,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:25:00,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:25:00,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:25:00,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:25:00,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:25:00,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:25:00,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:25:00,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:25:00,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:25:00,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:25:00,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:25:00,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:25:00,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:25:00,491 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:25:00,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:25:00,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:25:00,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:25:00,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:25:00,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:25:00,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:25:00,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:25:00,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:25:00,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:25:00,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:25:00,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:25:00,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:25:00,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:25:00,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:25:00,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:25:00,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:25:00,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:25:00,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:25:00,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:25:00,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:25:00,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:25:00,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:25:00,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:25:00,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:25:00,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:25:00,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:25:00,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:25:00,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:25:00,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:25:00,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:25:00,541 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:25:00,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:25:00,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:25:00,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:25:00,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:25:00,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:25:00,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:25:00,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:25:00,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:25:00,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:25:00,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:25:00,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:25:00,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:25:00,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:25:00,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:25:00,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:25:00,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:25:00,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:25:00,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:25:00,545 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:25:00,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:25:00,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:25:00,545 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-21 15:25:00,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:25:00,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:25:00,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:25:00,807 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:25:00,807 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:25:00,808 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-21 15:25:00,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae2f40a5/84fb926f77a94510937d4db2fb117c09/FLAG60ec7a463 [2022-07-21 15:25:01,557 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:25:01,558 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-21 15:25:01,609 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae2f40a5/84fb926f77a94510937d4db2fb117c09/FLAG60ec7a463 [2022-07-21 15:25:01,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae2f40a5/84fb926f77a94510937d4db2fb117c09 [2022-07-21 15:25:01,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:25:01,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:25:01,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:25:01,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:25:01,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:25:01,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:25:01" (1/1) ... [2022-07-21 15:25:01,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101f970e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:01, skipping insertion in model container [2022-07-21 15:25:01,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:25:01" (1/1) ... [2022-07-21 15:25:01,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:25:02,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:25:05,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2022-07-21 15:25:05,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480032,480045] [2022-07-21 15:25:05,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480184,480197] [2022-07-21 15:25:05,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480333,480346] [2022-07-21 15:25:05,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480481,480494] [2022-07-21 15:25:05,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480638,480651] [2022-07-21 15:25:05,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480787,480800] [2022-07-21 15:25:05,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[480943,480956] [2022-07-21 15:25:05,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481096,481109] [2022-07-21 15:25:05,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481242,481255] [2022-07-21 15:25:05,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481385,481398] [2022-07-21 15:25:05,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481537,481550] [2022-07-21 15:25:05,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481683,481696] [2022-07-21 15:25:05,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481828,481841] [2022-07-21 15:25:05,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[481982,481995] [2022-07-21 15:25:05,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482133,482146] [2022-07-21 15:25:05,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482288,482301] [2022-07-21 15:25:05,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482440,482453] [2022-07-21 15:25:05,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482595,482608] [2022-07-21 15:25:05,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482759,482772] [2022-07-21 15:25:05,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[482915,482928] [2022-07-21 15:25:05,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483079,483092] [2022-07-21 15:25:05,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483221,483234] [2022-07-21 15:25:05,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483379,483392] [2022-07-21 15:25:05,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483546,483559] [2022-07-21 15:25:05,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483705,483718] [2022-07-21 15:25:05,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[483864,483877] [2022-07-21 15:25:05,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484013,484026] [2022-07-21 15:25:05,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2022-07-21 15:25:05,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484299,484312] [2022-07-21 15:25:05,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484462,484475] [2022-07-21 15:25:05,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484628,484641] [2022-07-21 15:25:05,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484792,484805] [2022-07-21 15:25:05,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484957,484970] [2022-07-21 15:25:05,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485122,485135] [2022-07-21 15:25:05,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485288,485301] [2022-07-21 15:25:05,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2022-07-21 15:25:05,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2022-07-21 15:25:05,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2022-07-21 15:25:05,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2022-07-21 15:25:05,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2022-07-21 15:25:05,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2022-07-21 15:25:05,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2022-07-21 15:25:05,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2022-07-21 15:25:05,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2022-07-21 15:25:05,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2022-07-21 15:25:05,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2022-07-21 15:25:05,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2022-07-21 15:25:05,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2022-07-21 15:25:05,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2022-07-21 15:25:05,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2022-07-21 15:25:05,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2022-07-21 15:25:05,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2022-07-21 15:25:05,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2022-07-21 15:25:05,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2022-07-21 15:25:05,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2022-07-21 15:25:05,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2022-07-21 15:25:05,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2022-07-21 15:25:05,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2022-07-21 15:25:05,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2022-07-21 15:25:05,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2022-07-21 15:25:05,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2022-07-21 15:25:05,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2022-07-21 15:25:05,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2022-07-21 15:25:05,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2022-07-21 15:25:05,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2022-07-21 15:25:05,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2022-07-21 15:25:05,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2022-07-21 15:25:05,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2022-07-21 15:25:05,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2022-07-21 15:25:05,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2022-07-21 15:25:05,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2022-07-21 15:25:05,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2022-07-21 15:25:05,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:25:05,403 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:25:05,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[477597,477610] [2022-07-21 15:25:05,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[477742,477755] [2022-07-21 15:25:05,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[477888,477901] [2022-07-21 15:25:05,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[478053,478066] [2022-07-21 15:25:05,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[478211,478224] [2022-07-21 15:25:05,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[478369,478382] [2022-07-21 15:25:05,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[478527,478540] [2022-07-21 15:25:05,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[478687,478700] [2022-07-21 15:25:05,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[478846,478859] [2022-07-21 15:25:05,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[484160,484173] [2022-07-21 15:25:05,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-21 15:25:05,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485453,485466] [2022-07-21 15:25:05,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485620,485633] [2022-07-21 15:25:05,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485780,485793] [2022-07-21 15:25:05,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[485942,485955] [2022-07-21 15:25:05,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486101,486114] [2022-07-21 15:25:05,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486247,486260] [2022-07-21 15:25:05,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486390,486403] [2022-07-21 15:25:05,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486534,486547] [2022-07-21 15:25:05,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486677,486690] [2022-07-21 15:25:05,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486821,486834] [2022-07-21 15:25:05,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[486962,486975] [2022-07-21 15:25:05,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487100,487113] [2022-07-21 15:25:05,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487258,487271] [2022-07-21 15:25:05,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487417,487430] [2022-07-21 15:25:05,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487573,487586] [2022-07-21 15:25:05,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487722,487735] [2022-07-21 15:25:05,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[487874,487887] [2022-07-21 15:25:05,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488025,488038] [2022-07-21 15:25:05,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488174,488187] [2022-07-21 15:25:05,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488326,488339] [2022-07-21 15:25:05,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488474,488487] [2022-07-21 15:25:06,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488627,488640] [2022-07-21 15:25:06,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488778,488791] [2022-07-21 15:25:06,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[488928,488941] [2022-07-21 15:25:06,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489075,489088] [2022-07-21 15:25:06,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489226,489239] [2022-07-21 15:25:06,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489377,489390] [2022-07-21 15:25:06,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489525,489538] [2022-07-21 15:25:06,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489691,489704] [2022-07-21 15:25:06,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[489860,489873] [2022-07-21 15:25:06,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490027,490040] [2022-07-21 15:25:06,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490195,490208] [2022-07-21 15:25:06,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490345,490358] [2022-07-21 15:25:06,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490492,490505] [2022-07-21 15:25:06,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490653,490666] [2022-07-21 15:25:06,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490823,490836] [2022-07-21 15:25:06,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[490985,490998] [2022-07-21 15:25:06,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:25:06,258 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:25:06,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06 WrapperNode [2022-07-21 15:25:06,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:25:06,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:25:06,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:25:06,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:25:06,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,572 INFO L137 Inliner]: procedures = 673, calls = 2647, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6079 [2022-07-21 15:25:06,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:25:06,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:25:06,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:25:06,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:25:06,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:25:06,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:25:06,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:25:06,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:25:06,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (1/1) ... [2022-07-21 15:25:06,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:25:06,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:25:06,784 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-21 15:25:06,790 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-21 15:25:06,820 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2022-07-21 15:25:06,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2022-07-21 15:25:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2022-07-21 15:25:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2022-07-21 15:25:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2022-07-21 15:25:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2022-07-21 15:25:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-21 15:25:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-21 15:25:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:25:06,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:25:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2022-07-21 15:25:06,822 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2022-07-21 15:25:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 15:25:06,822 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 15:25:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2022-07-21 15:25:06,823 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2022-07-21 15:25:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:25:06,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:25:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2022-07-21 15:25:06,824 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2022-07-21 15:25:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:25:06,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:25:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2022-07-21 15:25:06,824 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2022-07-21 15:25:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2022-07-21 15:25:06,825 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2022-07-21 15:25:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2022-07-21 15:25:06,825 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2022-07-21 15:25:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:25:06,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:25:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-21 15:25:06,825 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-21 15:25:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 15:25:06,825 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 15:25:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:25:06,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:25:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:25:06,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:25:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:25:06,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:25:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2022-07-21 15:25:06,826 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2022-07-21 15:25:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2022-07-21 15:25:06,826 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2022-07-21 15:25:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:25:06,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:25:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:25:06,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:25:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:25:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2022-07-21 15:25:06,827 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2022-07-21 15:25:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2022-07-21 15:25:06,827 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2022-07-21 15:25:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2022-07-21 15:25:06,827 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2022-07-21 15:25:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:25:06,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:25:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 15:25:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-21 15:25:06,828 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-21 15:25:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 15:25:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:25:06,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:25:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:25:06,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:25:06,829 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-21 15:25:06,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-21 15:25:06,829 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2022-07-21 15:25:06,829 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2022-07-21 15:25:06,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:25:06,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:25:06,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:25:06,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:25:06,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:25:06,832 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-21 15:25:06,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-21 15:25:06,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-21 15:25:06,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-21 15:25:06,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 15:25:06,833 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 15:25:06,833 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2022-07-21 15:25:06,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2022-07-21 15:25:06,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:25:06,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:25:06,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-21 15:25:06,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-21 15:25:06,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 15:25:06,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 15:25:06,834 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2022-07-21 15:25:06,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2022-07-21 15:25:06,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:25:06,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:25:06,835 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-21 15:25:06,835 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-21 15:25:06,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:25:06,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:25:06,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:25:06,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:25:06,835 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2022-07-21 15:25:06,835 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2022-07-21 15:25:06,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:25:06,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:25:06,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:25:06,836 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:25:06,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:25:06,836 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-21 15:25:06,836 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-21 15:25:06,836 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-21 15:25:06,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-21 15:25:06,836 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:25:06,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:25:06,836 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-21 15:25:06,837 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-21 15:25:06,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2022-07-21 15:25:06,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2022-07-21 15:25:06,837 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2022-07-21 15:25:06,837 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2022-07-21 15:25:06,837 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2022-07-21 15:25:06,837 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2022-07-21 15:25:06,837 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-21 15:25:06,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-21 15:25:06,838 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2022-07-21 15:25:06,838 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2022-07-21 15:25:06,838 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-21 15:25:06,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-21 15:25:06,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:25:06,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:25:06,838 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-21 15:25:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-21 15:25:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-21 15:25:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-21 15:25:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2022-07-21 15:25:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2022-07-21 15:25:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2022-07-21 15:25:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2022-07-21 15:25:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:25:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:25:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2022-07-21 15:25:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2022-07-21 15:25:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-21 15:25:06,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-21 15:25:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-21 15:25:06,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-21 15:25:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 15:25:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 15:25:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:25:06,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:25:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:25:06,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:25:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2022-07-21 15:25:06,841 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2022-07-21 15:25:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2022-07-21 15:25:06,841 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2022-07-21 15:25:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-21 15:25:06,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-21 15:25:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2022-07-21 15:25:06,841 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2022-07-21 15:25:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2022-07-21 15:25:06,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2022-07-21 15:25:06,841 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-21 15:25:06,842 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-21 15:25:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:25:06,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:25:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2022-07-21 15:25:06,842 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2022-07-21 15:25:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:25:06,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:25:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2022-07-21 15:25:06,842 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2022-07-21 15:25:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:25:06,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:25:06,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:25:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:25:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2022-07-21 15:25:06,843 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2022-07-21 15:25:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2022-07-21 15:25:06,843 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2022-07-21 15:25:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:25:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 15:25:06,843 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 15:25:06,843 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-21 15:25:06,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-21 15:25:06,844 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2022-07-21 15:25:06,844 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2022-07-21 15:25:06,844 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 15:25:06,844 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 15:25:06,844 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2022-07-21 15:25:06,844 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2022-07-21 15:25:06,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:25:06,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:25:06,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:25:06,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:25:06,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-21 15:25:06,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-21 15:25:06,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 15:25:06,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 15:25:06,845 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2022-07-21 15:25:06,845 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2022-07-21 15:25:06,845 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2022-07-21 15:25:06,845 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2022-07-21 15:25:06,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-21 15:25:06,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-21 15:25:06,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:25:06,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:25:06,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:25:06,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:25:06,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:25:06,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:25:06,846 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:25:06,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:25:06,846 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-21 15:25:06,846 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-21 15:25:06,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2022-07-21 15:25:06,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2022-07-21 15:25:06,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:25:06,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:25:06,847 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:25:06,847 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:25:06,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:25:06,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:25:06,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2022-07-21 15:25:06,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2022-07-21 15:25:06,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:25:06,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:25:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:25:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2022-07-21 15:25:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2022-07-21 15:25:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:25:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:25:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:25:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:25:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-21 15:25:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-21 15:25:06,848 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-21 15:25:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-21 15:25:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2022-07-21 15:25:06,849 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2022-07-21 15:25:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2022-07-21 15:25:06,849 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2022-07-21 15:25:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2022-07-21 15:25:06,849 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2022-07-21 15:25:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:25:06,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:25:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:25:06,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:25:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-21 15:25:06,850 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-21 15:25:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2022-07-21 15:25:06,850 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2022-07-21 15:25:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2022-07-21 15:25:06,850 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2022-07-21 15:25:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 15:25:06,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 15:25:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-21 15:25:06,850 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-21 15:25:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:25:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-21 15:25:06,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-21 15:25:06,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-21 15:25:06,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-21 15:25:06,851 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2022-07-21 15:25:06,851 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2022-07-21 15:25:07,614 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:25:07,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:25:08,041 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:25:11,938 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:25:11,956 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:25:11,956 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 15:25:11,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:25:11 BoogieIcfgContainer [2022-07-21 15:25:11,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:25:11,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:25:11,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:25:11,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:25:11,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:25:01" (1/3) ... [2022-07-21 15:25:11,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c96dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:25:11, skipping insertion in model container [2022-07-21 15:25:11,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:25:06" (2/3) ... [2022-07-21 15:25:11,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c96dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:25:11, skipping insertion in model container [2022-07-21 15:25:11,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:25:11" (3/3) ... [2022-07-21 15:25:11,965 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2022-07-21 15:25:11,974 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:25:11,975 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-21 15:25:12,027 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:25:12,031 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@4c59001d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36714dc6 [2022-07-21 15:25:12,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-21 15:25:12,038 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-21 15:25:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 15:25:12,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:25:12,046 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-21 15:25:12,046 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-21 15:25:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:25:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1268169960, now seen corresponding path program 1 times [2022-07-21 15:25:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:25:12,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409376591] [2022-07-21 15:25:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:25:12,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:25:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:25:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:25:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:25:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:25:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:25:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:25:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:25:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:25:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:25:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:12,700 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-21 15:25:12,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:25:12,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409376591] [2022-07-21 15:25:12,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409376591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:25:12,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:25:12,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:25:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384031988] [2022-07-21 15:25:12,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:25:12,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:25:12,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:25:12,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:25:12,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:25:12,733 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-21 15:25:14,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:25:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:25:22,778 INFO L93 Difference]: Finished difference Result 5888 states and 8392 transitions. [2022-07-21 15:25:22,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:25:22,781 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-21 15:25:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:25:22,811 INFO L225 Difference]: With dead ends: 5888 [2022-07-21 15:25:22,811 INFO L226 Difference]: Without dead ends: 3905 [2022-07-21 15:25:22,823 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-21 15:25:22,825 INFO L413 NwaCegarLoop]: 2424 mSDtfsCounter, 7686 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 6436 mSolverCounterSat, 4231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7771 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 10667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4231 IncrementalHoareTripleChecker+Valid, 6436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:25:22,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7771 Valid, 3395 Invalid, 10667 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4231 Valid, 6436 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-07-21 15:25:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2022-07-21 15:25:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3713. [2022-07-21 15:25:23,033 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-21 15:25:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 5065 transitions. [2022-07-21 15:25:23,059 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 5065 transitions. Word has length 64 [2022-07-21 15:25:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:25:23,060 INFO L495 AbstractCegarLoop]: Abstraction has 3713 states and 5065 transitions. [2022-07-21 15:25:23,060 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-21 15:25:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 5065 transitions. [2022-07-21 15:25:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-21 15:25:23,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:25:23,069 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-21 15:25:23,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:25:23,070 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-21 15:25:23,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:25:23,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1435080531, now seen corresponding path program 1 times [2022-07-21 15:25:23,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:25:23,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063554543] [2022-07-21 15:25:23,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:25:23,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:25:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:25:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:25:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:25:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:25:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:25:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:25:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:25:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:25:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:25:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:25:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:23,376 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-21 15:25:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:25:23,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063554543] [2022-07-21 15:25:23,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063554543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:25:23,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:25:23,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:25:23,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109044614] [2022-07-21 15:25:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:25:23,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:25:23,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:25:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:25:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:25:23,379 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-21 15:25:25,396 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-21 15:25:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:25:30,600 INFO L93 Difference]: Finished difference Result 3713 states and 5065 transitions. [2022-07-21 15:25:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:25:30,601 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-21 15:25:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:25:30,620 INFO L225 Difference]: With dead ends: 3713 [2022-07-21 15:25:30,620 INFO L226 Difference]: Without dead ends: 3711 [2022-07-21 15:25:30,624 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-21 15:25:30,624 INFO L413 NwaCegarLoop]: 2247 mSDtfsCounter, 4725 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2939 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4814 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 5436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2939 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:25:30,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4814 Valid, 2878 Invalid, 5436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2939 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-07-21 15:25:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2022-07-21 15:25:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2022-07-21 15:25:30,732 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-21 15:25:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 5063 transitions. [2022-07-21 15:25:30,749 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 5063 transitions. Word has length 70 [2022-07-21 15:25:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:25:30,751 INFO L495 AbstractCegarLoop]: Abstraction has 3711 states and 5063 transitions. [2022-07-21 15:25:30,752 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-21 15:25:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 5063 transitions. [2022-07-21 15:25:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 15:25:30,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:25:30,754 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-21 15:25:30,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:25:30,755 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-21 15:25:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:25:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1860087943, now seen corresponding path program 1 times [2022-07-21 15:25:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:25:30,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891957451] [2022-07-21 15:25:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:25:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:25:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:25:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:25:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:25:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:25:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:25:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:25:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:25:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:25:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:25:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:25:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:25:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:31,125 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-21 15:25:31,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:25:31,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891957451] [2022-07-21 15:25:31,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891957451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:25:31,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:25:31,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:25:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172193773] [2022-07-21 15:25:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:25:31,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:25:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:25:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:25:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:25:31,127 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-21 15:25:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:25:35,709 INFO L93 Difference]: Finished difference Result 3711 states and 5063 transitions. [2022-07-21 15:25:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:25:35,709 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-21 15:25:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:25:35,726 INFO L225 Difference]: With dead ends: 3711 [2022-07-21 15:25:35,726 INFO L226 Difference]: Without dead ends: 3709 [2022-07-21 15:25:35,730 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-21 15:25:35,731 INFO L413 NwaCegarLoop]: 2245 mSDtfsCounter, 4719 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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, 4.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:25:35,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4807 Valid, 2876 Invalid, 5434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-21 15:25:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2022-07-21 15:25:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3709. [2022-07-21 15:25:35,827 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-21 15:25:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5061 transitions. [2022-07-21 15:25:35,838 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5061 transitions. Word has length 76 [2022-07-21 15:25:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:25:35,838 INFO L495 AbstractCegarLoop]: Abstraction has 3709 states and 5061 transitions. [2022-07-21 15:25:35,839 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-21 15:25:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5061 transitions. [2022-07-21 15:25:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-21 15:25:35,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:25:35,841 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-21 15:25:35,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:25:35,841 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-21 15:25:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:25:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1019236422, now seen corresponding path program 1 times [2022-07-21 15:25:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:25:35,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590769890] [2022-07-21 15:25:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:25:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:25:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:25:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:35,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:25:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:35,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:25:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:35,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:25:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:25:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:25:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:36,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:25:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:36,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:25:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:36,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:25:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:25:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:36,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:25:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:36,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:25:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:36,078 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-21 15:25:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:25:36,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590769890] [2022-07-21 15:25:36,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590769890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:25:36,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:25:36,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:25:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544017175] [2022-07-21 15:25:36,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:25:36,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:25:36,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:25:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:25:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:25:36,082 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-21 15:25:38,619 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-21 15:25:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:25:42,471 INFO L93 Difference]: Finished difference Result 3709 states and 5061 transitions. [2022-07-21 15:25:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:25:42,472 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-21 15:25:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:25:42,488 INFO L225 Difference]: With dead ends: 3709 [2022-07-21 15:25:42,488 INFO L226 Difference]: Without dead ends: 3707 [2022-07-21 15:25:42,491 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-21 15:25:42,491 INFO L413 NwaCegarLoop]: 2243 mSDtfsCounter, 4713 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2935 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4800 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 5432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2935 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:25:42,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4800 Valid, 2874 Invalid, 5432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2935 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 15:25:42,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-07-21 15:25:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2022-07-21 15:25:42,592 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-21 15:25:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 5059 transitions. [2022-07-21 15:25:42,604 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 5059 transitions. Word has length 82 [2022-07-21 15:25:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:25:42,604 INFO L495 AbstractCegarLoop]: Abstraction has 3707 states and 5059 transitions. [2022-07-21 15:25:42,604 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-21 15:25:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 5059 transitions. [2022-07-21 15:25:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-21 15:25:42,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:25:42,605 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-21 15:25:42,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:25:42,605 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-21 15:25:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:25:42,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1523732060, now seen corresponding path program 1 times [2022-07-21 15:25:42,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:25:42,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341478167] [2022-07-21 15:25:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:25:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:25:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:25:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:25:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:25:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:25:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:25:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:25:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:25:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:25:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:25:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:25:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:25:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:25:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:25:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:42,876 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-21 15:25:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:25:42,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341478167] [2022-07-21 15:25:42,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341478167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:25:42,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:25:42,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:25:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117825904] [2022-07-21 15:25:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:25:42,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:25:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:25:42,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:25:42,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:25:42,878 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-21 15:25:43,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:25:45,389 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-21 15:25:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:25:49,149 INFO L93 Difference]: Finished difference Result 3707 states and 5059 transitions. [2022-07-21 15:25:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:25:49,150 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-21 15:25:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:25:49,161 INFO L225 Difference]: With dead ends: 3707 [2022-07-21 15:25:49,162 INFO L226 Difference]: Without dead ends: 3705 [2022-07-21 15:25:49,163 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-21 15:25:49,163 INFO L413 NwaCegarLoop]: 2241 mSDtfsCounter, 4707 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 2872 SdHoareTripleChecker+Invalid, 5430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:25:49,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 2872 Invalid, 5430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-21 15:25:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2022-07-21 15:25:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3705. [2022-07-21 15:25:49,262 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-21 15:25:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5057 transitions. [2022-07-21 15:25:49,274 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5057 transitions. Word has length 88 [2022-07-21 15:25:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:25:49,275 INFO L495 AbstractCegarLoop]: Abstraction has 3705 states and 5057 transitions. [2022-07-21 15:25:49,276 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-21 15:25:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5057 transitions. [2022-07-21 15:25:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-21 15:25:49,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:25:49,277 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-21 15:25:49,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:25:49,277 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-21 15:25:49,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:25:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1546673947, now seen corresponding path program 1 times [2022-07-21 15:25:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:25:49,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526200458] [2022-07-21 15:25:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:25:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:25:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:25:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:25:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:25:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:25:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:25:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:25:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:25:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:25:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:25:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:25:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:25:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:25:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:25:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:25:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:50,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:25:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:50,012 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-21 15:25:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:25:50,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526200458] [2022-07-21 15:25:50,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526200458] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:25:50,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367971371] [2022-07-21 15:25:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:25:50,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:25:50,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:25:50,015 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-21 15:25:50,016 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-21 15:25:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:25:50,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 15:25:50,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:25:50,871 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-21 15:25:50,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:25:51,079 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-21 15:25:51,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367971371] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:25:51,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:25:51,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 23 [2022-07-21 15:25:51,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393753470] [2022-07-21 15:25:51,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:25:51,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 15:25:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:25:51,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 15:25:51,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2022-07-21 15:25:51,082 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-21 15:25:52,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:25:55,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:26:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:26:23,176 INFO L93 Difference]: Finished difference Result 4846 states and 6526 transitions. [2022-07-21 15:26:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 15:26:23,200 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-21 15:26:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:26:23,216 INFO L225 Difference]: With dead ends: 4846 [2022-07-21 15:26:23,216 INFO L226 Difference]: Without dead ends: 3911 [2022-07-21 15:26:23,219 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-21 15:26:23,221 INFO L413 NwaCegarLoop]: 2264 mSDtfsCounter, 3760 mSDsluCounter, 5047 mSDsCounter, 0 mSdLazyCounter, 43215 mSolverCounterSat, 2761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3779 SdHoareTripleChecker+Valid, 7311 SdHoareTripleChecker+Invalid, 45976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2761 IncrementalHoareTripleChecker+Valid, 43215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:26:23,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3779 Valid, 7311 Invalid, 45976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2761 Valid, 43215 Invalid, 0 Unknown, 0 Unchecked, 31.2s Time] [2022-07-21 15:26:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2022-07-21 15:26:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3742. [2022-07-21 15:26:23,334 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-21 15:26:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 5109 transitions. [2022-07-21 15:26:23,345 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 5109 transitions. Word has length 99 [2022-07-21 15:26:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:26:23,346 INFO L495 AbstractCegarLoop]: Abstraction has 3742 states and 5109 transitions. [2022-07-21 15:26:23,346 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-21 15:26:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 5109 transitions. [2022-07-21 15:26:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 15:26:23,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:26:23,347 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-21 15:26:23,372 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-21 15:26:23,560 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-21 15:26:23,561 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-21 15:26:23,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:26:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1428851801, now seen corresponding path program 1 times [2022-07-21 15:26:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:26:23,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338939543] [2022-07-21 15:26:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:26:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:26:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:26:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:26:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:26:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:26:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:26:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:26:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:26:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:26:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:26:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:26:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:26:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:26:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:26:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:23,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-21 15:26:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:26:23,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338939543] [2022-07-21 15:26:23,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338939543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:26:23,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:26:23,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:26:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657616132] [2022-07-21 15:26:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:26:23,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:26:23,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:26:23,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:26:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:26:23,787 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-21 15:26:25,804 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-21 15:26:27,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:26:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:26:31,941 INFO L93 Difference]: Finished difference Result 3742 states and 5109 transitions. [2022-07-21 15:26:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:26:31,941 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-21 15:26:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:26:31,956 INFO L225 Difference]: With dead ends: 3742 [2022-07-21 15:26:31,956 INFO L226 Difference]: Without dead ends: 3740 [2022-07-21 15:26:31,958 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-21 15:26:31,959 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 4701 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:26:31,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 2870 Invalid, 5428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2931 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2022-07-21 15:26:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2022-07-21 15:26:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2022-07-21 15:26:32,063 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-21 15:26:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5107 transitions. [2022-07-21 15:26:32,073 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5107 transitions. Word has length 94 [2022-07-21 15:26:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:26:32,073 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 5107 transitions. [2022-07-21 15:26:32,073 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-21 15:26:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5107 transitions. [2022-07-21 15:26:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 15:26:32,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:26:32,074 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-21 15:26:32,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:26:32,075 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-21 15:26:32,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:26:32,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1577371483, now seen corresponding path program 1 times [2022-07-21 15:26:32,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:26:32,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283218563] [2022-07-21 15:26:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:26:32,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:26:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:26:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:26:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:26:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:26:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:26:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:26:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:26:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:26:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:26:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:26:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:26:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:26:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:26:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:26:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:26:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:26:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:32,397 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-21 15:26:32,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:26:32,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283218563] [2022-07-21 15:26:32,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283218563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:26:32,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:26:32,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 15:26:32,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946967309] [2022-07-21 15:26:32,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:26:32,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 15:26:32,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:26:32,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 15:26:32,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 15:26:32,399 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-21 15:26:33,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:26:35,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:26:36,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:26:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:26:41,103 INFO L93 Difference]: Finished difference Result 7670 states and 10549 transitions. [2022-07-21 15:26:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:26:41,104 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-21 15:26:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:26:41,121 INFO L225 Difference]: With dead ends: 7670 [2022-07-21 15:26:41,121 INFO L226 Difference]: Without dead ends: 3965 [2022-07-21 15:26:41,132 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-21 15:26:41,133 INFO L413 NwaCegarLoop]: 2074 mSDtfsCounter, 6102 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 3966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6200 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 6280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3966 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:26:41,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6200 Valid, 2582 Invalid, 6280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3966 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-07-21 15:26:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-07-21 15:26:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3741. [2022-07-21 15:26:41,259 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-21 15:26:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5114 transitions. [2022-07-21 15:26:41,270 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5114 transitions. Word has length 115 [2022-07-21 15:26:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:26:41,270 INFO L495 AbstractCegarLoop]: Abstraction has 3741 states and 5114 transitions. [2022-07-21 15:26:41,271 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-21 15:26:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5114 transitions. [2022-07-21 15:26:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 15:26:41,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:26:41,272 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-21 15:26:41,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:26:41,272 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-21 15:26:41,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:26:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash -250727530, now seen corresponding path program 1 times [2022-07-21 15:26:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:26:41,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946205996] [2022-07-21 15:26:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:26:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:26:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:26:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:26:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:26:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:26:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:26:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:26:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:26:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:26:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:26:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:26:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:26:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:26:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:26:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:26:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:41,489 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-21 15:26:41,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:26:41,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946205996] [2022-07-21 15:26:41,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946205996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:26:41,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:26:41,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:26:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413195500] [2022-07-21 15:26:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:26:41,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:26:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:26:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:26:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:26:41,492 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-21 15:26:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:26:46,664 INFO L93 Difference]: Finished difference Result 3741 states and 5114 transitions. [2022-07-21 15:26:46,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:26:46,665 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-21 15:26:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:26:46,679 INFO L225 Difference]: With dead ends: 3741 [2022-07-21 15:26:46,679 INFO L226 Difference]: Without dead ends: 3739 [2022-07-21 15:26:46,682 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-21 15:26:46,683 INFO L413 NwaCegarLoop]: 2232 mSDtfsCounter, 4690 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 2929 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:26:46,683 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.9s Time] [2022-07-21 15:26:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2022-07-21 15:26:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2022-07-21 15:26:46,819 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-21 15:26:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5112 transitions. [2022-07-21 15:26:46,832 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5112 transitions. Word has length 100 [2022-07-21 15:26:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:26:46,832 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5112 transitions. [2022-07-21 15:26:46,832 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-21 15:26:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5112 transitions. [2022-07-21 15:26:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-21 15:26:46,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:26:46,834 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-21 15:26:46,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:26:46,834 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-21 15:26:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:26:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1733111734, now seen corresponding path program 1 times [2022-07-21 15:26:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:26:46,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810209946] [2022-07-21 15:26:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:26:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:26:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:26:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:26:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:26:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:26:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:26:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:26:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:26:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:26:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:26:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:26:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:26:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:26:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:26:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:26:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:26:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:26:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:26:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,081 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-21 15:26:47,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:26:47,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810209946] [2022-07-21 15:26:47,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810209946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:26:47,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272378168] [2022-07-21 15:26:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:26:47,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:26:47,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:26:47,096 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-21 15:26:47,097 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-21 15:26:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:47,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 15:26:47,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:26:47,827 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-21 15:26:47,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:26:47,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272378168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:26:47,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:26:47,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-21 15:26:47,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488293163] [2022-07-21 15:26:47,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:26:47,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:26:47,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:26:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:26:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:26:47,829 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-21 15:26:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:26:47,984 INFO L93 Difference]: Finished difference Result 7437 states and 10168 transitions. [2022-07-21 15:26:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:26:47,984 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-21 15:26:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:26:47,998 INFO L225 Difference]: With dead ends: 7437 [2022-07-21 15:26:47,998 INFO L226 Difference]: Without dead ends: 3733 [2022-07-21 15:26:48,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:26:48,009 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-21 15:26:48,010 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-21 15:26:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2022-07-21 15:26:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3733. [2022-07-21 15:26:48,156 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-21 15:26:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5103 transitions. [2022-07-21 15:26:48,167 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5103 transitions. Word has length 121 [2022-07-21 15:26:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:26:48,167 INFO L495 AbstractCegarLoop]: Abstraction has 3733 states and 5103 transitions. [2022-07-21 15:26:48,168 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-21 15:26:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5103 transitions. [2022-07-21 15:26:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-21 15:26:48,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:26:48,169 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-21 15:26:48,196 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-21 15:26:48,383 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-21 15:26:48,384 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-21 15:26:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:26:48,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1292108662, now seen corresponding path program 1 times [2022-07-21 15:26:48,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:26:48,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142015855] [2022-07-21 15:26:48,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:26:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:26:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:26:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:26:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:26:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:26:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:26:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:26:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:26:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:26:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:26:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:26:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:26:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:26:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:26:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:26:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:26:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:26:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:26:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:26:48,634 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-21 15:26:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:26:48,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142015855] [2022-07-21 15:26:48,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142015855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:26:48,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:26:48,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:26:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033962810] [2022-07-21 15:26:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:26:48,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:26:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:26:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:26:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:26:48,636 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-21 15:26:50,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:26:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:26:59,876 INFO L93 Difference]: Finished difference Result 7594 states and 10483 transitions. [2022-07-21 15:26:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:26:59,877 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-21 15:26:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:26:59,890 INFO L225 Difference]: With dead ends: 7594 [2022-07-21 15:26:59,890 INFO L226 Difference]: Without dead ends: 3896 [2022-07-21 15:26:59,902 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-21 15:26:59,905 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 3706 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 9139 mSolverCounterSat, 2435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3706 SdHoareTripleChecker+Valid, 3542 SdHoareTripleChecker+Invalid, 11574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2435 IncrementalHoareTripleChecker+Valid, 9139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:26:59,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3706 Valid, 3542 Invalid, 11574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2435 Valid, 9139 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2022-07-21 15:26:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2022-07-21 15:27:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3739. [2022-07-21 15:27:00,039 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-21 15:27:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5109 transitions. [2022-07-21 15:27:00,051 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5109 transitions. Word has length 125 [2022-07-21 15:27:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:27:00,051 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5109 transitions. [2022-07-21 15:27:00,051 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-21 15:27:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5109 transitions. [2022-07-21 15:27:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 15:27:00,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:27:00,053 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-21 15:27:00,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:27:00,053 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-21 15:27:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:27:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash 562293705, now seen corresponding path program 1 times [2022-07-21 15:27:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:27:00,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329746960] [2022-07-21 15:27:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:27:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:27:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:27:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:27:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:27:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:27:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:27:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:27:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:27:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:27:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:27:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:27:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:27:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:27:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:27:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:27:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:27:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:00,227 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-21 15:27:00,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:27:00,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329746960] [2022-07-21 15:27:00,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329746960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:27:00,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:27:00,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:27:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602190418] [2022-07-21 15:27:00,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:27:00,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:27:00,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:27:00,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:27:00,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:27:00,229 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-21 15:27:02,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:27:03,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:27:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:27:07,888 INFO L93 Difference]: Finished difference Result 3739 states and 5109 transitions. [2022-07-21 15:27:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:27:07,889 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-21 15:27:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:27:07,900 INFO L225 Difference]: With dead ends: 3739 [2022-07-21 15:27:07,900 INFO L226 Difference]: Without dead ends: 3737 [2022-07-21 15:27:07,902 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-21 15:27:07,902 INFO L413 NwaCegarLoop]: 2225 mSDtfsCounter, 4683 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4766 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 5418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:27:07,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4766 Valid, 2828 Invalid, 5418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2921 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-07-21 15:27:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2022-07-21 15:27:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3737. [2022-07-21 15:27:08,037 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-21 15:27:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 5107 transitions. [2022-07-21 15:27:08,048 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 5107 transitions. Word has length 106 [2022-07-21 15:27:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:27:08,048 INFO L495 AbstractCegarLoop]: Abstraction has 3737 states and 5107 transitions. [2022-07-21 15:27:08,048 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-21 15:27:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 5107 transitions. [2022-07-21 15:27:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-21 15:27:08,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:27:08,050 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-21 15:27:08,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:27:08,050 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-21 15:27:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:27:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1412084910, now seen corresponding path program 1 times [2022-07-21 15:27:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:27:08,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872671265] [2022-07-21 15:27:08,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:27:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:27:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:27:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:27:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:27:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:27:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:27:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:27:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:27:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:27:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:27:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:27:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:27:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:27:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:27:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:27:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:27:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:27:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:08,315 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-21 15:27:08,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:27:08,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872671265] [2022-07-21 15:27:08,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872671265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:27:08,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:27:08,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:27:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255894212] [2022-07-21 15:27:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:27:08,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:27:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:27:08,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:27:08,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:27:08,318 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-21 15:27:10,333 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-21 15:27:13,630 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-21 15:27:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:27:23,858 INFO L93 Difference]: Finished difference Result 8857 states and 12124 transitions. [2022-07-21 15:27:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 15:27:23,858 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-21 15:27:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:27:23,876 INFO L225 Difference]: With dead ends: 8857 [2022-07-21 15:27:23,876 INFO L226 Difference]: Without dead ends: 5155 [2022-07-21 15:27:23,889 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-21 15:27:23,890 INFO L413 NwaCegarLoop]: 2233 mSDtfsCounter, 6825 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 10543 mSolverCounterSat, 4009 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6916 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 14554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4009 IncrementalHoareTripleChecker+Valid, 10543 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:27:23,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6916 Valid, 3435 Invalid, 14554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4009 Valid, 10543 Invalid, 2 Unknown, 0 Unchecked, 15.1s Time] [2022-07-21 15:27:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2022-07-21 15:27:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 4892. [2022-07-21 15:27:24,080 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-21 15:27:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 6570 transitions. [2022-07-21 15:27:24,095 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 6570 transitions. Word has length 128 [2022-07-21 15:27:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:27:24,095 INFO L495 AbstractCegarLoop]: Abstraction has 4892 states and 6570 transitions. [2022-07-21 15:27:24,096 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-21 15:27:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 6570 transitions. [2022-07-21 15:27:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-21 15:27:24,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:27:24,097 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-21 15:27:24,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:27:24,097 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-21 15:27:24,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:27:24,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1412144492, now seen corresponding path program 1 times [2022-07-21 15:27:24,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:27:24,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915919034] [2022-07-21 15:27:24,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:27:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:27:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:27:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:27:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:27:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:27:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:27:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:27:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:27:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:27:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:27:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:27:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:27:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:27:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:27:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:27:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:27:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:27:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:24,304 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-21 15:27:24,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:27:24,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915919034] [2022-07-21 15:27:24,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915919034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:27:24,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:27:24,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 15:27:24,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511564178] [2022-07-21 15:27:24,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:27:24,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 15:27:24,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:27:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 15:27:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 15:27:24,307 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-21 15:27:25,345 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-21 15:27:26,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:27:27,963 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-21 15:27:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:27:34,886 INFO L93 Difference]: Finished difference Result 5165 states and 6992 transitions. [2022-07-21 15:27:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:27:34,886 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-21 15:27:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:27:34,911 INFO L225 Difference]: With dead ends: 5165 [2022-07-21 15:27:34,911 INFO L226 Difference]: Without dead ends: 5163 [2022-07-21 15:27:34,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-21 15:27:34,915 INFO L413 NwaCegarLoop]: 2235 mSDtfsCounter, 3748 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 6706 mSolverCounterSat, 2443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.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, 6706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:27:34,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3748 Valid, 3269 Invalid, 9149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2443 Valid, 6706 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-07-21 15:27:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2022-07-21 15:27:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4896. [2022-07-21 15:27:35,103 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-21 15:27:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 6572 transitions. [2022-07-21 15:27:35,115 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 6572 transitions. Word has length 128 [2022-07-21 15:27:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:27:35,116 INFO L495 AbstractCegarLoop]: Abstraction has 4896 states and 6572 transitions. [2022-07-21 15:27:35,116 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-21 15:27:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 6572 transitions. [2022-07-21 15:27:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 15:27:35,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:27:35,118 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-21 15:27:35,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:27:35,118 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-21 15:27:35,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:27:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash -801451636, now seen corresponding path program 1 times [2022-07-21 15:27:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:27:35,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843378356] [2022-07-21 15:27:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:27:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:27:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:27:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:27:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:27:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:27:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:27:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:27:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:27:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:27:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:27:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:27:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:27:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:27:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:27:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:27:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:27:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:35,295 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-21 15:27:35,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:27:35,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843378356] [2022-07-21 15:27:35,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843378356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:27:35,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:27:35,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:27:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798888097] [2022-07-21 15:27:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:27:35,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:27:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:27:35,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:27:35,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:27:35,298 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-21 15:27:36,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:27:38,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:27:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:27:43,527 INFO L93 Difference]: Finished difference Result 4896 states and 6572 transitions. [2022-07-21 15:27:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:27:43,527 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-21 15:27:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:27:43,539 INFO L225 Difference]: With dead ends: 4896 [2022-07-21 15:27:43,539 INFO L226 Difference]: Without dead ends: 4894 [2022-07-21 15:27:43,541 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-21 15:27:43,542 INFO L413 NwaCegarLoop]: 2223 mSDtfsCounter, 4671 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 5420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:27:43,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 2826 Invalid, 5420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2924 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-21 15:27:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2022-07-21 15:27:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4894. [2022-07-21 15:27:43,727 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-21 15:27:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 6570 transitions. [2022-07-21 15:27:43,740 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 6570 transitions. Word has length 108 [2022-07-21 15:27:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:27:43,741 INFO L495 AbstractCegarLoop]: Abstraction has 4894 states and 6570 transitions. [2022-07-21 15:27:43,741 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-21 15:27:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 6570 transitions. [2022-07-21 15:27:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-21 15:27:43,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:27:43,742 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-21 15:27:43,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:27:43,743 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-21 15:27:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:27:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -82159438, now seen corresponding path program 1 times [2022-07-21 15:27:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:27:43,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528394425] [2022-07-21 15:27:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:27:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:27:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:27:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:27:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:27:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:27:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:27:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:27:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:27:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:27:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:27:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:27:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:27:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:27:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:27:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:27:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:27:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:27:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:43,977 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-21 15:27:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:27:43,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528394425] [2022-07-21 15:27:43,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528394425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:27:43,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:27:43,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:27:43,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897345357] [2022-07-21 15:27:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:27:43,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:27:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:27:43,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:27:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:27:43,979 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-21 15:27:45,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:27:47,296 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-21 15:27:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:27:51,883 INFO L93 Difference]: Finished difference Result 9992 states and 13573 transitions. [2022-07-21 15:27:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:27:51,883 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-21 15:27:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:27:51,897 INFO L225 Difference]: With dead ends: 9992 [2022-07-21 15:27:51,897 INFO L226 Difference]: Without dead ends: 5133 [2022-07-21 15:27:51,910 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-21 15:27:51,911 INFO L413 NwaCegarLoop]: 2243 mSDtfsCounter, 5371 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 3239 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5464 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 5197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3239 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:27:51,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5464 Valid, 2739 Invalid, 5197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3239 Valid, 1957 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-07-21 15:27:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2022-07-21 15:27:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 4884. [2022-07-21 15:27:52,096 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-21 15:27:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 6553 transitions. [2022-07-21 15:27:52,108 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 6553 transitions. Word has length 132 [2022-07-21 15:27:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:27:52,109 INFO L495 AbstractCegarLoop]: Abstraction has 4884 states and 6553 transitions. [2022-07-21 15:27:52,109 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-21 15:27:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 6553 transitions. [2022-07-21 15:27:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-21 15:27:52,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:27:52,111 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-21 15:27:52,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:27:52,111 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-21 15:27:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:27:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash -199200027, now seen corresponding path program 1 times [2022-07-21 15:27:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:27:52,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384068970] [2022-07-21 15:27:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:27:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:27:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:27:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:27:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:27:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:27:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:27:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:27:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:27:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:27:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:27:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:27:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:27:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:27:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:27:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:27:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:27:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:27:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:52,277 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-21 15:27:52,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:27:52,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384068970] [2022-07-21 15:27:52,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384068970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:27:52,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:27:52,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:27:52,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752961686] [2022-07-21 15:27:52,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:27:52,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:27:52,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:27:52,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:27:52,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:27:52,280 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-21 15:27:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:27:57,735 INFO L93 Difference]: Finished difference Result 4884 states and 6553 transitions. [2022-07-21 15:27:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:27:57,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-21 15:27:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:27:57,744 INFO L225 Difference]: With dead ends: 4884 [2022-07-21 15:27:57,744 INFO L226 Difference]: Without dead ends: 4882 [2022-07-21 15:27:57,745 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-21 15:27:57,745 INFO L413 NwaCegarLoop]: 2216 mSDtfsCounter, 4652 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s 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, 5.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:27:57,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 2819 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2917 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-21 15:27:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2022-07-21 15:27:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4882. [2022-07-21 15:27:57,926 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-21 15:27:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 6551 transitions. [2022-07-21 15:27:57,937 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 6551 transitions. Word has length 114 [2022-07-21 15:27:57,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:27:57,938 INFO L495 AbstractCegarLoop]: Abstraction has 4882 states and 6551 transitions. [2022-07-21 15:27:57,938 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-21 15:27:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 6551 transitions. [2022-07-21 15:27:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-21 15:27:57,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:27:57,939 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-21 15:27:57,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:27:57,939 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-21 15:27:57,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:27:57,940 INFO L85 PathProgramCache]: Analyzing trace with hash 755987782, now seen corresponding path program 1 times [2022-07-21 15:27:57,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:27:57,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985286808] [2022-07-21 15:27:57,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:27:57,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:27:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:27:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:27:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:27:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:27:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:27:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:27:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:27:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:27:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:27:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:27:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:27:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:27:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:27:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:27:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:27:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:27:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:27:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:27:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:27:58,117 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-21 15:27:58,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:27:58,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985286808] [2022-07-21 15:27:58,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985286808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:27:58,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:27:58,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:27:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139917824] [2022-07-21 15:27:58,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:27:58,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:27:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:27:58,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:27:58,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:27:58,119 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-21 15:28:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:28:03,103 INFO L93 Difference]: Finished difference Result 4882 states and 6551 transitions. [2022-07-21 15:28:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:28:03,104 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-21 15:28:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:28:03,113 INFO L225 Difference]: With dead ends: 4882 [2022-07-21 15:28:03,113 INFO L226 Difference]: Without dead ends: 4880 [2022-07-21 15:28:03,114 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-21 15:28:03,115 INFO L413 NwaCegarLoop]: 2214 mSDtfsCounter, 4646 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2915 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 5411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:28:03,115 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.7s Time] [2022-07-21 15:28:03,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2022-07-21 15:28:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4880. [2022-07-21 15:28:03,295 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-21 15:28:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 6549 transitions. [2022-07-21 15:28:03,306 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 6549 transitions. Word has length 120 [2022-07-21 15:28:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:28:03,306 INFO L495 AbstractCegarLoop]: Abstraction has 4880 states and 6549 transitions. [2022-07-21 15:28:03,306 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-21 15:28:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 6549 transitions. [2022-07-21 15:28:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-21 15:28:03,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:28:03,308 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-21 15:28:03,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 15:28:03,308 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-21 15:28:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:28:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash 453861164, now seen corresponding path program 1 times [2022-07-21 15:28:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:28:03,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504395261] [2022-07-21 15:28:03,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:28:03,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:28:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:28:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:28:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:28:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:28:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:28:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:28:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:28:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:28:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:28:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:28:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:28:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:28:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:28:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:28:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:28:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:28:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:28:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:28:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:28:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:03,499 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-21 15:28:03,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:28:03,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504395261] [2022-07-21 15:28:03,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504395261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:28:03,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:28:03,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:28:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482075030] [2022-07-21 15:28:03,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:28:03,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:28:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:28:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:28:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:28:03,502 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-21 15:28:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:28:08,508 INFO L93 Difference]: Finished difference Result 4880 states and 6549 transitions. [2022-07-21 15:28:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:28:08,508 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-21 15:28:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:28:08,521 INFO L225 Difference]: With dead ends: 4880 [2022-07-21 15:28:08,522 INFO L226 Difference]: Without dead ends: 4878 [2022-07-21 15:28:08,523 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-21 15:28:08,524 INFO L413 NwaCegarLoop]: 2212 mSDtfsCounter, 4640 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:28:08,524 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.7s Time] [2022-07-21 15:28:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2022-07-21 15:28:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4878. [2022-07-21 15:28:08,758 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-21 15:28:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6547 transitions. [2022-07-21 15:28:08,769 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 6547 transitions. Word has length 126 [2022-07-21 15:28:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:28:08,769 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 6547 transitions. [2022-07-21 15:28:08,769 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-21 15:28:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 6547 transitions. [2022-07-21 15:28:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-21 15:28:08,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:28:08,771 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-21 15:28:08,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:28:08,771 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-21 15:28:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:28:08,771 INFO L85 PathProgramCache]: Analyzing trace with hash 51485224, now seen corresponding path program 1 times [2022-07-21 15:28:08,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:28:08,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133117300] [2022-07-21 15:28:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:28:08,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:28:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:28:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:28:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:28:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:28:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:28:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:28:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:28:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:28:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:28:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:28:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:28:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:28:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:28:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:28:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:28:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:28:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:28:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:28:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:28:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:28:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:08,972 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-21 15:28:08,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:28:08,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133117300] [2022-07-21 15:28:08,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133117300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:28:08,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:28:08,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:28:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169721003] [2022-07-21 15:28:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:28:08,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:28:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:28:08,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:28:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:28:08,974 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-21 15:28:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:28:14,393 INFO L93 Difference]: Finished difference Result 4878 states and 6547 transitions. [2022-07-21 15:28:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:28:14,393 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-21 15:28:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:28:14,405 INFO L225 Difference]: With dead ends: 4878 [2022-07-21 15:28:14,405 INFO L226 Difference]: Without dead ends: 4876 [2022-07-21 15:28:14,406 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-21 15:28:14,407 INFO L413 NwaCegarLoop]: 2210 mSDtfsCounter, 4634 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:28:14,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4713 Valid, 2813 Invalid, 5407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 15:28:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4876 states. [2022-07-21 15:28:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4876 to 4876. [2022-07-21 15:28:14,652 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-21 15:28:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 6545 transitions. [2022-07-21 15:28:14,663 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 6545 transitions. Word has length 132 [2022-07-21 15:28:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:28:14,663 INFO L495 AbstractCegarLoop]: Abstraction has 4876 states and 6545 transitions. [2022-07-21 15:28:14,663 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-21 15:28:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 6545 transitions. [2022-07-21 15:28:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-21 15:28:14,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:28:14,664 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-21 15:28:14,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 15:28:14,665 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-21 15:28:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:28:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash -421925399, now seen corresponding path program 1 times [2022-07-21 15:28:14,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:28:14,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855226480] [2022-07-21 15:28:14,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:28:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:28:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:28:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:28:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:28:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:28:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:28:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:28:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:28:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:28:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:28:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:28:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:28:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:28:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:28:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:28:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:28:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:28:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:28:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:28:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:28:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:28:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:28:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:14,865 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-21 15:28:14,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:28:14,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855226480] [2022-07-21 15:28:14,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855226480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:28:14,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:28:14,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:28:14,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775775668] [2022-07-21 15:28:14,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:28:14,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:28:14,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:28:14,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:28:14,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:28:14,870 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-21 15:28:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:28:19,877 INFO L93 Difference]: Finished difference Result 4876 states and 6545 transitions. [2022-07-21 15:28:19,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:28:19,877 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-21 15:28:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:28:19,888 INFO L225 Difference]: With dead ends: 4876 [2022-07-21 15:28:19,888 INFO L226 Difference]: Without dead ends: 4874 [2022-07-21 15:28:19,890 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-21 15:28:19,890 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-21 15:28:19,890 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-21 15:28:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2022-07-21 15:28:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4874. [2022-07-21 15:28:20,084 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-21 15:28:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6543 transitions. [2022-07-21 15:28:20,095 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6543 transitions. Word has length 138 [2022-07-21 15:28:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:28:20,095 INFO L495 AbstractCegarLoop]: Abstraction has 4874 states and 6543 transitions. [2022-07-21 15:28:20,095 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-21 15:28:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6543 transitions. [2022-07-21 15:28:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-21 15:28:20,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:28:20,097 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-21 15:28:20,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 15:28:20,097 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-21 15:28:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:28:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1058198755, now seen corresponding path program 1 times [2022-07-21 15:28:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:28:20,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194787516] [2022-07-21 15:28:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:28:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:28:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:28:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:28:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:28:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 15:28:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:28:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:28:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:28:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:28:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:28:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:28:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:28:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:28:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:28:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:28:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:28:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:28:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:28:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:28:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:28:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:28:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:28:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:28:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:28:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:28:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:28:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:28:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:20,600 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-21 15:28:20,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:28:20,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194787516] [2022-07-21 15:28:20,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194787516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:28:20,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:28:20,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-21 15:28:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493765193] [2022-07-21 15:28:20,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:28:20,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 15:28:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:28:20,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 15:28:20,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2022-07-21 15:28:20,602 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-21 15:28:22,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:28:24,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:28:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:28:52,016 INFO L93 Difference]: Finished difference Result 10732 states and 14604 transitions. [2022-07-21 15:28:52,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-21 15:28:52,017 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-21 15:28:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:28:52,032 INFO L225 Difference]: With dead ends: 10732 [2022-07-21 15:28:52,032 INFO L226 Difference]: Without dead ends: 5891 [2022-07-21 15:28:52,042 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-21 15:28:52,043 INFO L413 NwaCegarLoop]: 2529 mSDtfsCounter, 4911 mSDsluCounter, 6932 mSDsCounter, 0 mSdLazyCounter, 38219 mSolverCounterSat, 3807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4994 SdHoareTripleChecker+Valid, 9461 SdHoareTripleChecker+Invalid, 42026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3807 IncrementalHoareTripleChecker+Valid, 38219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:28:52,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4994 Valid, 9461 Invalid, 42026 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3807 Valid, 38219 Invalid, 0 Unknown, 0 Unchecked, 30.2s Time] [2022-07-21 15:28:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5891 states. [2022-07-21 15:28:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5891 to 4910. [2022-07-21 15:28:52,277 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-21 15:28:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 6589 transitions. [2022-07-21 15:28:52,291 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 6589 transitions. Word has length 167 [2022-07-21 15:28:52,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:28:52,291 INFO L495 AbstractCegarLoop]: Abstraction has 4910 states and 6589 transitions. [2022-07-21 15:28:52,291 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-21 15:28:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 6589 transitions. [2022-07-21 15:28:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-21 15:28:52,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:28:52,293 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-21 15:28:52,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 15:28:52,293 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-21 15:28:52,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:28:52,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1162726059, now seen corresponding path program 1 times [2022-07-21 15:28:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:28:52,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454100956] [2022-07-21 15:28:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:28:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:28:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:28:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:28:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:28:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:28:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:28:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:28:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:28:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:28:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:28:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:28:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:28:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:28:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:28:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:28:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:28:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:28:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:28:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:28:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:28:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:28:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:28:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:28:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:28:52,508 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-21 15:28:52,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:28:52,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454100956] [2022-07-21 15:28:52,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454100956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:28:52,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:28:52,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:28:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029724277] [2022-07-21 15:28:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:28:52,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:28:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:28:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:28:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:28:52,511 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)