./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.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 --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 a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:01:52,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:01:52,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-13 09:01:52,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:01:52,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:01:52,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:01:52,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:01:52,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:01:52,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:01:52,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:01:52,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:01:52,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:01:52,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:01:52,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:01:52,703 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:01:52,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:01:52,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:01:52,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:01:52,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:01:52,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:01:52,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:01:52,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:01:52,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:01:52,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:01:52,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:01:52,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:01:52,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:01:52,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:01:52,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:01:52,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:01:52,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:01:52,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:01:52,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:01:52,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:01:52,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:01:52,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:01:52,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:01:52,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:01:52,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:01:52,717 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 [2024-10-13 09:01:52,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:01:52,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:01:52,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:01:52,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:01:52,997 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:01:52,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2024-10-13 09:01:54,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:01:54,886 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:01:54,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2024-10-13 09:01:54,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b291616/ee86161d972345efa9c627525dfa7e13/FLAG9855af213 [2024-10-13 09:01:54,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b291616/ee86161d972345efa9c627525dfa7e13 [2024-10-13 09:01:54,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:01:54,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:01:54,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:01:54,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:01:54,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:01:54,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:01:54" (1/1) ... [2024-10-13 09:01:54,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485b8d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:54, skipping insertion in model container [2024-10-13 09:01:54,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:01:54" (1/1) ... [2024-10-13 09:01:55,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:01:58,007 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2024-10-13 09:01:58,014 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2024-10-13 09:01:58,015 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2024-10-13 09:01:58,015 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2024-10-13 09:01:58,015 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2024-10-13 09:01:58,017 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2024-10-13 09:01:58,017 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2024-10-13 09:01:58,017 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2024-10-13 09:01:58,018 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2024-10-13 09:01:58,018 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2024-10-13 09:01:58,019 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2024-10-13 09:01:58,019 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2024-10-13 09:01:58,020 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2024-10-13 09:01:58,020 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2024-10-13 09:01:58,021 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2024-10-13 09:01:58,021 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2024-10-13 09:01:58,022 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2024-10-13 09:01:58,023 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2024-10-13 09:01:58,023 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2024-10-13 09:01:58,024 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2024-10-13 09:01:58,024 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2024-10-13 09:01:58,025 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2024-10-13 09:01:58,025 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2024-10-13 09:01:58,026 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2024-10-13 09:01:58,026 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2024-10-13 09:01:58,027 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2024-10-13 09:01:58,027 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2024-10-13 09:01:58,027 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2024-10-13 09:01:58,028 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2024-10-13 09:01:58,028 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2024-10-13 09:01:58,029 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2024-10-13 09:01:58,029 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2024-10-13 09:01:58,030 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2024-10-13 09:01:58,030 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2024-10-13 09:01:58,031 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2024-10-13 09:01:58,031 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2024-10-13 09:01:58,032 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2024-10-13 09:01:58,032 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2024-10-13 09:01:58,033 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2024-10-13 09:01:58,033 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2024-10-13 09:01:58,034 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2024-10-13 09:01:58,034 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2024-10-13 09:01:58,035 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2024-10-13 09:01:58,036 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2024-10-13 09:01:58,036 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2024-10-13 09:01:58,036 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2024-10-13 09:01:58,037 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2024-10-13 09:01:58,037 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2024-10-13 09:01:58,037 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2024-10-13 09:01:58,038 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2024-10-13 09:01:58,039 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2024-10-13 09:01:58,039 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2024-10-13 09:01:58,040 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2024-10-13 09:01:58,040 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2024-10-13 09:01:58,040 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2024-10-13 09:01:58,041 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2024-10-13 09:01:58,041 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2024-10-13 09:01:58,041 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2024-10-13 09:01:58,042 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2024-10-13 09:01:58,043 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2024-10-13 09:01:58,044 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2024-10-13 09:01:58,045 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2024-10-13 09:01:58,045 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2024-10-13 09:01:58,045 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2024-10-13 09:01:58,046 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2024-10-13 09:01:58,046 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2024-10-13 09:01:58,048 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2024-10-13 09:01:58,048 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2024-10-13 09:01:58,048 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2024-10-13 09:01:58,049 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2024-10-13 09:01:58,049 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2024-10-13 09:01:58,049 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2024-10-13 09:01:58,050 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2024-10-13 09:01:58,050 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2024-10-13 09:01:58,050 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2024-10-13 09:01:58,051 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2024-10-13 09:01:58,051 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2024-10-13 09:01:58,051 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2024-10-13 09:01:58,052 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2024-10-13 09:01:58,053 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2024-10-13 09:01:58,054 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2024-10-13 09:01:58,055 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2024-10-13 09:01:58,055 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2024-10-13 09:01:58,055 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2024-10-13 09:01:58,056 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2024-10-13 09:01:58,056 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2024-10-13 09:01:58,057 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2024-10-13 09:01:58,057 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2024-10-13 09:01:58,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:01:58,108 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:01:58,190 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [4183-4184] [2024-10-13 09:01:58,194 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [4189-4191] [2024-10-13 09:01:58,403 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2024-10-13 09:01:58,404 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2024-10-13 09:01:58,404 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2024-10-13 09:01:58,405 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2024-10-13 09:01:58,405 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2024-10-13 09:01:58,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2024-10-13 09:01:58,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2024-10-13 09:01:58,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2024-10-13 09:01:58,407 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2024-10-13 09:01:58,407 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2024-10-13 09:01:58,407 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2024-10-13 09:01:58,408 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2024-10-13 09:01:58,408 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2024-10-13 09:01:58,408 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2024-10-13 09:01:58,408 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2024-10-13 09:01:58,409 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2024-10-13 09:01:58,409 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2024-10-13 09:01:58,409 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2024-10-13 09:01:58,409 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2024-10-13 09:01:58,410 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2024-10-13 09:01:58,410 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2024-10-13 09:01:58,410 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2024-10-13 09:01:58,410 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2024-10-13 09:01:58,411 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2024-10-13 09:01:58,411 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2024-10-13 09:01:58,412 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2024-10-13 09:01:58,416 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2024-10-13 09:01:58,417 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2024-10-13 09:01:58,417 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2024-10-13 09:01:58,418 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2024-10-13 09:01:58,418 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2024-10-13 09:01:58,418 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2024-10-13 09:01:58,419 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2024-10-13 09:01:58,419 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2024-10-13 09:01:58,419 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2024-10-13 09:01:58,419 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2024-10-13 09:01:58,420 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2024-10-13 09:01:58,420 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2024-10-13 09:01:58,420 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2024-10-13 09:01:58,421 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2024-10-13 09:01:58,421 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2024-10-13 09:01:58,422 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2024-10-13 09:01:58,423 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2024-10-13 09:01:58,423 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2024-10-13 09:01:58,423 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2024-10-13 09:01:58,424 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2024-10-13 09:01:58,424 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2024-10-13 09:01:58,424 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2024-10-13 09:01:58,424 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2024-10-13 09:01:58,425 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2024-10-13 09:01:58,425 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2024-10-13 09:01:58,426 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2024-10-13 09:01:58,426 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2024-10-13 09:01:58,427 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2024-10-13 09:01:58,427 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2024-10-13 09:01:58,427 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2024-10-13 09:01:58,428 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2024-10-13 09:01:58,428 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2024-10-13 09:01:58,429 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2024-10-13 09:01:58,429 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2024-10-13 09:01:58,430 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2024-10-13 09:01:58,430 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2024-10-13 09:01:58,431 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2024-10-13 09:01:58,431 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2024-10-13 09:01:58,431 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2024-10-13 09:01:58,431 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2024-10-13 09:01:58,431 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2024-10-13 09:01:58,432 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2024-10-13 09:01:58,432 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2024-10-13 09:01:58,432 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2024-10-13 09:01:58,432 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2024-10-13 09:01:58,433 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2024-10-13 09:01:58,433 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2024-10-13 09:01:58,433 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2024-10-13 09:01:58,433 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2024-10-13 09:01:58,434 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2024-10-13 09:01:58,434 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2024-10-13 09:01:58,435 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2024-10-13 09:01:58,437 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2024-10-13 09:01:58,437 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2024-10-13 09:01:58,438 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2024-10-13 09:01:58,438 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2024-10-13 09:01:58,438 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2024-10-13 09:01:58,439 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2024-10-13 09:01:58,439 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2024-10-13 09:01:58,439 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2024-10-13 09:01:58,440 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2024-10-13 09:01:58,440 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2024-10-13 09:01:58,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:01:58,611 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:01:58,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58 WrapperNode [2024-10-13 09:01:58,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:01:58,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:01:58,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:01:58,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:01:58,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:58,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:58,834 INFO L138 Inliner]: procedures = 571, calls = 1763, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2668 [2024-10-13 09:01:58,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:01:58,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:01:58,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:01:58,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:01:58,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:58,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:58,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:59,480 INFO L175 MemorySlicer]: Split 358 memory accesses to 20 slices as follows [2, 8, 8, 8, 2, 8, 9, 8, 8, 8, 8, 8, 6, 1, 2, 1, 2, 255, 5, 1]. 71 percent of accesses are in the largest equivalence class. The 146 initializations are split as follows [2, 8, 8, 8, 0, 8, 8, 8, 8, 8, 8, 8, 4, 0, 0, 1, 0, 53, 5, 1]. The 66 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 64, 0, 0]. [2024-10-13 09:01:59,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:59,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:59,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:59,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:59,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:59,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:59,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:01:59,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:01:59,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:01:59,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:01:59,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (1/1) ... [2024-10-13 09:01:59,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:01:59,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:01:59,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:01:59,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:01:59,739 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2024-10-13 09:01:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2024-10-13 09:01:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2024-10-13 09:01:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2024-10-13 09:01:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-13 09:01:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-13 09:01:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 09:01:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 09:01:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2024-10-13 09:01:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2024-10-13 09:01:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-13 09:01:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-13 09:01:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2024-10-13 09:01:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2024-10-13 09:01:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2024-10-13 09:01:59,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2024-10-13 09:01:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2024-10-13 09:01:59,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2024-10-13 09:01:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2024-10-13 09:01:59,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2024-10-13 09:01:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2024-10-13 09:01:59,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2024-10-13 09:01:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2024-10-13 09:01:59,744 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2024-10-13 09:01:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-13 09:01:59,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-13 09:01:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2024-10-13 09:01:59,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2024-10-13 09:01:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:01:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2024-10-13 09:01:59,744 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2024-10-13 09:01:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-13 09:01:59,745 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-13 09:01:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2024-10-13 09:01:59,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2024-10-13 09:01:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2024-10-13 09:01:59,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2024-10-13 09:01:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2024-10-13 09:01:59,745 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2024-10-13 09:01:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2024-10-13 09:01:59,745 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2024-10-13 09:01:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-13 09:01:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-10-13 09:01:59,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2024-10-13 09:01:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2024-10-13 09:01:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2024-10-13 09:01:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2024-10-13 09:01:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2024-10-13 09:01:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2024-10-13 09:01:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2024-10-13 09:01:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2024-10-13 09:01:59,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2024-10-13 09:01:59,747 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2024-10-13 09:01:59,749 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2024-10-13 09:01:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2024-10-13 09:01:59,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2024-10-13 09:01:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-13 09:01:59,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-13 09:01:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:01:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:01:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:01:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 09:01:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 09:01:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 09:01:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 09:01:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-13 09:01:59,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2024-10-13 09:01:59,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2024-10-13 09:01:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2024-10-13 09:01:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2024-10-13 09:01:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2024-10-13 09:01:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2024-10-13 09:01:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2024-10-13 09:01:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2024-10-13 09:01:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2024-10-13 09:01:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2024-10-13 09:01:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2024-10-13 09:01:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2024-10-13 09:01:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2024-10-13 09:01:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2024-10-13 09:01:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2024-10-13 09:01:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2024-10-13 09:01:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2024-10-13 09:01:59,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2024-10-13 09:01:59,753 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2024-10-13 09:01:59,753 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2024-10-13 09:01:59,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-13 09:01:59,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-13 09:01:59,753 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2024-10-13 09:01:59,753 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2024-10-13 09:01:59,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:01:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2024-10-13 09:01:59,756 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2024-10-13 09:01:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:01:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-13 09:01:59,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-13 09:01:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:01:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:01:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:01:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 09:01:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 09:01:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-13 09:01:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-13 09:01:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-13 09:01:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-13 09:01:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-13 09:01:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-13 09:01:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-13 09:01:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-13 09:01:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-13 09:01:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-13 09:01:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-13 09:01:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-13 09:01:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-13 09:01:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-13 09:01:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-13 09:01:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-13 09:01:59,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-13 09:01:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2024-10-13 09:01:59,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2024-10-13 09:01:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2024-10-13 09:01:59,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2024-10-13 09:01:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2024-10-13 09:01:59,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2024-10-13 09:01:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2024-10-13 09:01:59,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2024-10-13 09:01:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2024-10-13 09:01:59,760 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2024-10-13 09:01:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:01:59,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:01:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-13 09:01:59,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-13 09:01:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 09:01:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 09:01:59,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 09:01:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-13 09:01:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-13 09:01:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-10-13 09:01:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-10-13 09:01:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-10-13 09:01:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2024-10-13 09:01:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2024-10-13 09:01:59,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2024-10-13 09:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2024-10-13 09:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2024-10-13 09:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2024-10-13 09:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2024-10-13 09:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2024-10-13 09:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2024-10-13 09:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2024-10-13 09:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2024-10-13 09:01:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2024-10-13 09:01:59,762 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 09:01:59,762 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 09:01:59,762 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2024-10-13 09:01:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2024-10-13 09:01:59,764 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2024-10-13 09:01:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2024-10-13 09:01:59,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2024-10-13 09:01:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2024-10-13 09:01:59,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2024-10-13 09:01:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2024-10-13 09:01:59,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2024-10-13 09:01:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:01:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2024-10-13 09:01:59,766 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2024-10-13 09:01:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-13 09:01:59,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-13 09:01:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:01:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:01:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-13 09:01:59,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-13 09:01:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-13 09:01:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-13 09:01:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-13 09:01:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-13 09:01:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-13 09:01:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-13 09:01:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-13 09:01:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 09:01:59,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 09:01:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 09:01:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 09:01:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-13 09:01:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-13 09:01:59,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2024-10-13 09:01:59,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2024-10-13 09:01:59,770 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2024-10-13 09:01:59,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2024-10-13 09:01:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-13 09:01:59,771 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-13 09:01:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-13 09:01:59,771 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-13 09:01:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2024-10-13 09:01:59,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2024-10-13 09:01:59,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-13 09:01:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-13 09:01:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2024-10-13 09:01:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2024-10-13 09:01:59,775 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2024-10-13 09:01:59,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2024-10-13 09:01:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-13 09:01:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-13 09:01:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-13 09:01:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-13 09:01:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-13 09:01:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-13 09:01:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2024-10-13 09:01:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2024-10-13 09:01:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2024-10-13 09:01:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2024-10-13 09:01:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-13 09:01:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-13 09:01:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-13 09:01:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-13 09:01:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-13 09:01:59,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-13 09:01:59,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-13 09:01:59,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2024-10-13 09:01:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-13 09:01:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-13 09:01:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-13 09:01:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2024-10-13 09:01:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2024-10-13 09:01:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2024-10-13 09:01:59,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-13 09:01:59,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-13 09:01:59,779 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2024-10-13 09:01:59,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2024-10-13 09:01:59,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:01:59,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:01:59,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:01:59,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 09:01:59,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 09:01:59,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 09:01:59,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 09:01:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 09:01:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 09:01:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 09:01:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 09:01:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-13 09:01:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-13 09:01:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-13 09:01:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-13 09:01:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-13 09:01:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-13 09:01:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-13 09:01:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-13 09:01:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-13 09:02:00,382 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:02:00,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:02:00,423 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-13 09:02:02,734 INFO L? ?]: Removed 1241 outVars from TransFormulas that were not future-live. [2024-10-13 09:02:02,734 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:02:02,978 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:02:02,979 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 09:02:02,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:02:02 BoogieIcfgContainer [2024-10-13 09:02:02,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:02:02,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:02:02,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:02:02,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:02:02,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:01:54" (1/3) ... [2024-10-13 09:02:02,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5041abe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:02:02, skipping insertion in model container [2024-10-13 09:02:02,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:01:58" (2/3) ... [2024-10-13 09:02:02,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5041abe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:02:02, skipping insertion in model container [2024-10-13 09:02:02,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:02:02" (3/3) ... [2024-10-13 09:02:02,990 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2024-10-13 09:02:03,009 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:02:03,010 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-13 09:02:03,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:02:03,133 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ae12655, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:02:03,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-13 09:02:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 955 states, 580 states have (on average 1.3379310344827586) internal successors, (776), 621 states have internal predecessors, (776), 272 states have call successors, (272), 75 states have call predecessors, (272), 74 states have return successors, (269), 269 states have call predecessors, (269), 269 states have call successors, (269) [2024-10-13 09:02:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 09:02:03,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:03,160 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:03,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:03,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1957241157, now seen corresponding path program 1 times [2024-10-13 09:02:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433344602] [2024-10-13 09:02:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433344602] [2024-10-13 09:02:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433344602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:04,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:04,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:04,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149149346] [2024-10-13 09:02:04,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:04,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:04,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:04,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:04,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:04,197 INFO L87 Difference]: Start difference. First operand has 955 states, 580 states have (on average 1.3379310344827586) internal successors, (776), 621 states have internal predecessors, (776), 272 states have call successors, (272), 75 states have call predecessors, (272), 74 states have return successors, (269), 269 states have call predecessors, (269), 269 states have call successors, (269) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-10-13 09:02:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:08,547 INFO L93 Difference]: Finished difference Result 2806 states and 4008 transitions. [2024-10-13 09:02:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:02:08,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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 47 [2024-10-13 09:02:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:08,578 INFO L225 Difference]: With dead ends: 2806 [2024-10-13 09:02:08,579 INFO L226 Difference]: Without dead ends: 1854 [2024-10-13 09:02:08,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:02:08,592 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 2270 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 2865 mSolverCounterSat, 1469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2430 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 4334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1469 IncrementalHoareTripleChecker+Valid, 2865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:08,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2430 Valid, 3027 Invalid, 4334 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1469 Valid, 2865 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-13 09:02:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-10-13 09:02:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1677. [2024-10-13 09:02:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1037 states have (on average 1.2902603664416585) internal successors, (1338), 1094 states have internal predecessors, (1338), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2311 transitions. [2024-10-13 09:02:08,818 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2311 transitions. Word has length 47 [2024-10-13 09:02:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:08,818 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2311 transitions. [2024-10-13 09:02:08,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-10-13 09:02:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2311 transitions. [2024-10-13 09:02:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 09:02:08,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:08,821 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:08,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:02:08,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:08,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:08,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1652659797, now seen corresponding path program 1 times [2024-10-13 09:02:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:08,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004439840] [2024-10-13 09:02:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:08,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004439840] [2024-10-13 09:02:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004439840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:09,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421528525] [2024-10-13 09:02:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:09,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:09,187 INFO L87 Difference]: Start difference. First operand 1677 states and 2311 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2024-10-13 09:02:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:11,685 INFO L93 Difference]: Finished difference Result 1677 states and 2311 transitions. [2024-10-13 09:02:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:11,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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 52 [2024-10-13 09:02:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:11,699 INFO L225 Difference]: With dead ends: 1677 [2024-10-13 09:02:11,699 INFO L226 Difference]: Without dead ends: 1675 [2024-10-13 09:02:11,701 INFO L431 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 [2024-10-13 09:02:11,703 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1591 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:11,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1874 Invalid, 2695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 09:02:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2024-10-13 09:02:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2024-10-13 09:02:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1036 states have (on average 1.2895752895752897) internal successors, (1336), 1092 states have internal predecessors, (1336), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2309 transitions. [2024-10-13 09:02:11,811 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2309 transitions. Word has length 52 [2024-10-13 09:02:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:11,811 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2309 transitions. [2024-10-13 09:02:11,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2024-10-13 09:02:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2309 transitions. [2024-10-13 09:02:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 09:02:11,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:11,813 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:11,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:02:11,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:11,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1182610183, now seen corresponding path program 1 times [2024-10-13 09:02:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735365459] [2024-10-13 09:02:11,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:12,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:12,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735365459] [2024-10-13 09:02:12,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735365459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:12,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:12,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:12,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635960544] [2024-10-13 09:02:12,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:12,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:12,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:12,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:12,279 INFO L87 Difference]: Start difference. First operand 1675 states and 2309 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-10-13 09:02:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:14,732 INFO L93 Difference]: Finished difference Result 1675 states and 2309 transitions. [2024-10-13 09:02:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:14,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 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 57 [2024-10-13 09:02:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:14,743 INFO L225 Difference]: With dead ends: 1675 [2024-10-13 09:02:14,743 INFO L226 Difference]: Without dead ends: 1673 [2024-10-13 09:02:14,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:14,746 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1585 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:14,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 1874 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 09:02:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2024-10-13 09:02:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2024-10-13 09:02:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1035 states have (on average 1.288888888888889) internal successors, (1334), 1090 states have internal predecessors, (1334), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2307 transitions. [2024-10-13 09:02:14,838 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2307 transitions. Word has length 57 [2024-10-13 09:02:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:14,841 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2307 transitions. [2024-10-13 09:02:14,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-10-13 09:02:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2307 transitions. [2024-10-13 09:02:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 09:02:14,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:14,845 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:14,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:02:14,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:14,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:14,846 INFO L85 PathProgramCache]: Analyzing trace with hash -156758833, now seen corresponding path program 1 times [2024-10-13 09:02:14,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:14,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493522944] [2024-10-13 09:02:14,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:14,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:15,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:15,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493522944] [2024-10-13 09:02:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493522944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:15,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:15,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206005396] [2024-10-13 09:02:15,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:15,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:15,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:15,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:15,244 INFO L87 Difference]: Start difference. First operand 1673 states and 2307 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-10-13 09:02:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:17,373 INFO L93 Difference]: Finished difference Result 1673 states and 2307 transitions. [2024-10-13 09:02:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:17,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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 62 [2024-10-13 09:02:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:17,383 INFO L225 Difference]: With dead ends: 1673 [2024-10-13 09:02:17,384 INFO L226 Difference]: Without dead ends: 1671 [2024-10-13 09:02:17,385 INFO L431 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 [2024-10-13 09:02:17,387 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1579 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:17,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 1874 Invalid, 2687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 09:02:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-13 09:02:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2024-10-13 09:02:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1034 states have (on average 1.2882011605415862) internal successors, (1332), 1088 states have internal predecessors, (1332), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2305 transitions. [2024-10-13 09:02:17,484 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2305 transitions. Word has length 62 [2024-10-13 09:02:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:17,484 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2305 transitions. [2024-10-13 09:02:17,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2024-10-13 09:02:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2305 transitions. [2024-10-13 09:02:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 09:02:17,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:17,486 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:17,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:02:17,487 INFO L396 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_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:17,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:17,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1012408261, now seen corresponding path program 1 times [2024-10-13 09:02:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:17,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386543148] [2024-10-13 09:02:17,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386543148] [2024-10-13 09:02:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386543148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:17,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921721376] [2024-10-13 09:02:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:17,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:17,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:17,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:17,868 INFO L87 Difference]: Start difference. First operand 1671 states and 2305 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-10-13 09:02:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:20,127 INFO L93 Difference]: Finished difference Result 1671 states and 2305 transitions. [2024-10-13 09:02:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:20,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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 67 [2024-10-13 09:02:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:20,141 INFO L225 Difference]: With dead ends: 1671 [2024-10-13 09:02:20,141 INFO L226 Difference]: Without dead ends: 1669 [2024-10-13 09:02:20,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:20,143 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1573 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:20,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 1874 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 09:02:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-10-13 09:02:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2024-10-13 09:02:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1033 states have (on average 1.287512100677638) internal successors, (1330), 1086 states have internal predecessors, (1330), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2303 transitions. [2024-10-13 09:02:20,338 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2303 transitions. Word has length 67 [2024-10-13 09:02:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:20,343 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2303 transitions. [2024-10-13 09:02:20,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-10-13 09:02:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2303 transitions. [2024-10-13 09:02:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 09:02:20,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:20,344 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:20,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:02:20,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:20,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2119159064, now seen corresponding path program 1 times [2024-10-13 09:02:20,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:20,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136737530] [2024-10-13 09:02:20,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:20,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:20,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:20,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136737530] [2024-10-13 09:02:20,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136737530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:20,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:20,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829939443] [2024-10-13 09:02:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:20,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:20,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:20,741 INFO L87 Difference]: Start difference. First operand 1669 states and 2303 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2024-10-13 09:02:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:22,667 INFO L93 Difference]: Finished difference Result 1669 states and 2303 transitions. [2024-10-13 09:02:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:22,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 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 72 [2024-10-13 09:02:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:22,678 INFO L225 Difference]: With dead ends: 1669 [2024-10-13 09:02:22,678 INFO L226 Difference]: Without dead ends: 1667 [2024-10-13 09:02:22,679 INFO L431 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 [2024-10-13 09:02:22,680 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1567 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:22,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 1874 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 09:02:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-10-13 09:02:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2024-10-13 09:02:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1032 states have (on average 1.2868217054263567) internal successors, (1328), 1084 states have internal predecessors, (1328), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2301 transitions. [2024-10-13 09:02:22,857 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2301 transitions. Word has length 72 [2024-10-13 09:02:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:22,858 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2301 transitions. [2024-10-13 09:02:22,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2024-10-13 09:02:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2301 transitions. [2024-10-13 09:02:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 09:02:22,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:22,861 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:02:22,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:02:22,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:22,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1919243951, now seen corresponding path program 1 times [2024-10-13 09:02:22,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:22,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127094438] [2024-10-13 09:02:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:02:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:02:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 09:02:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 09:02:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 09:02:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-13 09:02:23,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:23,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127094438] [2024-10-13 09:02:23,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127094438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:23,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:23,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 09:02:23,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484808154] [2024-10-13 09:02:23,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:23,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:02:23,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:23,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:02:23,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:02:23,984 INFO L87 Difference]: Start difference. First operand 1667 states and 2301 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 09:02:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:27,882 INFO L93 Difference]: Finished difference Result 3408 states and 4733 transitions. [2024-10-13 09:02:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 09:02:27,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-10-13 09:02:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:27,896 INFO L225 Difference]: With dead ends: 3408 [2024-10-13 09:02:27,896 INFO L226 Difference]: Without dead ends: 1759 [2024-10-13 09:02:27,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-10-13 09:02:27,904 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1736 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 1375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 5181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1375 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:27,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 3236 Invalid, 5181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1375 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 09:02:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-10-13 09:02:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1683. [2024-10-13 09:02:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1040 states have (on average 1.2826923076923078) internal successors, (1334), 1092 states have internal predecessors, (1334), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2307 transitions. [2024-10-13 09:02:28,096 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2307 transitions. Word has length 92 [2024-10-13 09:02:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:28,098 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2307 transitions. [2024-10-13 09:02:28,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 09:02:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2307 transitions. [2024-10-13 09:02:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 09:02:28,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:28,102 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:02:28,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:02:28,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:28,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1919303533, now seen corresponding path program 1 times [2024-10-13 09:02:28,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:28,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424177503] [2024-10-13 09:02:28,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:02:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:02:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 09:02:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 09:02:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 09:02:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-13 09:02:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:28,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424177503] [2024-10-13 09:02:28,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424177503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:28,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:02:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534951097] [2024-10-13 09:02:28,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:28,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:02:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:28,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:02:28,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:02:28,575 INFO L87 Difference]: Start difference. First operand 1683 states and 2307 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 09:02:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:31,168 INFO L93 Difference]: Finished difference Result 1759 states and 2440 transitions. [2024-10-13 09:02:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 09:02:31,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 09:02:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:31,178 INFO L225 Difference]: With dead ends: 1759 [2024-10-13 09:02:31,178 INFO L226 Difference]: Without dead ends: 1757 [2024-10-13 09:02:31,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-13 09:02:31,180 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 992 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 4006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1144 IncrementalHoareTripleChecker+Valid, 2862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:31,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 2720 Invalid, 4006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1144 Valid, 2862 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 09:02:31,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2024-10-13 09:02:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1681. [2024-10-13 09:02:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1039 states have (on average 1.2810394610202118) internal successors, (1331), 1090 states have internal predecessors, (1331), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2304 transitions. [2024-10-13 09:02:31,307 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2304 transitions. Word has length 92 [2024-10-13 09:02:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:31,308 INFO L471 AbstractCegarLoop]: Abstraction has 1681 states and 2304 transitions. [2024-10-13 09:02:31,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 09:02:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2304 transitions. [2024-10-13 09:02:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 09:02:31,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:31,309 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:31,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:02:31,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:31,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:31,310 INFO L85 PathProgramCache]: Analyzing trace with hash 992782444, now seen corresponding path program 1 times [2024-10-13 09:02:31,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:31,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266486350] [2024-10-13 09:02:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266486350] [2024-10-13 09:02:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266486350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342604410] [2024-10-13 09:02:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:31,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:31,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:31,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:31,643 INFO L87 Difference]: Start difference. First operand 1681 states and 2304 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-10-13 09:02:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:33,572 INFO L93 Difference]: Finished difference Result 1681 states and 2304 transitions. [2024-10-13 09:02:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:33,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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 77 [2024-10-13 09:02:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:33,583 INFO L225 Difference]: With dead ends: 1681 [2024-10-13 09:02:33,584 INFO L226 Difference]: Without dead ends: 1679 [2024-10-13 09:02:33,585 INFO L431 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 [2024-10-13 09:02:33,586 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1552 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:33,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 1874 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 09:02:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2024-10-13 09:02:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2024-10-13 09:02:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1038 states have (on average 1.2803468208092486) internal successors, (1329), 1088 states have internal predecessors, (1329), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2302 transitions. [2024-10-13 09:02:33,728 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2302 transitions. Word has length 77 [2024-10-13 09:02:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 1679 states and 2302 transitions. [2024-10-13 09:02:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-10-13 09:02:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2302 transitions. [2024-10-13 09:02:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 09:02:33,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:33,730 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:02:33,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:02:33,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:33,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:33,731 INFO L85 PathProgramCache]: Analyzing trace with hash -854394762, now seen corresponding path program 1 times [2024-10-13 09:02:33,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:33,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785779735] [2024-10-13 09:02:33,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:33,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:02:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:02:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 09:02:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 09:02:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 09:02:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-13 09:02:34,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785779735] [2024-10-13 09:02:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785779735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:34,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:34,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:34,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986365296] [2024-10-13 09:02:34,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:34,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:34,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:34,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:34,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:34,076 INFO L87 Difference]: Start difference. First operand 1679 states and 2302 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 09:02:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:36,157 INFO L93 Difference]: Finished difference Result 3410 states and 4720 transitions. [2024-10-13 09:02:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2024-10-13 09:02:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:36,165 INFO L225 Difference]: With dead ends: 3410 [2024-10-13 09:02:36,165 INFO L226 Difference]: Without dead ends: 1749 [2024-10-13 09:02:36,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:36,171 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1862 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 1373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2033 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1373 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:36,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2033 Valid, 1694 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1373 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 09:02:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2024-10-13 09:02:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1673. [2024-10-13 09:02:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1033 states have (on average 1.2778315585672797) internal successors, (1320), 1082 states have internal predecessors, (1320), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2293 transitions. [2024-10-13 09:02:36,298 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2293 transitions. Word has length 95 [2024-10-13 09:02:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:36,299 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2293 transitions. [2024-10-13 09:02:36,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 09:02:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2293 transitions. [2024-10-13 09:02:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 09:02:36,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:36,300 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:36,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:02:36,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:36,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1324361744, now seen corresponding path program 1 times [2024-10-13 09:02:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23802801] [2024-10-13 09:02:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:36,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:36,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:36,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23802801] [2024-10-13 09:02:36,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23802801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:36,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:36,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:36,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988726633] [2024-10-13 09:02:36,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:36,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:36,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:36,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:36,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:36,604 INFO L87 Difference]: Start difference. First operand 1673 states and 2293 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, (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) [2024-10-13 09:02:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:38,369 INFO L93 Difference]: Finished difference Result 1673 states and 2293 transitions. [2024-10-13 09:02:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:38,369 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, (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 82 [2024-10-13 09:02:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:38,377 INFO L225 Difference]: With dead ends: 1673 [2024-10-13 09:02:38,377 INFO L226 Difference]: Without dead ends: 1671 [2024-10-13 09:02:38,378 INFO L431 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 [2024-10-13 09:02:38,379 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1531 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:38,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 1874 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 09:02:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-13 09:02:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2024-10-13 09:02:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1032 states have (on average 1.2771317829457365) internal successors, (1318), 1080 states have internal predecessors, (1318), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2291 transitions. [2024-10-13 09:02:38,524 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2291 transitions. Word has length 82 [2024-10-13 09:02:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:38,525 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2291 transitions. [2024-10-13 09:02:38,525 INFO L472 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, (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) [2024-10-13 09:02:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2291 transitions. [2024-10-13 09:02:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 09:02:38,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:38,527 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:38,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:02:38,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:38,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1401178253, now seen corresponding path program 1 times [2024-10-13 09:02:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:38,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369873240] [2024-10-13 09:02:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369873240] [2024-10-13 09:02:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369873240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841275271] [2024-10-13 09:02:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:38,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:38,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:38,891 INFO L87 Difference]: Start difference. First operand 1671 states and 2291 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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) [2024-10-13 09:02:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:40,720 INFO L93 Difference]: Finished difference Result 1671 states and 2291 transitions. [2024-10-13 09:02:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:40,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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 84 [2024-10-13 09:02:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:40,730 INFO L225 Difference]: With dead ends: 1671 [2024-10-13 09:02:40,731 INFO L226 Difference]: Without dead ends: 1669 [2024-10-13 09:02:40,732 INFO L431 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 [2024-10-13 09:02:40,732 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1523 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:40,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 1874 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 09:02:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-10-13 09:02:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2024-10-13 09:02:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1031 states have (on average 1.2764306498545102) internal successors, (1316), 1078 states have internal predecessors, (1316), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2289 transitions. [2024-10-13 09:02:40,879 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2289 transitions. Word has length 84 [2024-10-13 09:02:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:40,879 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2289 transitions. [2024-10-13 09:02:40,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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) [2024-10-13 09:02:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2289 transitions. [2024-10-13 09:02:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 09:02:40,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:40,882 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:40,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:02:40,882 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:40,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1430746745, now seen corresponding path program 1 times [2024-10-13 09:02:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355995282] [2024-10-13 09:02:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 09:02:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:41,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:41,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355995282] [2024-10-13 09:02:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355995282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:41,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:41,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216728714] [2024-10-13 09:02:41,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:41,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:41,201 INFO L87 Difference]: Start difference. First operand 1669 states and 2289 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2024-10-13 09:02:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:43,134 INFO L93 Difference]: Finished difference Result 1669 states and 2289 transitions. [2024-10-13 09:02:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:43,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 89 [2024-10-13 09:02:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:43,143 INFO L225 Difference]: With dead ends: 1669 [2024-10-13 09:02:43,143 INFO L226 Difference]: Without dead ends: 1667 [2024-10-13 09:02:43,144 INFO L431 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 [2024-10-13 09:02:43,145 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1519 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:43,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1874 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 09:02:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-10-13 09:02:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2024-10-13 09:02:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1030 states have (on average 1.2757281553398059) internal successors, (1314), 1076 states have internal predecessors, (1314), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2287 transitions. [2024-10-13 09:02:43,336 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2287 transitions. Word has length 89 [2024-10-13 09:02:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:43,336 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2287 transitions. [2024-10-13 09:02:43,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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) [2024-10-13 09:02:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2287 transitions. [2024-10-13 09:02:43,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 09:02:43,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:43,338 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:43,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:02:43,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:43,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1664244311, now seen corresponding path program 1 times [2024-10-13 09:02:43,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:43,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542426895] [2024-10-13 09:02:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 09:02:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 09:02:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:43,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:43,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542426895] [2024-10-13 09:02:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542426895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:43,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767678477] [2024-10-13 09:02:43,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:43,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:43,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:43,651 INFO L87 Difference]: Start difference. First operand 1667 states and 2287 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, (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) [2024-10-13 09:02:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:45,503 INFO L93 Difference]: Finished difference Result 1667 states and 2287 transitions. [2024-10-13 09:02:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:45,503 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, (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 94 [2024-10-13 09:02:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:45,509 INFO L225 Difference]: With dead ends: 1667 [2024-10-13 09:02:45,509 INFO L226 Difference]: Without dead ends: 1665 [2024-10-13 09:02:45,509 INFO L431 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 [2024-10-13 09:02:45,510 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1513 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:45,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1666 Valid, 1874 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 09:02:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2024-10-13 09:02:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2024-10-13 09:02:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1029 states have (on average 1.2750242954324587) internal successors, (1312), 1074 states have internal predecessors, (1312), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2285 transitions. [2024-10-13 09:02:45,660 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2285 transitions. Word has length 94 [2024-10-13 09:02:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:45,661 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2285 transitions. [2024-10-13 09:02:45,661 INFO L472 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, (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) [2024-10-13 09:02:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2285 transitions. [2024-10-13 09:02:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 09:02:45,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:45,663 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:45,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:02:45,663 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:45,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2008711655, now seen corresponding path program 1 times [2024-10-13 09:02:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:45,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699200270] [2024-10-13 09:02:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 09:02:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 09:02:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 09:02:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:46,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699200270] [2024-10-13 09:02:46,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699200270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:46,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:46,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:46,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631084997] [2024-10-13 09:02:46,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:46,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:46,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:46,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:46,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:46,030 INFO L87 Difference]: Start difference. First operand 1665 states and 2285 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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) [2024-10-13 09:02:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:47,867 INFO L93 Difference]: Finished difference Result 1665 states and 2285 transitions. [2024-10-13 09:02:47,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:47,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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 99 [2024-10-13 09:02:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:47,902 INFO L225 Difference]: With dead ends: 1665 [2024-10-13 09:02:47,902 INFO L226 Difference]: Without dead ends: 1663 [2024-10-13 09:02:47,902 INFO L431 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 [2024-10-13 09:02:47,903 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1507 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:47,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 1874 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 09:02:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-10-13 09:02:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2024-10-13 09:02:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1028 states have (on average 1.2743190661478598) internal successors, (1310), 1072 states have internal predecessors, (1310), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2283 transitions. [2024-10-13 09:02:48,032 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2283 transitions. Word has length 99 [2024-10-13 09:02:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:48,032 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2283 transitions. [2024-10-13 09:02:48,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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) [2024-10-13 09:02:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2283 transitions. [2024-10-13 09:02:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 09:02:48,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:48,034 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:48,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:02:48,035 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:48,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1199055038, now seen corresponding path program 1 times [2024-10-13 09:02:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:48,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679780890] [2024-10-13 09:02:48,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 09:02:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 09:02:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 09:02:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 09:02:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679780890] [2024-10-13 09:02:48,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679780890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:48,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:48,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:48,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703580759] [2024-10-13 09:02:48,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:48,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:48,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:48,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:48,436 INFO L87 Difference]: Start difference. First operand 1663 states and 2283 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-13 09:02:50,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:50,238 INFO L93 Difference]: Finished difference Result 1663 states and 2283 transitions. [2024-10-13 09:02:50,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:50,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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 104 [2024-10-13 09:02:50,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:50,246 INFO L225 Difference]: With dead ends: 1663 [2024-10-13 09:02:50,247 INFO L226 Difference]: Without dead ends: 1661 [2024-10-13 09:02:50,247 INFO L431 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 [2024-10-13 09:02:50,248 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1501 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:50,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 1874 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 09:02:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-10-13 09:02:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1661. [2024-10-13 09:02:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1027 states have (on average 1.2736124634858812) internal successors, (1308), 1070 states have internal predecessors, (1308), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2281 transitions. [2024-10-13 09:02:50,417 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2281 transitions. Word has length 104 [2024-10-13 09:02:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:50,418 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2281 transitions. [2024-10-13 09:02:50,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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) [2024-10-13 09:02:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2281 transitions. [2024-10-13 09:02:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 09:02:50,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:50,421 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:02:50,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:02:50,421 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:50,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 98607650, now seen corresponding path program 1 times [2024-10-13 09:02:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:50,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860560005] [2024-10-13 09:02:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:50,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:02:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:02:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 09:02:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 09:02:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 09:02:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 09:02:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 09:02:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-13 09:02:50,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:50,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860560005] [2024-10-13 09:02:50,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860560005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:50,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:50,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:02:50,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922004433] [2024-10-13 09:02:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:50,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:02:50,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:50,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:02:50,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:02:50,739 INFO L87 Difference]: Start difference. First operand 1661 states and 2281 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 09:02:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:53,594 INFO L93 Difference]: Finished difference Result 3378 states and 4666 transitions. [2024-10-13 09:02:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-10-13 09:02:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:53,606 INFO L225 Difference]: With dead ends: 3378 [2024-10-13 09:02:53,606 INFO L226 Difference]: Without dead ends: 1735 [2024-10-13 09:02:53,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:02:53,611 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 1829 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 1380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 3297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1380 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:53,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 1812 Invalid, 3297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1380 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 09:02:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2024-10-13 09:02:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1655. [2024-10-13 09:02:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1022 states have (on average 1.2710371819960862) internal successors, (1299), 1064 states have internal predecessors, (1299), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2272 transitions. [2024-10-13 09:02:53,747 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2272 transitions. Word has length 121 [2024-10-13 09:02:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:53,748 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2272 transitions. [2024-10-13 09:02:53,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 09:02:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2272 transitions. [2024-10-13 09:02:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 09:02:53,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:53,750 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:53,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:02:53,750 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:53,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash 37131002, now seen corresponding path program 1 times [2024-10-13 09:02:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942601966] [2024-10-13 09:02:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:53,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:53,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 09:02:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:54,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 09:02:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:54,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 09:02:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:54,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 09:02:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 09:02:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:54,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:54,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942601966] [2024-10-13 09:02:54,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942601966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:54,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:54,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778159475] [2024-10-13 09:02:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:54,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:54,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:54,023 INFO L87 Difference]: Start difference. First operand 1655 states and 2272 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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) [2024-10-13 09:02:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:55,882 INFO L93 Difference]: Finished difference Result 1655 states and 2272 transitions. [2024-10-13 09:02:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:55,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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 109 [2024-10-13 09:02:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:55,889 INFO L225 Difference]: With dead ends: 1655 [2024-10-13 09:02:55,889 INFO L226 Difference]: Without dead ends: 1653 [2024-10-13 09:02:55,890 INFO L431 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 [2024-10-13 09:02:55,891 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 1490 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 2630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:55,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 1855 Invalid, 2630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 09:02:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-10-13 09:02:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2024-10-13 09:02:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1021 states have (on average 1.2703232125367288) internal successors, (1297), 1062 states have internal predecessors, (1297), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2270 transitions. [2024-10-13 09:02:56,026 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2270 transitions. Word has length 109 [2024-10-13 09:02:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:56,027 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2270 transitions. [2024-10-13 09:02:56,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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) [2024-10-13 09:02:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2270 transitions. [2024-10-13 09:02:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 09:02:56,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:56,029 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:02:56,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:02:56,029 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash -324207322, now seen corresponding path program 1 times [2024-10-13 09:02:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:56,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063541834] [2024-10-13 09:02:56,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:56,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:02:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:02:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 09:02:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 09:02:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 09:02:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 09:02:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 09:02:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 09:02:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 09:02:56,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:56,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063541834] [2024-10-13 09:02:56,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063541834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:02:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708303010] [2024-10-13 09:02:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:56,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:02:56,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:02:56,372 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) [2024-10-13 09:02:56,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 09:02:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:57,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 09:02:57,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:02:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-13 09:02:57,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:02:57,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708303010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:57,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:02:57,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-13 09:02:57,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668649603] [2024-10-13 09:02:57,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:57,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:02:57,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:57,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:02:57,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:02:57,128 INFO L87 Difference]: Start difference. First operand 1653 states and 2270 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 09:02:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:57,428 INFO L93 Difference]: Finished difference Result 3282 states and 4505 transitions. [2024-10-13 09:02:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:02:57,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2024-10-13 09:02:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:57,435 INFO L225 Difference]: With dead ends: 3282 [2024-10-13 09:02:57,436 INFO L226 Difference]: Without dead ends: 1647 [2024-10-13 09:02:57,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:02:57,441 INFO L432 NwaCegarLoop]: 1105 mSDtfsCounter, 1180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:57,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1105 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:02:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-10-13 09:02:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2024-10-13 09:02:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1016 states have (on average 1.2677165354330708) internal successors, (1288), 1056 states have internal predecessors, (1288), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:02:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2261 transitions. [2024-10-13 09:02:57,599 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2261 transitions. Word has length 126 [2024-10-13 09:02:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:57,599 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2261 transitions. [2024-10-13 09:02:57,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 09:02:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2261 transitions. [2024-10-13 09:02:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 09:02:57,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:57,601 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:57,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 09:02:57,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:02:57,802 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:02:57,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2093124221, now seen corresponding path program 1 times [2024-10-13 09:02:57,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:57,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626792065] [2024-10-13 09:02:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:02:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:02:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:02:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:02:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:02:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:02:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:02:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 09:02:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 09:02:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 09:02:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 09:02:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 09:02:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 09:02:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:58,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:58,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626792065] [2024-10-13 09:02:58,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626792065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:58,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:58,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:58,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740897880] [2024-10-13 09:02:58,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:58,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:58,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:58,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:58,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:58,196 INFO L87 Difference]: Start difference. First operand 1647 states and 2261 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, (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) [2024-10-13 09:03:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:03:00,229 INFO L93 Difference]: Finished difference Result 1647 states and 2261 transitions. [2024-10-13 09:03:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:03:00,230 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, (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 114 [2024-10-13 09:03:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:03:00,236 INFO L225 Difference]: With dead ends: 1647 [2024-10-13 09:03:00,237 INFO L226 Difference]: Without dead ends: 1645 [2024-10-13 09:03:00,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:03:00,238 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 1479 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 09:03:00,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 1836 Invalid, 2625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 09:03:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-10-13 09:03:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1645. [2024-10-13 09:03:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1015 states have (on average 1.2669950738916256) internal successors, (1286), 1054 states have internal predecessors, (1286), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 476 states have call predecessors, (486), 485 states have call successors, (486) [2024-10-13 09:03:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2259 transitions. [2024-10-13 09:03:00,445 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2259 transitions. Word has length 114 [2024-10-13 09:03:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:03:00,445 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2259 transitions. [2024-10-13 09:03:00,445 INFO L472 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, (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) [2024-10-13 09:03:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2259 transitions. [2024-10-13 09:03:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 09:03:00,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:03:00,447 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:03:00,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:03:00,448 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2024-10-13 09:03:00,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:03:00,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1156418917, now seen corresponding path program 1 times [2024-10-13 09:03:00,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:03:00,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560388307] [2024-10-13 09:03:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:03:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:03:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 09:03:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:03:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:03:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 09:03:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 09:03:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 09:03:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 09:03:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 09:03:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:03:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 09:03:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:03:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:03:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 09:03:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 09:03:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 09:03:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 09:03:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 09:03:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 09:03:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 09:03:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:03:00,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:03:00,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560388307] [2024-10-13 09:03:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560388307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:03:00,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:03:00,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:03:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876948069] [2024-10-13 09:03:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:03:00,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:03:00,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:03:00,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:03:00,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:03:00,911 INFO L87 Difference]: Start difference. First operand 1645 states and 2259 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)