./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 eb692b52 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-?-eb692b5 [2022-07-20 03:53:56,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 03:53:56,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 03:53:56,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 03:53:56,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 03:53:56,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 03:53:56,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 03:53:56,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 03:53:56,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 03:53:56,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 03:53:56,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 03:53:56,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 03:53:56,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 03:53:56,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 03:53:56,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 03:53:56,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 03:53:56,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 03:53:56,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 03:53:56,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 03:53:56,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 03:53:56,285 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 03:53:56,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 03:53:56,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 03:53:56,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 03:53:56,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 03:53:56,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 03:53:56,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 03:53:56,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 03:53:56,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 03:53:56,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 03:53:56,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 03:53:56,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 03:53:56,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 03:53:56,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 03:53:56,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 03:53:56,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 03:53:56,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 03:53:56,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 03:53:56,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 03:53:56,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 03:53:56,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 03:53:56,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 03:53:56,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 03:53:56,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 03:53:56,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 03:53:56,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 03:53:56,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 03:53:56,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 03:53:56,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 03:53:56,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 03:53:56,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 03:53:56,325 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 03:53:56,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 03:53:56,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 03:53:56,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 03:53:56,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 03:53:56,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 03:53:56,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 03:53:56,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 03:53:56,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 03:53:56,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 03:53:56,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 03:53:56,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 03:53:56,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 03:53:56,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:53:56,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 03:53:56,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 03:53:56,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 03:53:56,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 03:53:56,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 03:53:56,330 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 03:53:56,330 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 03:53:56,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 03:53:56,331 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-20 03:53:56,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 03:53:56,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 03:53:56,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 03:53:56,551 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 03:53:56,557 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 03:53:56,558 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-20 03:53:56,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49122bd2/332e54305a734f8b83b40793e014576d/FLAG4ffc35e24 [2022-07-20 03:53:57,346 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 03:53:57,347 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-20 03:53:57,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49122bd2/332e54305a734f8b83b40793e014576d/FLAG4ffc35e24 [2022-07-20 03:53:57,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49122bd2/332e54305a734f8b83b40793e014576d [2022-07-20 03:53:57,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 03:53:57,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 03:53:57,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 03:53:57,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 03:53:57,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 03:53:57,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:53:57" (1/1) ... [2022-07-20 03:53:57,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ac812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:53:57, skipping insertion in model container [2022-07-20 03:53:57,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:53:57" (1/1) ... [2022-07-20 03:53:57,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 03:53:58,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 03:54:01,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:54:01,207 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 03:54:01,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477597,477610] [2022-07-20 03:54:01,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477742,477755] [2022-07-20 03:54:01,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[477888,477901] [2022-07-20 03:54:01,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478053,478066] [2022-07-20 03:54:01,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478211,478224] [2022-07-20 03:54:01,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478369,478382] [2022-07-20 03:54:01,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478527,478540] [2022-07-20 03:54:01,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478687,478700] [2022-07-20 03:54:01,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478846,478859] [2022-07-20 03:54:01,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[478985,478998] [2022-07-20 03:54:01,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479127,479140] [2022-07-20 03:54:01,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479276,479289] [2022-07-20 03:54:01,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479415,479428] [2022-07-20 03:54:01,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479570,479583] [2022-07-20 03:54:01,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479730,479743] [2022-07-20 03:54:01,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i[479881,479894] [2022-07-20 03:54:01,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/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-20 03:54:01,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 03:54:01,865 INFO L208 MainTranslator]: Completed translation [2022-07-20 03:54:01,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01 WrapperNode [2022-07-20 03:54:01,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 03:54:01,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 03:54:01,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 03:54:01,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 03:54:01,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:01,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:02,035 INFO L137 Inliner]: procedures = 673, calls = 2647, calls flagged for inlining = 296, calls inlined = 204, statements flattened = 6079 [2022-07-20 03:54:02,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 03:54:02,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 03:54:02,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 03:54:02,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 03:54:02,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:02,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:02,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:02,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:02,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:02,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:02,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:02,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 03:54:02,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 03:54:02,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 03:54:02,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 03:54:02,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (1/1) ... [2022-07-20 03:54:02,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 03:54:02,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:54:02,331 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-20 03:54:02,378 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-20 03:54:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2022-07-20 03:54:02,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2022-07-20 03:54:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2022-07-20 03:54:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2022-07-20 03:54:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2022-07-20 03:54:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2022-07-20 03:54:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-20 03:54:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2022-07-20 03:54:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 03:54:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 03:54:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2022-07-20 03:54:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2022-07-20 03:54:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 03:54:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 03:54:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2022-07-20 03:54:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2022-07-20 03:54:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 03:54:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 03:54:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2022-07-20 03:54:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2022-07-20 03:54:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 03:54:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 03:54:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2022-07-20 03:54:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2022-07-20 03:54:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2022-07-20 03:54:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2022-07-20 03:54:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2022-07-20 03:54:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2022-07-20 03:54:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 03:54:02,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 03:54:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-20 03:54:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-20 03:54:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-20 03:54:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-20 03:54:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 03:54:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 03:54:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 03:54:02,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 03:54:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 03:54:02,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 03:54:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2022-07-20 03:54:02,400 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2022-07-20 03:54:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2022-07-20 03:54:02,400 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2022-07-20 03:54:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 03:54:02,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 03:54:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 03:54:02,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 03:54:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 03:54:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2022-07-20 03:54:02,401 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2022-07-20 03:54:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2022-07-20 03:54:02,401 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2022-07-20 03:54:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2022-07-20 03:54:02,402 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2022-07-20 03:54:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 03:54:02,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 03:54:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 03:54:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-20 03:54:02,402 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-20 03:54:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 03:54:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 03:54:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 03:54:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 03:54:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 03:54:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-20 03:54:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2022-07-20 03:54:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2022-07-20 03:54:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2022-07-20 03:54:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 03:54:02,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 03:54:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 03:54:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 03:54:02,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 03:54:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-20 03:54:02,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-20 03:54:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-20 03:54:02,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-20 03:54:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 03:54:02,407 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 03:54:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2022-07-20 03:54:02,408 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2022-07-20 03:54:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 03:54:02,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 03:54:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-20 03:54:02,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-20 03:54:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 03:54:02,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 03:54:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2022-07-20 03:54:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2022-07-20 03:54:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 03:54:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 03:54:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-20 03:54:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-20 03:54:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 03:54:02,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 03:54:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 03:54:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 03:54:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2022-07-20 03:54:02,410 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2022-07-20 03:54:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 03:54:02,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 03:54:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 03:54:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 03:54:02,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 03:54:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-20 03:54:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-20 03:54:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-20 03:54:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2022-07-20 03:54:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 03:54:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 03:54:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-20 03:54:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-20 03:54:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2022-07-20 03:54:02,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2022-07-20 03:54:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2022-07-20 03:54:02,412 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2022-07-20 03:54:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2022-07-20 03:54:02,412 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2022-07-20 03:54:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-20 03:54:02,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-20 03:54:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2022-07-20 03:54:02,412 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2022-07-20 03:54:02,412 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-20 03:54:02,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2022-07-20 03:54:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 03:54:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 03:54:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-20 03:54:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-20 03:54:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-20 03:54:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-20 03:54:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2022-07-20 03:54:02,413 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2022-07-20 03:54:02,413 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2022-07-20 03:54:02,414 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2022-07-20 03:54:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 03:54:02,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 03:54:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2022-07-20 03:54:02,414 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2022-07-20 03:54:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-20 03:54:02,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-20 03:54:02,414 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-20 03:54:02,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2022-07-20 03:54:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 03:54:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 03:54:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 03:54:02,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 03:54:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 03:54:02,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 03:54:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2022-07-20 03:54:02,415 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2022-07-20 03:54:02,415 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2022-07-20 03:54:02,416 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2022-07-20 03:54:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-20 03:54:02,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2022-07-20 03:54:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2022-07-20 03:54:02,416 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2022-07-20 03:54:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2022-07-20 03:54:02,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2022-07-20 03:54:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-20 03:54:02,416 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-20 03:54:02,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 03:54:02,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 03:54:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2022-07-20 03:54:02,417 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2022-07-20 03:54:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 03:54:02,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 03:54:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2022-07-20 03:54:02,417 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2022-07-20 03:54:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 03:54:02,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 03:54:02,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 03:54:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 03:54:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2022-07-20 03:54:02,418 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2022-07-20 03:54:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2022-07-20 03:54:02,418 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2022-07-20 03:54:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 03:54:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-20 03:54:02,418 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-20 03:54:02,418 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 03:54:02,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 03:54:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2022-07-20 03:54:02,419 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2022-07-20 03:54:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-20 03:54:02,419 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-20 03:54:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2022-07-20 03:54:02,419 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2022-07-20 03:54:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 03:54:02,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 03:54:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 03:54:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 03:54:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-20 03:54:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2022-07-20 03:54:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 03:54:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 03:54:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2022-07-20 03:54:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2022-07-20 03:54:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2022-07-20 03:54:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2022-07-20 03:54:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-20 03:54:02,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2022-07-20 03:54:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 03:54:02,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 03:54:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 03:54:02,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-20 03:54:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 03:54:02,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 03:54:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 03:54:02,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 03:54:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-20 03:54:02,422 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-20 03:54:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2022-07-20 03:54:02,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2022-07-20 03:54:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 03:54:02,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 03:54:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 03:54:02,422 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 03:54:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 03:54:02,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-20 03:54:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2022-07-20 03:54:02,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2022-07-20 03:54:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 03:54:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 03:54:02,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 03:54:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2022-07-20 03:54:02,423 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2022-07-20 03:54:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 03:54:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 03:54:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 03:54:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 03:54:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-20 03:54:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-20 03:54:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-20 03:54:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-20 03:54:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2022-07-20 03:54:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2022-07-20 03:54:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2022-07-20 03:54:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2022-07-20 03:54:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2022-07-20 03:54:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2022-07-20 03:54:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 03:54:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 03:54:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 03:54:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 03:54:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-20 03:54:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-20 03:54:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2022-07-20 03:54:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2022-07-20 03:54:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2022-07-20 03:54:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2022-07-20 03:54:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-20 03:54:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-20 03:54:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-20 03:54:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-20 03:54:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 03:54:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-20 03:54:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-20 03:54:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-20 03:54:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2022-07-20 03:54:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2022-07-20 03:54:02,427 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2022-07-20 03:54:03,097 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 03:54:03,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 03:54:03,502 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 03:54:07,491 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 03:54:07,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 03:54:07,502 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 03:54:07,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:54:07 BoogieIcfgContainer [2022-07-20 03:54:07,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 03:54:07,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 03:54:07,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 03:54:07,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 03:54:07,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:53:57" (1/3) ... [2022-07-20 03:54:07,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f58c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:54:07, skipping insertion in model container [2022-07-20 03:54:07,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:54:01" (2/3) ... [2022-07-20 03:54:07,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f58c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:54:07, skipping insertion in model container [2022-07-20 03:54:07,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:54:07" (3/3) ... [2022-07-20 03:54:07,511 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.i [2022-07-20 03:54:07,520 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 03:54:07,520 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-20 03:54:07,575 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 03:54:07,579 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@374ae258, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@268af5a4 [2022-07-20 03:54:07,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-20 03:54:07,586 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-20 03:54:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 03:54:07,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:07,593 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-20 03:54:07,594 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-20 03:54:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1268169960, now seen corresponding path program 1 times [2022-07-20 03:54:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:07,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426602351] [2022-07-20 03:54:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:54:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:54:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:54:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:54:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:54:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:54:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:54:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:08,217 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-20 03:54:08,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:08,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426602351] [2022-07-20 03:54:08,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426602351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:54:08,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:54:08,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:54:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044944771] [2022-07-20 03:54:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:54:08,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:54:08,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:54:08,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:54:08,244 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-20 03:54:09,883 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-20 03:54:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:54:17,797 INFO L93 Difference]: Finished difference Result 5888 states and 8392 transitions. [2022-07-20 03:54:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 03:54:17,799 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-20 03:54:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:54:17,835 INFO L225 Difference]: With dead ends: 5888 [2022-07-20 03:54:17,835 INFO L226 Difference]: Without dead ends: 3905 [2022-07-20 03:54:17,850 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-20 03:54:17,852 INFO L413 NwaCegarLoop]: 2478 mSDtfsCounter, 7596 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 6492 mSolverCounterSat, 4211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7681 SdHoareTripleChecker+Valid, 3449 SdHoareTripleChecker+Invalid, 10703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4211 IncrementalHoareTripleChecker+Valid, 6492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-20 03:54:17,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7681 Valid, 3449 Invalid, 10703 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4211 Valid, 6492 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-07-20 03:54:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2022-07-20 03:54:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3713. [2022-07-20 03:54:18,054 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-20 03:54:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 5065 transitions. [2022-07-20 03:54:18,075 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 5065 transitions. Word has length 64 [2022-07-20 03:54:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:54:18,077 INFO L495 AbstractCegarLoop]: Abstraction has 3713 states and 5065 transitions. [2022-07-20 03:54:18,077 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-20 03:54:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 5065 transitions. [2022-07-20 03:54:18,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 03:54:18,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:18,084 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-20 03:54:18,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 03:54:18,085 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-20 03:54:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:18,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1435080531, now seen corresponding path program 1 times [2022-07-20 03:54:18,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:18,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859164597] [2022-07-20 03:54:18,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:18,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:54:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:54:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:54:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:54:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:54:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:54:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:54:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:54:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:18,371 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-20 03:54:18,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:18,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859164597] [2022-07-20 03:54:18,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859164597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:54:18,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:54:18,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:54:18,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469938775] [2022-07-20 03:54:18,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:54:18,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:54:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:18,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:54:18,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:54:18,374 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-20 03:54:20,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:54:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:54:24,727 INFO L93 Difference]: Finished difference Result 3713 states and 5065 transitions. [2022-07-20 03:54:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:54:24,727 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-20 03:54:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:54:24,740 INFO L225 Difference]: With dead ends: 3713 [2022-07-20 03:54:24,740 INFO L226 Difference]: Without dead ends: 3711 [2022-07-20 03:54:24,743 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-20 03:54:24,744 INFO L413 NwaCegarLoop]: 2247 mSDtfsCounter, 4725 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4814 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 5436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-20 03:54:24,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4814 Valid, 2878 Invalid, 5436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-20 03:54:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2022-07-20 03:54:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2022-07-20 03:54:24,828 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-20 03:54:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 5063 transitions. [2022-07-20 03:54:24,843 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 5063 transitions. Word has length 70 [2022-07-20 03:54:24,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:54:24,845 INFO L495 AbstractCegarLoop]: Abstraction has 3711 states and 5063 transitions. [2022-07-20 03:54:24,845 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-20 03:54:24,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 5063 transitions. [2022-07-20 03:54:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 03:54:24,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:24,848 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-20 03:54:24,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 03:54:24,848 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-20 03:54:24,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1860087943, now seen corresponding path program 1 times [2022-07-20 03:54:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:24,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073217232] [2022-07-20 03:54:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:54:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:54:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:54:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:54:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:54:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:54:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:54:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:54:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:54:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:25,121 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-20 03:54:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:25,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073217232] [2022-07-20 03:54:25,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073217232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:54:25,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:54:25,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:54:25,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491930378] [2022-07-20 03:54:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:54:25,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:54:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:25,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:54:25,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:54:25,124 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-20 03:54:27,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:54:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:54:30,951 INFO L93 Difference]: Finished difference Result 3711 states and 5063 transitions. [2022-07-20 03:54:30,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:54:30,951 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-20 03:54:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:54:30,969 INFO L225 Difference]: With dead ends: 3711 [2022-07-20 03:54:30,969 INFO L226 Difference]: Without dead ends: 3709 [2022-07-20 03:54:30,970 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-20 03:54:30,973 INFO L413 NwaCegarLoop]: 2245 mSDtfsCounter, 4719 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4807 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 5434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-20 03:54:30,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4807 Valid, 2876 Invalid, 5434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-20 03:54:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2022-07-20 03:54:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3709. [2022-07-20 03:54:31,134 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-20 03:54:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 5061 transitions. [2022-07-20 03:54:31,151 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 5061 transitions. Word has length 76 [2022-07-20 03:54:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:54:31,151 INFO L495 AbstractCegarLoop]: Abstraction has 3709 states and 5061 transitions. [2022-07-20 03:54:31,152 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-20 03:54:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 5061 transitions. [2022-07-20 03:54:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-20 03:54:31,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:31,154 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-20 03:54:31,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 03:54:31,154 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-20 03:54:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1019236422, now seen corresponding path program 1 times [2022-07-20 03:54:31,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:31,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114050160] [2022-07-20 03:54:31,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:31,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:54:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:54:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:54:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:54:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:54:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:54:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:54:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:54:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:54:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:54:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:31,374 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-20 03:54:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:31,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114050160] [2022-07-20 03:54:31,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114050160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:54:31,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:54:31,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:54:31,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653865810] [2022-07-20 03:54:31,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:54:31,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:54:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:54:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:54:31,377 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-20 03:54:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:54:35,705 INFO L93 Difference]: Finished difference Result 3709 states and 5061 transitions. [2022-07-20 03:54:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:54:35,706 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-20 03:54:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:54:35,759 INFO L225 Difference]: With dead ends: 3709 [2022-07-20 03:54:35,760 INFO L226 Difference]: Without dead ends: 3707 [2022-07-20 03:54:35,761 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-20 03:54:35,763 INFO L413 NwaCegarLoop]: 2243 mSDtfsCounter, 4713 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.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, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-20 03:54:35,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4800 Valid, 2874 Invalid, 5432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-20 03:54:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2022-07-20 03:54:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2022-07-20 03:54:35,897 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-20 03:54:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 5059 transitions. [2022-07-20 03:54:35,910 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 5059 transitions. Word has length 82 [2022-07-20 03:54:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:54:35,911 INFO L495 AbstractCegarLoop]: Abstraction has 3707 states and 5059 transitions. [2022-07-20 03:54:35,911 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-20 03:54:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 5059 transitions. [2022-07-20 03:54:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 03:54:35,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:35,913 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-20 03:54:35,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 03:54:35,913 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-20 03:54:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1523732060, now seen corresponding path program 1 times [2022-07-20 03:54:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:35,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218847751] [2022-07-20 03:54:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:54:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:54:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:54:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:54:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:54:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:54:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:54:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:54:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:54:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:54:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:54:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:36,246 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-20 03:54:36,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:36,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218847751] [2022-07-20 03:54:36,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218847751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:54:36,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:54:36,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:54:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548298849] [2022-07-20 03:54:36,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:54:36,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:54:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:36,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:54:36,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:54:36,248 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-20 03:54:37,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:54:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:54:41,682 INFO L93 Difference]: Finished difference Result 3707 states and 5059 transitions. [2022-07-20 03:54:41,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:54:41,683 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-20 03:54:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:54:41,697 INFO L225 Difference]: With dead ends: 3707 [2022-07-20 03:54:41,697 INFO L226 Difference]: Without dead ends: 3705 [2022-07-20 03:54:41,699 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-20 03:54:41,699 INFO L413 NwaCegarLoop]: 2241 mSDtfsCounter, 4707 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 2872 SdHoareTripleChecker+Invalid, 5430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-20 03:54:41,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 2872 Invalid, 5430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-20 03:54:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2022-07-20 03:54:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3705. [2022-07-20 03:54:41,793 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-20 03:54:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5057 transitions. [2022-07-20 03:54:41,802 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5057 transitions. Word has length 88 [2022-07-20 03:54:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:54:41,804 INFO L495 AbstractCegarLoop]: Abstraction has 3705 states and 5057 transitions. [2022-07-20 03:54:41,804 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-20 03:54:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5057 transitions. [2022-07-20 03:54:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-20 03:54:41,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:54:41,808 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-20 03:54:41,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 03:54:41,808 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-20 03:54:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:54:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1546673947, now seen corresponding path program 1 times [2022-07-20 03:54:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:54:41,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267897637] [2022-07-20 03:54:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:41,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:54:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:54:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:54:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:54:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:54:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:54:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:54:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:54:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:54:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 03:54:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:54:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:54:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:54:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:54:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:54:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:42,550 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-20 03:54:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:54:42,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267897637] [2022-07-20 03:54:42,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267897637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 03:54:42,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954251847] [2022-07-20 03:54:42,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:54:42,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:54:42,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:54:42,560 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-20 03:54:42,561 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-20 03:54:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:54:43,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 03:54:43,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 03:54:43,482 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-20 03:54:43,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 03:54:43,661 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-20 03:54:43,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954251847] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 03:54:43,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 03:54:43,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 23 [2022-07-20 03:54:43,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696678821] [2022-07-20 03:54:43,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 03:54:43,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 03:54:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:54:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 03:54:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2022-07-20 03:54:43,664 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-20 03:54:45,444 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-20 03:54:47,147 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-20 03:55:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:55:12,263 INFO L93 Difference]: Finished difference Result 4846 states and 6526 transitions. [2022-07-20 03:55:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 03:55:12,264 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-20 03:55:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:55:12,278 INFO L225 Difference]: With dead ends: 4846 [2022-07-20 03:55:12,279 INFO L226 Difference]: Without dead ends: 3911 [2022-07-20 03:55:12,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2022-07-20 03:55:12,284 INFO L413 NwaCegarLoop]: 2264 mSDtfsCounter, 3760 mSDsluCounter, 5047 mSDsCounter, 0 mSdLazyCounter, 43253 mSolverCounterSat, 2757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3779 SdHoareTripleChecker+Valid, 7311 SdHoareTripleChecker+Invalid, 46010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2757 IncrementalHoareTripleChecker+Valid, 43253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:55:12,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3779 Valid, 7311 Invalid, 46010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2757 Valid, 43253 Invalid, 0 Unknown, 0 Unchecked, 27.9s Time] [2022-07-20 03:55:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2022-07-20 03:55:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3742. [2022-07-20 03:55:12,488 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-20 03:55:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 5109 transitions. [2022-07-20 03:55:12,498 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 5109 transitions. Word has length 99 [2022-07-20 03:55:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:55:12,498 INFO L495 AbstractCegarLoop]: Abstraction has 3742 states and 5109 transitions. [2022-07-20 03:55:12,498 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-20 03:55:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 5109 transitions. [2022-07-20 03:55:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 03:55:12,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:55:12,499 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-20 03:55:12,523 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-20 03:55:12,699 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-20 03:55:12,700 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-20 03:55:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:55:12,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1428851801, now seen corresponding path program 1 times [2022-07-20 03:55:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:55:12,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482564514] [2022-07-20 03:55:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:55:12,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:55:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:55:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:55:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:55:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:55:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:55:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:55:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:55:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:55:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:55:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:55:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:55:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:55:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:55:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:12,896 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-20 03:55:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:55:12,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482564514] [2022-07-20 03:55:12,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482564514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:55:12,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:55:12,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:55:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018124950] [2022-07-20 03:55:12,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:55:12,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:55:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:55:12,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:55:12,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:55:12,898 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-20 03:55:14,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:55:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:55:17,882 INFO L93 Difference]: Finished difference Result 3742 states and 5109 transitions. [2022-07-20 03:55:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:55:17,883 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-20 03:55:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:55:17,895 INFO L225 Difference]: With dead ends: 3742 [2022-07-20 03:55:17,895 INFO L226 Difference]: Without dead ends: 3740 [2022-07-20 03:55:17,896 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-20 03:55:17,896 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 4701 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-20 03:55:17,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 2870 Invalid, 5428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2932 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-20 03:55:17,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2022-07-20 03:55:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2022-07-20 03:55:17,991 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-20 03:55:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5107 transitions. [2022-07-20 03:55:18,000 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5107 transitions. Word has length 94 [2022-07-20 03:55:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:55:18,001 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 5107 transitions. [2022-07-20 03:55:18,001 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-20 03:55:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5107 transitions. [2022-07-20 03:55:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-20 03:55:18,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:55:18,003 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-20 03:55:18,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 03:55:18,003 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-20 03:55:18,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:55:18,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1577371483, now seen corresponding path program 1 times [2022-07-20 03:55:18,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:55:18,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857570184] [2022-07-20 03:55:18,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:55:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:55:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:55:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:55:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:55:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:55:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 03:55:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:55:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:55:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:55:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:55:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:55:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:18,203 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-20 03:55:18,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:55:18,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857570184] [2022-07-20 03:55:18,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857570184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:55:18,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:55:18,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 03:55:18,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387017628] [2022-07-20 03:55:18,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:55:18,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 03:55:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:55:18,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 03:55:18,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 03:55:18,205 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-20 03:55:20,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:55:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:55:24,123 INFO L93 Difference]: Finished difference Result 7670 states and 10549 transitions. [2022-07-20 03:55:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:55:24,124 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-20 03:55:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:55:24,150 INFO L225 Difference]: With dead ends: 7670 [2022-07-20 03:55:24,150 INFO L226 Difference]: Without dead ends: 3965 [2022-07-20 03:55:24,159 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-20 03:55:24,160 INFO L413 NwaCegarLoop]: 2087 mSDtfsCounter, 6075 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 3946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6173 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 6261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3946 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:55:24,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6173 Valid, 2595 Invalid, 6261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3946 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-20 03:55:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-07-20 03:55:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3741. [2022-07-20 03:55:24,274 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-20 03:55:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5114 transitions. [2022-07-20 03:55:24,283 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5114 transitions. Word has length 115 [2022-07-20 03:55:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:55:24,283 INFO L495 AbstractCegarLoop]: Abstraction has 3741 states and 5114 transitions. [2022-07-20 03:55:24,284 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-20 03:55:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5114 transitions. [2022-07-20 03:55:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-20 03:55:24,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:55:24,285 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-20 03:55:24,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 03:55:24,286 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-20 03:55:24,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:55:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash -250727530, now seen corresponding path program 1 times [2022-07-20 03:55:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:55:24,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624696920] [2022-07-20 03:55:24,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:55:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:55:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:55:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:55:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:55:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:55:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:55:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:55:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:55:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:55:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:55:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:55:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:55:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:55:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:55:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:55:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:24,472 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-20 03:55:24,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:55:24,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624696920] [2022-07-20 03:55:24,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624696920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:55:24,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:55:24,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:55:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848127741] [2022-07-20 03:55:24,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:55:24,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:55:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:55:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:55:24,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:55:24,475 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-20 03:55:26,491 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-20 03:55:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:55:30,922 INFO L93 Difference]: Finished difference Result 3741 states and 5114 transitions. [2022-07-20 03:55:30,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:55:30,922 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-20 03:55:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:55:30,934 INFO L225 Difference]: With dead ends: 3741 [2022-07-20 03:55:30,934 INFO L226 Difference]: Without dead ends: 3739 [2022-07-20 03:55:30,935 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-20 03:55:30,937 INFO L413 NwaCegarLoop]: 2232 mSDtfsCounter, 4690 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 2928 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4774 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 5425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2928 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-20 03:55:30,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4774 Valid, 2849 Invalid, 5425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2928 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-20 03:55:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2022-07-20 03:55:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2022-07-20 03:55:31,120 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-20 03:55:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5112 transitions. [2022-07-20 03:55:31,129 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5112 transitions. Word has length 100 [2022-07-20 03:55:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:55:31,129 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5112 transitions. [2022-07-20 03:55:31,129 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-20 03:55:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5112 transitions. [2022-07-20 03:55:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-20 03:55:31,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:55:31,131 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-20 03:55:31,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 03:55:31,132 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-20 03:55:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:55:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1733111734, now seen corresponding path program 1 times [2022-07-20 03:55:31,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:55:31,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263887734] [2022-07-20 03:55:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:55:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:55:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:55:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:55:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:55:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:55:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 03:55:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:55:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:55:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:55:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:55:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:55:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 03:55:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:31,367 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-20 03:55:31,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:55:31,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263887734] [2022-07-20 03:55:31,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263887734] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 03:55:31,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678407977] [2022-07-20 03:55:31,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:55:31,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:55:31,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:55:31,384 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-20 03:55:31,385 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-20 03:55:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 2073 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 03:55:32,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 03:55:32,128 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-20 03:55:32,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 03:55:32,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678407977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:55:32,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 03:55:32,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-20 03:55:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339429704] [2022-07-20 03:55:32,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:55:32,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 03:55:32,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:55:32,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 03:55:32,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 03:55:32,129 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-20 03:55:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:55:32,300 INFO L93 Difference]: Finished difference Result 7437 states and 10168 transitions. [2022-07-20 03:55:32,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 03:55:32,301 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-20 03:55:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:55:32,311 INFO L225 Difference]: With dead ends: 7437 [2022-07-20 03:55:32,311 INFO L226 Difference]: Without dead ends: 3733 [2022-07-20 03:55:32,320 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-20 03:55:32,321 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-20 03:55:32,321 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-20 03:55:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2022-07-20 03:55:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3733. [2022-07-20 03:55:32,450 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-20 03:55:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5103 transitions. [2022-07-20 03:55:32,460 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5103 transitions. Word has length 121 [2022-07-20 03:55:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:55:32,461 INFO L495 AbstractCegarLoop]: Abstraction has 3733 states and 5103 transitions. [2022-07-20 03:55:32,461 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-20 03:55:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5103 transitions. [2022-07-20 03:55:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-20 03:55:32,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:55:32,463 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-20 03:55:32,488 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-20 03:55:32,684 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-20 03:55:32,685 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-20 03:55:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:55:32,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1292108662, now seen corresponding path program 1 times [2022-07-20 03:55:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:55:32,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774896730] [2022-07-20 03:55:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:55:32,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:55:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:55:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:55:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:55:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:55:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 03:55:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:55:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:55:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:55:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:55:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:55:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:32,927 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-20 03:55:32,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:55:32,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774896730] [2022-07-20 03:55:32,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774896730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:55:32,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:55:32,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 03:55:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078035657] [2022-07-20 03:55:32,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:55:32,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 03:55:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:55:32,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 03:55:32,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 03:55:32,930 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-20 03:55:35,894 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-20 03:55:42,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:55:42,812 INFO L93 Difference]: Finished difference Result 7594 states and 10483 transitions. [2022-07-20 03:55:42,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 03:55:42,813 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-20 03:55:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:55:42,826 INFO L225 Difference]: With dead ends: 7594 [2022-07-20 03:55:42,826 INFO L226 Difference]: Without dead ends: 3896 [2022-07-20 03:55:42,861 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-20 03:55:42,875 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 3706 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 9123 mSolverCounterSat, 2441 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3706 SdHoareTripleChecker+Valid, 3542 SdHoareTripleChecker+Invalid, 11565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2441 IncrementalHoareTripleChecker+Valid, 9123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:55:42,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3706 Valid, 3542 Invalid, 11565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2441 Valid, 9123 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2022-07-20 03:55:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2022-07-20 03:55:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3739. [2022-07-20 03:55:43,081 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-20 03:55:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5109 transitions. [2022-07-20 03:55:43,090 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5109 transitions. Word has length 125 [2022-07-20 03:55:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:55:43,092 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 5109 transitions. [2022-07-20 03:55:43,092 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-20 03:55:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5109 transitions. [2022-07-20 03:55:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 03:55:43,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:55:43,093 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-20 03:55:43,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 03:55:43,094 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-20 03:55:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:55:43,095 INFO L85 PathProgramCache]: Analyzing trace with hash 562293705, now seen corresponding path program 1 times [2022-07-20 03:55:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:55:43,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359851096] [2022-07-20 03:55:43,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:55:43,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:55:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:55:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:55:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:55:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:55:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:55:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:55:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:55:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:55:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:55:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:55:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:55:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:55:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:55:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:55:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:55:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:43,267 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-20 03:55:43,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:55:43,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359851096] [2022-07-20 03:55:43,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359851096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:55:43,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:55:43,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:55:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482762477] [2022-07-20 03:55:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:55:43,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:55:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:55:43,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:55:43,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:55:43,269 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-20 03:55:44,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:55:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:55:49,010 INFO L93 Difference]: Finished difference Result 3739 states and 5109 transitions. [2022-07-20 03:55:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:55:49,010 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-20 03:55:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:55:49,021 INFO L225 Difference]: With dead ends: 3739 [2022-07-20 03:55:49,021 INFO L226 Difference]: Without dead ends: 3737 [2022-07-20 03:55:49,022 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-20 03:55:49,025 INFO L413 NwaCegarLoop]: 2225 mSDtfsCounter, 4683 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2922 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4766 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 5418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:55:49,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4766 Valid, 2828 Invalid, 5418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2922 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-20 03:55:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2022-07-20 03:55:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3737. [2022-07-20 03:55:49,163 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-20 03:55:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 5107 transitions. [2022-07-20 03:55:49,172 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 5107 transitions. Word has length 106 [2022-07-20 03:55:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:55:49,172 INFO L495 AbstractCegarLoop]: Abstraction has 3737 states and 5107 transitions. [2022-07-20 03:55:49,173 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-20 03:55:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 5107 transitions. [2022-07-20 03:55:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 03:55:49,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:55:49,174 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-20 03:55:49,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 03:55:49,174 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-20 03:55:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:55:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1412084910, now seen corresponding path program 1 times [2022-07-20 03:55:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:55:49,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454270745] [2022-07-20 03:55:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:55:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:55:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:55:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:55:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:55:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:55:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 03:55:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:55:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:55:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:55:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:55:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:55:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:55:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:55:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 03:55:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:55:49,421 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-20 03:55:49,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:55:49,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454270745] [2022-07-20 03:55:49,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454270745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:55:49,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:55:49,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 03:55:49,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319009949] [2022-07-20 03:55:49,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:55:49,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 03:55:49,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:55:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 03:55:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 03:55:49,424 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-20 03:55:50,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:56:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:03,233 INFO L93 Difference]: Finished difference Result 8857 states and 12124 transitions. [2022-07-20 03:56:03,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 03:56:03,234 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-20 03:56:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:03,252 INFO L225 Difference]: With dead ends: 8857 [2022-07-20 03:56:03,253 INFO L226 Difference]: Without dead ends: 5155 [2022-07-20 03:56:03,266 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-20 03:56:03,267 INFO L413 NwaCegarLoop]: 2218 mSDtfsCounter, 6855 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 10506 mSolverCounterSat, 4026 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6946 SdHoareTripleChecker+Valid, 3420 SdHoareTripleChecker+Invalid, 14532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4026 IncrementalHoareTripleChecker+Valid, 10506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:03,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6946 Valid, 3420 Invalid, 14532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4026 Valid, 10506 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2022-07-20 03:56:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2022-07-20 03:56:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 4892. [2022-07-20 03:56:03,537 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-20 03:56:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 6570 transitions. [2022-07-20 03:56:03,551 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 6570 transitions. Word has length 128 [2022-07-20 03:56:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:03,552 INFO L495 AbstractCegarLoop]: Abstraction has 4892 states and 6570 transitions. [2022-07-20 03:56:03,552 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-20 03:56:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 6570 transitions. [2022-07-20 03:56:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 03:56:03,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:03,553 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-20 03:56:03,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 03:56:03,553 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-20 03:56:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1412144492, now seen corresponding path program 1 times [2022-07-20 03:56:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:03,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540103515] [2022-07-20 03:56:03,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:03,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:56:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:56:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:56:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:56:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:56:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 03:56:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:56:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:56:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:56:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:56:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:56:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:56:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:56:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:56:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 03:56:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:03,748 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-20 03:56:03,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:03,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540103515] [2022-07-20 03:56:03,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540103515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:03,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:03,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 03:56:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172025143] [2022-07-20 03:56:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:03,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 03:56:03,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 03:56:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 03:56:03,751 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-20 03:56:05,767 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-20 03:56:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:13,637 INFO L93 Difference]: Finished difference Result 5165 states and 6992 transitions. [2022-07-20 03:56:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 03:56:13,638 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-20 03:56:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:13,680 INFO L225 Difference]: With dead ends: 5165 [2022-07-20 03:56:13,681 INFO L226 Difference]: Without dead ends: 5163 [2022-07-20 03:56:13,683 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-20 03:56:13,683 INFO L413 NwaCegarLoop]: 2248 mSDtfsCounter, 3728 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 6738 mSolverCounterSat, 2430 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3728 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 9169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2430 IncrementalHoareTripleChecker+Valid, 6738 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:13,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3728 Valid, 3282 Invalid, 9169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2430 Valid, 6738 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2022-07-20 03:56:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2022-07-20 03:56:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4896. [2022-07-20 03:56:13,881 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-20 03:56:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 6572 transitions. [2022-07-20 03:56:13,894 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 6572 transitions. Word has length 128 [2022-07-20 03:56:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:13,894 INFO L495 AbstractCegarLoop]: Abstraction has 4896 states and 6572 transitions. [2022-07-20 03:56:13,895 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-20 03:56:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 6572 transitions. [2022-07-20 03:56:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 03:56:13,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:13,896 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-20 03:56:13,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 03:56:13,896 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-20 03:56:13,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:13,897 INFO L85 PathProgramCache]: Analyzing trace with hash -801451636, now seen corresponding path program 1 times [2022-07-20 03:56:13,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:13,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382245261] [2022-07-20 03:56:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:13,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:13,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:56:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:56:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:56:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:56:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:56:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:56:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:56:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:56:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:56:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:56:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:56:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:56:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:56:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:56:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:14,104 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-20 03:56:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382245261] [2022-07-20 03:56:14,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382245261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:14,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:14,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:14,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267867572] [2022-07-20 03:56:14,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:14,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:14,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:14,106 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-20 03:56:16,122 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-20 03:56:17,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:56:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:22,246 INFO L93 Difference]: Finished difference Result 4896 states and 6572 transitions. [2022-07-20 03:56:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:56:22,253 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-20 03:56:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:22,266 INFO L225 Difference]: With dead ends: 4896 [2022-07-20 03:56:22,266 INFO L226 Difference]: Without dead ends: 4894 [2022-07-20 03:56:22,270 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-20 03:56:22,271 INFO L413 NwaCegarLoop]: 2223 mSDtfsCounter, 4671 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 5420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:22,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 2826 Invalid, 5420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2923 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-07-20 03:56:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2022-07-20 03:56:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4894. [2022-07-20 03:56:22,467 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-20 03:56:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 6570 transitions. [2022-07-20 03:56:22,480 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 6570 transitions. Word has length 108 [2022-07-20 03:56:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:22,481 INFO L495 AbstractCegarLoop]: Abstraction has 4894 states and 6570 transitions. [2022-07-20 03:56:22,481 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-20 03:56:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 6570 transitions. [2022-07-20 03:56:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-20 03:56:22,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:22,483 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-20 03:56:22,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 03:56:22,483 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-20 03:56:22,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash -82159438, now seen corresponding path program 1 times [2022-07-20 03:56:22,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:22,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103332958] [2022-07-20 03:56:22,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:22,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:56:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:56:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:56:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:56:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:56:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 03:56:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:56:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:56:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:56:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:56:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:56:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:56:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:56:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:56:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 03:56:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:22,681 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-20 03:56:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:22,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103332958] [2022-07-20 03:56:22,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103332958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:22,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:22,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:22,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602338541] [2022-07-20 03:56:22,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:22,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:22,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:22,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:22,683 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-20 03:56:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:28,604 INFO L93 Difference]: Finished difference Result 9992 states and 13573 transitions. [2022-07-20 03:56:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:56:28,628 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-20 03:56:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:28,643 INFO L225 Difference]: With dead ends: 9992 [2022-07-20 03:56:28,659 INFO L226 Difference]: Without dead ends: 5133 [2022-07-20 03:56:28,673 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-20 03:56:28,688 INFO L413 NwaCegarLoop]: 2224 mSDtfsCounter, 5407 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 3273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5500 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 5228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3273 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:28,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5500 Valid, 2720 Invalid, 5228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3273 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-20 03:56:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2022-07-20 03:56:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 4884. [2022-07-20 03:56:28,907 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-20 03:56:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4884 states to 4884 states and 6553 transitions. [2022-07-20 03:56:28,922 INFO L78 Accepts]: Start accepts. Automaton has 4884 states and 6553 transitions. Word has length 132 [2022-07-20 03:56:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:28,923 INFO L495 AbstractCegarLoop]: Abstraction has 4884 states and 6553 transitions. [2022-07-20 03:56:28,923 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-20 03:56:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4884 states and 6553 transitions. [2022-07-20 03:56:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 03:56:28,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:28,925 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-20 03:56:28,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 03:56:28,925 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-20 03:56:28,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash -199200027, now seen corresponding path program 1 times [2022-07-20 03:56:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:28,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86093854] [2022-07-20 03:56:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:56:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:56:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:56:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:56:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:56:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:56:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:56:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:56:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:56:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:56:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:56:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:56:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:56:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:56:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:56:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:29,120 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-20 03:56:29,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:29,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86093854] [2022-07-20 03:56:29,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86093854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:29,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:29,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:29,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820194602] [2022-07-20 03:56:29,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:29,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:29,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:29,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:29,122 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-20 03:56:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:34,794 INFO L93 Difference]: Finished difference Result 4884 states and 6553 transitions. [2022-07-20 03:56:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:56:34,795 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-20 03:56:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:34,806 INFO L225 Difference]: With dead ends: 4884 [2022-07-20 03:56:34,806 INFO L226 Difference]: Without dead ends: 4882 [2022-07-20 03:56:34,808 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-20 03:56:34,808 INFO L413 NwaCegarLoop]: 2216 mSDtfsCounter, 4652 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:34,808 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.4s Time] [2022-07-20 03:56:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2022-07-20 03:56:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4882. [2022-07-20 03:56:35,017 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-20 03:56:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4882 states to 4882 states and 6551 transitions. [2022-07-20 03:56:35,029 INFO L78 Accepts]: Start accepts. Automaton has 4882 states and 6551 transitions. Word has length 114 [2022-07-20 03:56:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:35,029 INFO L495 AbstractCegarLoop]: Abstraction has 4882 states and 6551 transitions. [2022-07-20 03:56:35,029 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-20 03:56:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4882 states and 6551 transitions. [2022-07-20 03:56:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-20 03:56:35,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:35,031 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-20 03:56:35,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 03:56:35,031 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-20 03:56:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash 755987782, now seen corresponding path program 1 times [2022-07-20 03:56:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:35,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835493363] [2022-07-20 03:56:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:56:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:56:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:56:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:56:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:56:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:56:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:56:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:56:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:56:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:56:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:56:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:56:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:56:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:56:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:56:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:56:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 03:56:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:35,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835493363] [2022-07-20 03:56:35,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835493363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:35,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:35,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680632633] [2022-07-20 03:56:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:35,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:35,224 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-20 03:56:36,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:56:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:41,950 INFO L93 Difference]: Finished difference Result 4882 states and 6551 transitions. [2022-07-20 03:56:41,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:56:41,951 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-20 03:56:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:41,969 INFO L225 Difference]: With dead ends: 4882 [2022-07-20 03:56:41,970 INFO L226 Difference]: Without dead ends: 4880 [2022-07-20 03:56:41,972 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-20 03:56:41,972 INFO L413 NwaCegarLoop]: 2214 mSDtfsCounter, 4646 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2915 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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, 6.3s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:41,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 2817 Invalid, 5411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2915 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-20 03:56:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2022-07-20 03:56:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4880. [2022-07-20 03:56:42,194 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-20 03:56:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 6549 transitions. [2022-07-20 03:56:42,208 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 6549 transitions. Word has length 120 [2022-07-20 03:56:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:42,209 INFO L495 AbstractCegarLoop]: Abstraction has 4880 states and 6549 transitions. [2022-07-20 03:56:42,209 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-20 03:56:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 6549 transitions. [2022-07-20 03:56:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-20 03:56:42,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:42,210 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-20 03:56:42,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 03:56:42,211 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-20 03:56:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash 453861164, now seen corresponding path program 1 times [2022-07-20 03:56:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:42,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978246234] [2022-07-20 03:56:42,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:56:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:56:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:56:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:56:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:56:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:56:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:56:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:56:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:56:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:56:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:56:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:56:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:56:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:56:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:56:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:56:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:56:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:42,428 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-20 03:56:42,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:42,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978246234] [2022-07-20 03:56:42,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978246234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:42,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:42,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624220159] [2022-07-20 03:56:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:42,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:42,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:42,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:42,431 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-20 03:56:44,447 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-20 03:56:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:49,636 INFO L93 Difference]: Finished difference Result 4880 states and 6549 transitions. [2022-07-20 03:56:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:56:49,640 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-20 03:56:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:49,654 INFO L225 Difference]: With dead ends: 4880 [2022-07-20 03:56:49,654 INFO L226 Difference]: Without dead ends: 4878 [2022-07-20 03:56:49,657 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-20 03:56:49,659 INFO L413 NwaCegarLoop]: 2212 mSDtfsCounter, 4640 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 2912 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:49,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 2815 Invalid, 5409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2912 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-07-20 03:56:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2022-07-20 03:56:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4878. [2022-07-20 03:56:49,883 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-20 03:56:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6547 transitions. [2022-07-20 03:56:49,897 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 6547 transitions. Word has length 126 [2022-07-20 03:56:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:49,898 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 6547 transitions. [2022-07-20 03:56:49,898 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-20 03:56:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 6547 transitions. [2022-07-20 03:56:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-20 03:56:49,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:49,900 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-20 03:56:49,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 03:56:49,900 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-20 03:56:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash 51485224, now seen corresponding path program 1 times [2022-07-20 03:56:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:49,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085005092] [2022-07-20 03:56:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:56:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:56:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:56:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:56:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:56:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:56:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:56:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:56:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:56:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:56:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:56:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:56:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:56:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:56:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:56:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:56:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:56:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 03:56:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:50,155 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-20 03:56:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:50,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085005092] [2022-07-20 03:56:50,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085005092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:50,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:50,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153713617] [2022-07-20 03:56:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:50,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:50,157 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-20 03:56:52,173 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-20 03:56:53,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:56:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:56:58,079 INFO L93 Difference]: Finished difference Result 4878 states and 6547 transitions. [2022-07-20 03:56:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:56:58,080 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-20 03:56:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:56:58,094 INFO L225 Difference]: With dead ends: 4878 [2022-07-20 03:56:58,094 INFO L226 Difference]: Without dead ends: 4876 [2022-07-20 03:56:58,097 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-20 03:56:58,099 INFO L413 NwaCegarLoop]: 2210 mSDtfsCounter, 4634 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4713 SdHoareTripleChecker+Valid, 2813 SdHoareTripleChecker+Invalid, 5407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-20 03:56:58,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4713 Valid, 2813 Invalid, 5407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2910 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-07-20 03:56:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4876 states. [2022-07-20 03:56:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4876 to 4876. [2022-07-20 03:56:58,380 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-20 03:56:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 6545 transitions. [2022-07-20 03:56:58,394 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 6545 transitions. Word has length 132 [2022-07-20 03:56:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:56:58,395 INFO L495 AbstractCegarLoop]: Abstraction has 4876 states and 6545 transitions. [2022-07-20 03:56:58,398 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-20 03:56:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 6545 transitions. [2022-07-20 03:56:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-20 03:56:58,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:56:58,400 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-20 03:56:58,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 03:56:58,400 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-20 03:56:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:56:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash -421925399, now seen corresponding path program 1 times [2022-07-20 03:56:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:56:58,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202296361] [2022-07-20 03:56:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:56:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:56:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:56:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:56:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:56:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:56:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:56:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:56:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:56:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:56:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:56:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:56:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:56:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:56:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:56:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:56:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:56:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:56:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:56:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:56:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:56:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 03:56:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 03:56:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:56:58,709 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-20 03:56:58,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:56:58,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202296361] [2022-07-20 03:56:58,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202296361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:56:58,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:56:58,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:56:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653832380] [2022-07-20 03:56:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:56:58,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:56:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:56:58,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:56:58,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:56:58,711 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-20 03:57:00,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:05,287 INFO L93 Difference]: Finished difference Result 4876 states and 6545 transitions. [2022-07-20 03:57:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:05,287 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-20 03:57:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:05,301 INFO L225 Difference]: With dead ends: 4876 [2022-07-20 03:57:05,301 INFO L226 Difference]: Without dead ends: 4874 [2022-07-20 03:57:05,305 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-20 03:57:05,306 INFO L413 NwaCegarLoop]: 2208 mSDtfsCounter, 4628 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 2496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s 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, 6.2s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:05,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4706 Valid, 2811 Invalid, 5405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2909 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-20 03:57:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2022-07-20 03:57:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4874. [2022-07-20 03:57:05,612 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-20 03:57:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6543 transitions. [2022-07-20 03:57:05,623 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6543 transitions. Word has length 138 [2022-07-20 03:57:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:05,623 INFO L495 AbstractCegarLoop]: Abstraction has 4874 states and 6543 transitions. [2022-07-20 03:57:05,623 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-20 03:57:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6543 transitions. [2022-07-20 03:57:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-20 03:57:05,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:05,625 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-20 03:57:05,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 03:57:05,625 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-20 03:57:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:05,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1058198755, now seen corresponding path program 1 times [2022-07-20 03:57:05,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:05,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510893131] [2022-07-20 03:57:05,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:05,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:57:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:57:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:57:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 03:57:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:57:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:57:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:57:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:57:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:57:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:57:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:57:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:57:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:06,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-20 03:57:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:06,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 03:57:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 03:57:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 03:57:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:06,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 03:57:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:06,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 03:57:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:06,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 03:57:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:06,151 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-20 03:57:06,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:06,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510893131] [2022-07-20 03:57:06,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510893131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:06,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:06,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-20 03:57:06,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980428252] [2022-07-20 03:57:06,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:06,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 03:57:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:06,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 03:57:06,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2022-07-20 03:57:06,154 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-20 03:57:08,856 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-20 03:57:09,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:41,504 INFO L93 Difference]: Finished difference Result 10732 states and 14604 transitions. [2022-07-20 03:57:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 03:57:41,505 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-20 03:57:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:41,522 INFO L225 Difference]: With dead ends: 10732 [2022-07-20 03:57:41,522 INFO L226 Difference]: Without dead ends: 5891 [2022-07-20 03:57:41,533 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-20 03:57:41,534 INFO L413 NwaCegarLoop]: 2513 mSDtfsCounter, 4931 mSDsluCounter, 6932 mSDsCounter, 0 mSdLazyCounter, 37966 mSolverCounterSat, 3841 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5014 SdHoareTripleChecker+Valid, 9445 SdHoareTripleChecker+Invalid, 41808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3841 IncrementalHoareTripleChecker+Valid, 37966 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:41,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5014 Valid, 9445 Invalid, 41808 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3841 Valid, 37966 Invalid, 1 Unknown, 0 Unchecked, 34.0s Time] [2022-07-20 03:57:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5891 states. [2022-07-20 03:57:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5891 to 4910. [2022-07-20 03:57:41,797 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-20 03:57:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 6589 transitions. [2022-07-20 03:57:41,812 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 6589 transitions. Word has length 167 [2022-07-20 03:57:41,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:41,813 INFO L495 AbstractCegarLoop]: Abstraction has 4910 states and 6589 transitions. [2022-07-20 03:57:41,813 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-20 03:57:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 6589 transitions. [2022-07-20 03:57:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-20 03:57:41,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:41,817 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-20 03:57:41,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 03:57:41,818 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-20 03:57:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1162726059, now seen corresponding path program 1 times [2022-07-20 03:57:41,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:41,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213982381] [2022-07-20 03:57:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:41,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 03:57:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-20 03:57:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 03:57:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-20 03:57:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-20 03:57:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 03:57:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 03:57:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-20 03:57:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 03:57:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 03:57:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-20 03:57:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:57:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 03:57:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 03:57:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:57:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 03:57:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 03:57:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 03:57:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:42,213 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-20 03:57:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:42,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213982381] [2022-07-20 03:57:42,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213982381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 03:57:42,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 03:57:42,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 03:57:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245164248] [2022-07-20 03:57:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 03:57:42,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 03:57:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:42,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 03:57:42,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 03:57:42,215 INFO L87 Difference]: Start difference. First operand 4910 states and 6589 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 03:57:44,233 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-20 03:57:45,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 03:57:51,096 INFO L93 Difference]: Finished difference Result 4910 states and 6589 transitions. [2022-07-20 03:57:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 03:57:51,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-20 03:57:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 03:57:51,111 INFO L225 Difference]: With dead ends: 4910 [2022-07-20 03:57:51,111 INFO L226 Difference]: Without dead ends: 4908 [2022-07-20 03:57:51,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 03:57:51,114 INFO L413 NwaCegarLoop]: 2206 mSDtfsCounter, 4622 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 2906 mSolverCounterSat, 2496 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4699 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 5403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2496 IncrementalHoareTripleChecker+Valid, 2906 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-20 03:57:51,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4699 Valid, 2809 Invalid, 5403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2496 Valid, 2906 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2022-07-20 03:57:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2022-07-20 03:57:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 4908. [2022-07-20 03:57:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 3362 states have (on average 1.2403331350386675) internal successors, (4170), 3455 states have internal predecessors, (4170), 1174 states have call successors, (1174), 347 states have call predecessors, (1174), 359 states have return successors, (1243), 1148 states have call predecessors, (1243), 1172 states have call successors, (1243) [2022-07-20 03:57:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 6587 transitions. [2022-07-20 03:57:51,462 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 6587 transitions. Word has length 144 [2022-07-20 03:57:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 03:57:51,463 INFO L495 AbstractCegarLoop]: Abstraction has 4908 states and 6587 transitions. [2022-07-20 03:57:51,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 03:57:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 6587 transitions. [2022-07-20 03:57:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-20 03:57:51,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 03:57:51,465 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 03:57:51,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 03:57:51,465 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting fore200e_pca_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-20 03:57:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 03:57:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash 88155449, now seen corresponding path program 1 times [2022-07-20 03:57:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 03:57:51,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451992675] [2022-07-20 03:57:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 03:57:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 03:57:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 03:57:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 03:57:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 03:57:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:57:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:57:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 03:57:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:57:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:57:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-20 03:57:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:57:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:57:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 03:57:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 03:57:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-20 03:57:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 03:57:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 03:57:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 03:57:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 03:57:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 03:57:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 03:57:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-20 03:57:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 03:57:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 03:57:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 03:57:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-20 03:57:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2022-07-20 03:57:51,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 03:57:51,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451992675] [2022-07-20 03:57:51,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451992675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 03:57:51,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704406152] [2022-07-20 03:57:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 03:57:51,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 03:57:51,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 03:57:51,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 03:57:51,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 03:57:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 03:57:53,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 2222 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 03:57:53,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 03:57:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 179 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-20 03:57:53,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 03:57:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-07-20 03:57:53,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704406152] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 03:57:53,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 03:57:53,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 18 [2022-07-20 03:57:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654622163] [2022-07-20 03:57:53,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 03:57:53,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 03:57:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 03:57:53,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 03:57:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-20 03:57:53,571 INFO L87 Difference]: Start difference. First operand 4908 states and 6587 transitions. Second operand has 18 states, 17 states have (on average 5.705882352941177) internal successors, (97), 12 states have internal predecessors, (97), 5 states have call successors, (52), 6 states have call predecessors, (52), 5 states have return successors, (45), 6 states have call predecessors, (45), 5 states have call successors, (45) [2022-07-20 03:57:55,588 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-20 03:57:57,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 03:57:59,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []