./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 16:19:26,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:19:27,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 16:19:27,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:19:27,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:19:27,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:19:27,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:19:27,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:19:27,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:19:27,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:19:27,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:19:27,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:19:27,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:19:27,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:19:27,077 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:19:27,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:19:27,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:19:27,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:19:27,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:19:27,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:19:27,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:19:27,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:19:27,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:19:27,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:19:27,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:19:27,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:19:27,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:19:27,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:19:27,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:19:27,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:19:27,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:19:27,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:19:27,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:19:27,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:19:27,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:19:27,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:19:27,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:19:27,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:19:27,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:19:27,090 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-clean/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-clean/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-11 16:19:27,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:19:27,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:19:27,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:19:27,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:19:27,404 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:19:27,406 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-11 16:19:28,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:19:29,457 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:19:29,458 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-11 16:19:29,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c78581a08/1e6703d98b47462f947e4c6ac95102f3/FLAGf27f9a620 [2024-10-11 16:19:30,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c78581a08/1e6703d98b47462f947e4c6ac95102f3 [2024-10-11 16:19:30,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:19:30,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:19:30,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:19:30,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:19:30,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:19:30,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:30" (1/1) ... [2024-10-11 16:19:30,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff6a370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:30, skipping insertion in model container [2024-10-11 16:19:30,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:19:30" (1/1) ... [2024-10-11 16:19:30,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:19:33,181 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-11 16:19:33,191 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-11 16:19:33,192 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-11 16:19:33,193 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-11 16:19:33,193 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-11 16:19:33,198 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-11 16:19:33,198 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-11 16:19:33,198 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-11 16:19:33,199 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-11 16:19:33,199 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-11 16:19:33,199 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-11 16:19:33,199 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-11 16:19:33,200 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-11 16:19:33,200 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-11 16:19:33,200 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-11 16:19:33,201 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-11 16:19:33,201 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-11 16:19:33,204 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-11 16:19:33,204 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-11 16:19:33,204 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-11 16:19:33,205 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-11 16:19:33,205 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-11 16:19:33,205 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-11 16:19:33,206 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-11 16:19:33,206 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-11 16:19:33,206 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-11 16:19:33,207 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-11 16:19:33,207 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-11 16:19:33,207 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-11 16:19:33,208 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-11 16:19:33,208 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-11 16:19:33,208 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-11 16:19:33,209 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-11 16:19:33,209 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-11 16:19:33,209 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-11 16:19:33,209 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-11 16:19:33,210 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-11 16:19:33,211 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-11 16:19:33,211 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-11 16:19:33,211 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-11 16:19:33,212 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-11 16:19:33,213 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-11 16:19:33,213 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-11 16:19:33,214 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-11 16:19:33,214 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-11 16:19:33,214 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-11 16:19:33,215 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-11 16:19:33,215 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-11 16:19:33,216 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-11 16:19:33,216 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-11 16:19:33,217 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-11 16:19:33,217 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-11 16:19:33,217 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-11 16:19:33,218 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-11 16:19:33,219 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-11 16:19:33,219 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-11 16:19:33,219 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-11 16:19:33,220 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-11 16:19:33,220 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-11 16:19:33,220 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-11 16:19:33,221 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-11 16:19:33,222 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-11 16:19:33,223 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-11 16:19:33,223 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-11 16:19:33,223 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-11 16:19:33,224 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-11 16:19:33,224 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-11 16:19:33,224 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-11 16:19:33,224 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-11 16:19:33,225 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-11 16:19:33,225 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-11 16:19:33,226 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-11 16:19:33,227 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-11 16:19:33,227 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-11 16:19:33,227 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-11 16:19:33,228 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-11 16:19:33,228 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-11 16:19:33,228 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-11 16:19:33,229 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-11 16:19:33,230 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-11 16:19:33,230 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-11 16:19:33,231 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-11 16:19:33,231 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-11 16:19:33,231 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-11 16:19:33,233 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-11 16:19:33,233 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-11 16:19:33,233 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-11 16:19:33,234 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-11 16:19:33,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:19:33,282 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:19:33,409 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-11 16:19:33,411 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-11 16:19:33,623 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-11 16:19:33,624 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-11 16:19:33,624 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-11 16:19:33,625 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-11 16:19:33,625 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-11 16:19:33,626 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-11 16:19:33,626 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-11 16:19:33,626 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-11 16:19:33,626 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-11 16:19:33,627 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-11 16:19:33,628 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-11 16:19:33,629 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-11 16:19:33,629 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-11 16:19:33,629 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-11 16:19:33,630 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-11 16:19:33,630 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-11 16:19:33,631 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-11 16:19:33,632 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-11 16:19:33,632 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-11 16:19:33,633 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-11 16:19:33,633 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-11 16:19:33,633 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-11 16:19:33,634 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-11 16:19:33,634 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-11 16:19:33,635 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-11 16:19:33,635 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-11 16:19:33,635 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-11 16:19:33,636 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-11 16:19:33,637 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-11 16:19:33,637 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-11 16:19:33,638 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-11 16:19:33,638 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-11 16:19:33,638 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-11 16:19:33,639 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-11 16:19:33,639 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-11 16:19:33,640 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-11 16:19:33,640 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-11 16:19:33,641 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-11 16:19:33,642 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-11 16:19:33,642 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-11 16:19:33,643 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-11 16:19:33,644 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-11 16:19:33,644 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-11 16:19:33,645 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-11 16:19:33,645 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-11 16:19:33,646 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-11 16:19:33,646 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-11 16:19:33,646 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-11 16:19:33,647 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-11 16:19:33,647 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-11 16:19:33,648 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-11 16:19:33,648 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-11 16:19:33,648 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-11 16:19:33,649 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-11 16:19:33,649 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-11 16:19:33,649 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-11 16:19:33,650 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-11 16:19:33,651 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-11 16:19:33,652 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-11 16:19:33,652 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-11 16:19:33,653 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-11 16:19:33,653 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-11 16:19:33,654 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-11 16:19:33,654 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-11 16:19:33,654 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-11 16:19:33,655 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-11 16:19:33,655 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-11 16:19:33,656 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-11 16:19:33,657 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-11 16:19:33,657 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-11 16:19:33,658 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-11 16:19:33,659 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-11 16:19:33,659 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-11 16:19:33,659 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-11 16:19:33,659 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-11 16:19:33,660 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-11 16:19:33,660 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-11 16:19:33,661 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-11 16:19:33,662 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-11 16:19:33,662 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-11 16:19:33,663 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-11 16:19:33,663 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-11 16:19:33,664 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-11 16:19:33,664 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-11 16:19:33,664 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-11 16:19:33,665 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-11 16:19:33,665 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-11 16:19:33,665 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-11 16:19:33,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:19:33,829 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:19:33,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33 WrapperNode [2024-10-11 16:19:33,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:19:33,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:19:33,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:19:33,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:19:33,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:33,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,054 INFO L138 Inliner]: procedures = 571, calls = 1763, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2668 [2024-10-11 16:19:34,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:19:34,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:19:34,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:19:34,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:19:34,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,460 INFO L175 MemorySlicer]: Split 358 memory accesses to 20 slices as follows [2, 8, 8, 8, 8, 9, 8, 2, 8, 8, 8, 8, 6, 2, 2, 1, 5, 255, 1, 1]. 71 percent of accesses are in the largest equivalence class. The 146 initializations are split as follows [2, 8, 8, 8, 8, 8, 8, 0, 8, 8, 8, 8, 4, 0, 0, 1, 5, 53, 0, 1]. The 66 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 64, 0, 0]. [2024-10-11 16:19:34,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:19:34,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:19:34,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:19:34,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:19:34,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (1/1) ... [2024-10-11 16:19:34,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:19:34,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:19:34,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:19:34,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:19:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2024-10-11 16:19:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2024-10-11 16:19:34,713 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2024-10-11 16:19:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2024-10-11 16:19:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-11 16:19:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-11 16:19:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 16:19:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 16:19:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2024-10-11 16:19:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2024-10-11 16:19:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-11 16:19:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-11 16:19:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2024-10-11 16:19:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2024-10-11 16:19:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2024-10-11 16:19:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2024-10-11 16:19:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2024-10-11 16:19:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2024-10-11 16:19:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2024-10-11 16:19:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2024-10-11 16:19:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2024-10-11 16:19:34,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2024-10-11 16:19:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2024-10-11 16:19:34,716 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2024-10-11 16:19:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-11 16:19:34,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-11 16:19:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2024-10-11 16:19:34,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2024-10-11 16:19:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:19:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2024-10-11 16:19:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2024-10-11 16:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-11 16:19:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-11 16:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2024-10-11 16:19:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2024-10-11 16:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2024-10-11 16:19:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2024-10-11 16:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2024-10-11 16:19:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2024-10-11 16:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2024-10-11 16:19:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2024-10-11 16:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 16:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 16:19:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 16:19:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 16:19:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 16:19:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 16:19:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 16:19:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 16:19:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-11 16:19:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-11 16:19:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2024-10-11 16:19:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2024-10-11 16:19:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2024-10-11 16:19:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2024-10-11 16:19:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2024-10-11 16:19:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2024-10-11 16:19:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-11 16:19:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-11 16:19:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:19:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:19:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:19:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 16:19:34,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2024-10-11 16:19:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2024-10-11 16:19:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2024-10-11 16:19:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2024-10-11 16:19:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2024-10-11 16:19:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2024-10-11 16:19:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2024-10-11 16:19:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2024-10-11 16:19:34,724 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2024-10-11 16:19:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2024-10-11 16:19:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2024-10-11 16:19:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-11 16:19:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2024-10-11 16:19:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2024-10-11 16:19:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-11 16:19:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:19:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 16:19:34,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-11 16:19:34,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-11 16:19:34,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-11 16:19:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-11 16:19:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-11 16:19:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-11 16:19:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-11 16:19:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-11 16:19:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-11 16:19:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 16:19:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 16:19:34,730 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2024-10-11 16:19:34,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2024-10-11 16:19:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2024-10-11 16:19:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2024-10-11 16:19:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2024-10-11 16:19:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2024-10-11 16:19:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2024-10-11 16:19:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2024-10-11 16:19:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2024-10-11 16:19:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2024-10-11 16:19:34,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:19:34,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:19:34,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 16:19:34,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 16:19:34,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:19:34,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:19:34,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:19:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-11 16:19:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-11 16:19:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-10-11 16:19:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-10-11 16:19:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-10-11 16:19:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2024-10-11 16:19:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2024-10-11 16:19:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2024-10-11 16:19:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2024-10-11 16:19:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2024-10-11 16:19:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2024-10-11 16:19:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2024-10-11 16:19:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2024-10-11 16:19:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2024-10-11 16:19:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2024-10-11 16:19:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2024-10-11 16:19:34,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2024-10-11 16:19:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2024-10-11 16:19:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2024-10-11 16:19:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2024-10-11 16:19:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2024-10-11 16:19:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:19:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2024-10-11 16:19:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-11 16:19:34,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-11 16:19:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:19:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:19:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:19:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 16:19:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 16:19:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 16:19:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 16:19:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 16:19:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 16:19:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 16:19:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 16:19:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 16:19:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 16:19:34,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 16:19:34,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 16:19:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 16:19:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 16:19:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 16:19:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 16:19:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 16:19:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 16:19:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 16:19:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2024-10-11 16:19:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2024-10-11 16:19:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 16:19:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-11 16:19:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2024-10-11 16:19:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2024-10-11 16:19:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-11 16:19:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-11 16:19:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2024-10-11 16:19:34,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2024-10-11 16:19:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2024-10-11 16:19:34,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2024-10-11 16:19:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-11 16:19:34,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-11 16:19:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-11 16:19:34,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-11 16:19:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-11 16:19:34,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2024-10-11 16:19:34,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2024-10-11 16:19:34,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2024-10-11 16:19:34,778 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2024-10-11 16:19:34,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2024-10-11 16:19:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-11 16:19:34,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-11 16:19:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 16:19:34,781 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-11 16:19:34,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 16:19:34,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-11 16:19:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-11 16:19:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2024-10-11 16:19:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2024-10-11 16:19:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-11 16:19:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-11 16:19:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 16:19:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 16:19:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-11 16:19:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-11 16:19:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2024-10-11 16:19:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2024-10-11 16:19:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2024-10-11 16:19:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-11 16:19:34,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2024-10-11 16:19:34,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 16:19:34,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 16:19:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 16:19:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 16:19:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 16:19:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 16:19:35,374 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:19:35,377 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:19:35,417 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 16:19:37,881 INFO L? ?]: Removed 1241 outVars from TransFormulas that were not future-live. [2024-10-11 16:19:37,881 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:19:38,069 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:19:38,069 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 16:19:38,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:19:38 BoogieIcfgContainer [2024-10-11 16:19:38,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:19:38,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:19:38,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:19:38,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:19:38,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:19:30" (1/3) ... [2024-10-11 16:19:38,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c96d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:19:38, skipping insertion in model container [2024-10-11 16:19:38,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:19:33" (2/3) ... [2024-10-11 16:19:38,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c96d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:19:38, skipping insertion in model container [2024-10-11 16:19:38,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:19:38" (3/3) ... [2024-10-11 16:19:38,082 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2024-10-11 16:19:38,100 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:19:38,100 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-11 16:19:38,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:19:38,218 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;@7a9ca03a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:19:38,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-11 16:19:38,230 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-11 16:19:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 16:19:38,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:19:38,242 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-11 16:19:38,243 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-11 16:19:38,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:19:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1957241157, now seen corresponding path program 1 times [2024-10-11 16:19:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:19:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304837496] [2024-10-11 16:19:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:19:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:19:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:19:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:19:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:19:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:19:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:19:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:19:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:19:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:39,143 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-11 16:19:39,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:19:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304837496] [2024-10-11 16:19:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304837496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:19:39,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:19:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:19:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455797684] [2024-10-11 16:19:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:19:39,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:19:39,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:19:39,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:19:39,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:19:39,182 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-11 16:19:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:19:43,825 INFO L93 Difference]: Finished difference Result 2806 states and 4008 transitions. [2024-10-11 16:19:43,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:19:43,828 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-11 16:19:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:19:43,860 INFO L225 Difference]: With dead ends: 2806 [2024-10-11 16:19:43,860 INFO L226 Difference]: Without dead ends: 1854 [2024-10-11 16:19:43,875 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-11 16:19:43,878 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 2270 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 2865 mSolverCounterSat, 1469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:19:43,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2430 Valid, 3027 Invalid, 4334 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1469 Valid, 2865 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 16:19:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-10-11 16:19:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1677. [2024-10-11 16:19:44,048 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-11 16:19:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2311 transitions. [2024-10-11 16:19:44,064 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2311 transitions. Word has length 47 [2024-10-11 16:19:44,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:19:44,065 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2311 transitions. [2024-10-11 16:19:44,065 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-11 16:19:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2311 transitions. [2024-10-11 16:19:44,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 16:19:44,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:19:44,068 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-11 16:19:44,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:19:44,068 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-11 16:19:44,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:19:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1652659797, now seen corresponding path program 1 times [2024-10-11 16:19:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:19:44,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85635528] [2024-10-11 16:19:44,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:19:44,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:19:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:19:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:19:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:19:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:19:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:19:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:19:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:19:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:19:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:44,498 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-11 16:19:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:19:44,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85635528] [2024-10-11 16:19:44,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85635528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:19:44,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:19:44,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:19:44,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189736350] [2024-10-11 16:19:44,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:19:44,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:19:44,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:19:44,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:19:44,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:19:44,502 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-11 16:19:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:19:46,631 INFO L93 Difference]: Finished difference Result 1677 states and 2311 transitions. [2024-10-11 16:19:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:19:46,631 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-11 16:19:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:19:46,646 INFO L225 Difference]: With dead ends: 1677 [2024-10-11 16:19:46,647 INFO L226 Difference]: Without dead ends: 1675 [2024-10-11 16:19:46,649 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-11 16:19:46,649 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1591 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 16:19:46,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1874 Invalid, 2695 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [924 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 16:19:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2024-10-11 16:19:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2024-10-11 16:19:46,753 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-11 16:19:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2309 transitions. [2024-10-11 16:19:46,764 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2309 transitions. Word has length 52 [2024-10-11 16:19:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:19:46,765 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2309 transitions. [2024-10-11 16:19:46,765 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-11 16:19:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2309 transitions. [2024-10-11 16:19:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 16:19:46,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:19:46,769 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-11 16:19:46,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:19:46,769 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-11 16:19:46,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:19:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1182610183, now seen corresponding path program 1 times [2024-10-11 16:19:46,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:19:46,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495700403] [2024-10-11 16:19:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:19:46,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:19:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:19:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:19:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:19:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:19:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:19:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:19:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:19:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:19:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:19:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:47,213 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-11 16:19:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:19:47,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495700403] [2024-10-11 16:19:47,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495700403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:19:47,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:19:47,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:19:47,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487187726] [2024-10-11 16:19:47,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:19:47,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:19:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:19:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:19:47,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:19:47,216 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-11 16:19:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:19:49,481 INFO L93 Difference]: Finished difference Result 1675 states and 2309 transitions. [2024-10-11 16:19:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:19:49,482 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-11 16:19:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:19:49,492 INFO L225 Difference]: With dead ends: 1675 [2024-10-11 16:19:49,492 INFO L226 Difference]: Without dead ends: 1673 [2024-10-11 16:19:49,494 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-11 16:19:49,495 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1585 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:19:49,495 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.1s Time] [2024-10-11 16:19:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2024-10-11 16:19:49,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2024-10-11 16:19:49,582 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-11 16:19:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2307 transitions. [2024-10-11 16:19:49,596 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2307 transitions. Word has length 57 [2024-10-11 16:19:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:19:49,598 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2307 transitions. [2024-10-11 16:19:49,598 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-11 16:19:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2307 transitions. [2024-10-11 16:19:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 16:19:49,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:19:49,603 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-11 16:19:49,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:19:49,603 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-11 16:19:49,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:19:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash -156758833, now seen corresponding path program 1 times [2024-10-11 16:19:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:19:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041440780] [2024-10-11 16:19:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:19:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:19:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:49,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:19:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:49,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:19:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:19:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:19:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:19:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:19:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:19:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:19:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:19:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:19:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:50,099 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-11 16:19:50,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:19:50,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041440780] [2024-10-11 16:19:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041440780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:19:50,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:19:50,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:19:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570943282] [2024-10-11 16:19:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:19:50,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:19:50,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:19:50,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:19:50,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:19:50,103 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-11 16:19:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:19:52,355 INFO L93 Difference]: Finished difference Result 1673 states and 2307 transitions. [2024-10-11 16:19:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:19:52,356 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-11 16:19:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:19:52,364 INFO L225 Difference]: With dead ends: 1673 [2024-10-11 16:19:52,364 INFO L226 Difference]: Without dead ends: 1671 [2024-10-11 16:19:52,365 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-11 16:19:52,366 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:19:52,366 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.1s Time] [2024-10-11 16:19:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-11 16:19:52,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2024-10-11 16:19:52,455 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-11 16:19:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2305 transitions. [2024-10-11 16:19:52,464 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2305 transitions. Word has length 62 [2024-10-11 16:19:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:19:52,465 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2305 transitions. [2024-10-11 16:19:52,465 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-11 16:19:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2305 transitions. [2024-10-11 16:19:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:19:52,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:19:52,468 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-11 16:19:52,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:19:52,469 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-11 16:19:52,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:19:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1012408261, now seen corresponding path program 1 times [2024-10-11 16:19:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:19:52,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845179694] [2024-10-11 16:19:52,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:19:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:19:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:19:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:19:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:19:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:19:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:19:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:19:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:19:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:19:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:19:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:19:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:19:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:52,780 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-11 16:19:52,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:19:52,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845179694] [2024-10-11 16:19:52,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845179694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:19:52,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:19:52,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:19:52,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924980854] [2024-10-11 16:19:52,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:19:52,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:19:52,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:19:52,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:19:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:19:52,782 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-11 16:19:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:19:55,042 INFO L93 Difference]: Finished difference Result 1671 states and 2305 transitions. [2024-10-11 16:19:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:19:55,043 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-11 16:19:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:19:55,052 INFO L225 Difference]: With dead ends: 1671 [2024-10-11 16:19:55,053 INFO L226 Difference]: Without dead ends: 1669 [2024-10-11 16:19:55,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:19:55,055 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1573 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:19:55,055 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.0s Time] [2024-10-11 16:19:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-10-11 16:19:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2024-10-11 16:19:55,148 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-11 16:19:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2303 transitions. [2024-10-11 16:19:55,158 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2303 transitions. Word has length 67 [2024-10-11 16:19:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:19:55,158 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2303 transitions. [2024-10-11 16:19:55,158 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-11 16:19:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2303 transitions. [2024-10-11 16:19:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 16:19:55,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:19:55,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, 1, 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-11 16:19:55,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:19:55,160 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-11 16:19:55,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:19:55,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2119159064, now seen corresponding path program 1 times [2024-10-11 16:19:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:19:55,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894030599] [2024-10-11 16:19:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:19:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:19:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:19:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:19:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:19:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:19:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:19:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:19:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:19:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:19:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:19:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:19:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:19:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:19:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:55,520 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-11 16:19:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:19:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894030599] [2024-10-11 16:19:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894030599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:19:55,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:19:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:19:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781492861] [2024-10-11 16:19:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:19:55,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:19:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:19:55,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:19:55,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:19:55,523 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-11 16:19:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:19:57,455 INFO L93 Difference]: Finished difference Result 1669 states and 2303 transitions. [2024-10-11 16:19:57,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:19:57,455 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-11 16:19:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:19:57,464 INFO L225 Difference]: With dead ends: 1669 [2024-10-11 16:19:57,465 INFO L226 Difference]: Without dead ends: 1667 [2024-10-11 16:19:57,466 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-11 16:19:57,467 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-11 16:19:57,467 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-11 16:19:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-10-11 16:19:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2024-10-11 16:19:57,646 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-11 16:19:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2301 transitions. [2024-10-11 16:19:57,662 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2301 transitions. Word has length 72 [2024-10-11 16:19:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:19:57,663 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2301 transitions. [2024-10-11 16:19:57,663 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-11 16:19:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2301 transitions. [2024-10-11 16:19:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 16:19:57,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:19:57,664 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-11 16:19:57,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:19:57,665 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-11 16:19:57,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:19:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1919243951, now seen corresponding path program 1 times [2024-10-11 16:19:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:19:57,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820429886] [2024-10-11 16:19:57,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:19:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:19:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:19:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:19:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 16:19:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:19:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:19:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 16:19:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:19:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:19:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 16:19:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:19:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:19:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:19:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:19:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:19:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 16:19:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 16:19:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:19:58,909 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-11 16:19:58,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:19:58,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820429886] [2024-10-11 16:19:58,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820429886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:19:58,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:19:58,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:19:58,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108778569] [2024-10-11 16:19:58,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:19:58,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:19:58,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:19:58,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:19:58,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:19:58,910 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-11 16:20:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:03,101 INFO L93 Difference]: Finished difference Result 3408 states and 4733 transitions. [2024-10-11 16:20:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:20:03,102 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-11 16:20:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:03,111 INFO L225 Difference]: With dead ends: 3408 [2024-10-11 16:20:03,112 INFO L226 Difference]: Without dead ends: 1759 [2024-10-11 16:20:03,117 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-11 16:20:03,118 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1736 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 1375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:03,118 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.8s Time] [2024-10-11 16:20:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-10-11 16:20:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1683. [2024-10-11 16:20:03,229 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-11 16:20:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2307 transitions. [2024-10-11 16:20:03,237 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2307 transitions. Word has length 92 [2024-10-11 16:20:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:03,238 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2307 transitions. [2024-10-11 16:20:03,238 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-11 16:20:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2307 transitions. [2024-10-11 16:20:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 16:20:03,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:03,240 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-11 16:20:03,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:20:03,240 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-11 16:20:03,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:03,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1919303533, now seen corresponding path program 1 times [2024-10-11 16:20:03,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:03,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342754734] [2024-10-11 16:20:03,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:03,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 16:20:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 16:20:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 16:20:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 16:20:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 16:20:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:03,703 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-11 16:20:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342754734] [2024-10-11 16:20:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342754734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:20:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105833637] [2024-10-11 16:20:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:20:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:03,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:20:03,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:20:03,705 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-11 16:20:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:06,439 INFO L93 Difference]: Finished difference Result 1759 states and 2440 transitions. [2024-10-11 16:20:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:20:06,439 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-11 16:20:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:06,448 INFO L225 Difference]: With dead ends: 1759 [2024-10-11 16:20:06,449 INFO L226 Difference]: Without dead ends: 1757 [2024-10-11 16:20:06,450 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-11 16:20:06,451 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 992 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:06,451 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.5s Time] [2024-10-11 16:20:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2024-10-11 16:20:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1681. [2024-10-11 16:20:06,631 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-11 16:20:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2304 transitions. [2024-10-11 16:20:06,641 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2304 transitions. Word has length 92 [2024-10-11 16:20:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:06,642 INFO L471 AbstractCegarLoop]: Abstraction has 1681 states and 2304 transitions. [2024-10-11 16:20:06,642 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-11 16:20:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2304 transitions. [2024-10-11 16:20:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 16:20:06,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:06,643 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-11 16:20:06,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:20:06,644 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-11 16:20:06,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:06,644 INFO L85 PathProgramCache]: Analyzing trace with hash 992782444, now seen corresponding path program 1 times [2024-10-11 16:20:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:06,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172677042] [2024-10-11 16:20:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:20:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:20:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:20:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:20:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:20:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:20:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:20:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:06,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:20:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:07,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:20:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:07,021 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-11 16:20:07,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:07,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172677042] [2024-10-11 16:20:07,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172677042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:07,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:07,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994068061] [2024-10-11 16:20:07,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:07,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:07,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:07,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:07,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:07,023 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-11 16:20:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:08,966 INFO L93 Difference]: Finished difference Result 1681 states and 2304 transitions. [2024-10-11 16:20:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:08,966 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-11 16:20:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:08,975 INFO L225 Difference]: With dead ends: 1681 [2024-10-11 16:20:08,975 INFO L226 Difference]: Without dead ends: 1679 [2024-10-11 16:20:08,977 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-11 16:20:08,977 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:08,978 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.8s Time] [2024-10-11 16:20:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2024-10-11 16:20:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2024-10-11 16:20:09,130 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-11 16:20:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2302 transitions. [2024-10-11 16:20:09,145 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2302 transitions. Word has length 77 [2024-10-11 16:20:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:09,146 INFO L471 AbstractCegarLoop]: Abstraction has 1679 states and 2302 transitions. [2024-10-11 16:20:09,146 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-11 16:20:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2302 transitions. [2024-10-11 16:20:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 16:20:09,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:09,150 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-11 16:20:09,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:20:09,150 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-11 16:20:09,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash -854394762, now seen corresponding path program 1 times [2024-10-11 16:20:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:09,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157816035] [2024-10-11 16:20:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 16:20:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 16:20:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 16:20:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 16:20:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 16:20:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:09,487 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-11 16:20:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157816035] [2024-10-11 16:20:09,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157816035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:09,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:09,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810667131] [2024-10-11 16:20:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:09,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:09,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:09,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:09,489 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-11 16:20:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:11,544 INFO L93 Difference]: Finished difference Result 3410 states and 4720 transitions. [2024-10-11 16:20:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:11,544 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-11 16:20:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:11,552 INFO L225 Difference]: With dead ends: 3410 [2024-10-11 16:20:11,552 INFO L226 Difference]: Without dead ends: 1749 [2024-10-11 16:20:11,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:20:11,558 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:11,558 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.8s Time] [2024-10-11 16:20:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2024-10-11 16:20:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1673. [2024-10-11 16:20:11,686 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-11 16:20:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2293 transitions. [2024-10-11 16:20:11,695 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2293 transitions. Word has length 95 [2024-10-11 16:20:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:11,696 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2293 transitions. [2024-10-11 16:20:11,696 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-11 16:20:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2293 transitions. [2024-10-11 16:20:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 16:20:11,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:11,697 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-11 16:20:11,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:20:11,698 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-11 16:20:11,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:11,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1324361744, now seen corresponding path program 1 times [2024-10-11 16:20:11,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:11,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768823316] [2024-10-11 16:20:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:20:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:20:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:20:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:20:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:20:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:20:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:20:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:20:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:20:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:12,005 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-11 16:20:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:12,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768823316] [2024-10-11 16:20:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768823316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:12,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973369354] [2024-10-11 16:20:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:12,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:12,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:12,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:12,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:12,008 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-11 16:20:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:13,859 INFO L93 Difference]: Finished difference Result 1673 states and 2293 transitions. [2024-10-11 16:20:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:13,860 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-11 16:20:13,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:13,868 INFO L225 Difference]: With dead ends: 1673 [2024-10-11 16:20:13,868 INFO L226 Difference]: Without dead ends: 1671 [2024-10-11 16:20:13,869 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-11 16:20:13,869 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:13,870 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.7s Time] [2024-10-11 16:20:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2024-10-11 16:20:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2024-10-11 16:20:14,000 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-11 16:20:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2291 transitions. [2024-10-11 16:20:14,010 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2291 transitions. Word has length 82 [2024-10-11 16:20:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:14,012 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2291 transitions. [2024-10-11 16:20:14,013 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-11 16:20:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2291 transitions. [2024-10-11 16:20:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 16:20:14,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:14,014 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-11 16:20:14,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:20:14,015 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-11 16:20:14,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:14,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1401178253, now seen corresponding path program 1 times [2024-10-11 16:20:14,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:14,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45527393] [2024-10-11 16:20:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:14,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:20:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:20:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:20:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:20:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:20:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:20:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:20:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:20:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:20:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:14,350 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-11 16:20:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45527393] [2024-10-11 16:20:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45527393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973564452] [2024-10-11 16:20:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:14,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:14,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:14,352 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-11 16:20:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:16,461 INFO L93 Difference]: Finished difference Result 1671 states and 2291 transitions. [2024-10-11 16:20:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:16,462 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-11 16:20:16,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:16,472 INFO L225 Difference]: With dead ends: 1671 [2024-10-11 16:20:16,472 INFO L226 Difference]: Without dead ends: 1669 [2024-10-11 16:20:16,474 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-11 16:20:16,474 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1523 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:16,474 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.9s Time] [2024-10-11 16:20:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-10-11 16:20:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2024-10-11 16:20:16,612 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-11 16:20:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2289 transitions. [2024-10-11 16:20:16,648 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2289 transitions. Word has length 84 [2024-10-11 16:20:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:16,648 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2289 transitions. [2024-10-11 16:20:16,649 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-11 16:20:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2289 transitions. [2024-10-11 16:20:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 16:20:16,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:16,651 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-11 16:20:16,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:20:16,651 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-11 16:20:16,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1430746745, now seen corresponding path program 1 times [2024-10-11 16:20:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:16,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295475073] [2024-10-11 16:20:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:20:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:20:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:20:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:20:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:20:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:20:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:20:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:20:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:17,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:20:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:17,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:17,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 16:20:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:17,060 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-11 16:20:17,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:17,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295475073] [2024-10-11 16:20:17,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295475073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:17,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826497686] [2024-10-11 16:20:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:17,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:17,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:17,064 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-11 16:20:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:18,929 INFO L93 Difference]: Finished difference Result 1669 states and 2289 transitions. [2024-10-11 16:20:18,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:18,930 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-11 16:20:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:18,938 INFO L225 Difference]: With dead ends: 1669 [2024-10-11 16:20:18,938 INFO L226 Difference]: Without dead ends: 1667 [2024-10-11 16:20:18,939 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-11 16:20:18,940 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-11 16:20:18,940 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-11 16:20:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-10-11 16:20:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2024-10-11 16:20:19,096 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-11 16:20:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2287 transitions. [2024-10-11 16:20:19,103 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2287 transitions. Word has length 89 [2024-10-11 16:20:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:19,103 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2287 transitions. [2024-10-11 16:20:19,103 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-11 16:20:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2287 transitions. [2024-10-11 16:20:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 16:20:19,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:19,105 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-11 16:20:19,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 16:20:19,105 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-11 16:20:19,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1664244311, now seen corresponding path program 1 times [2024-10-11 16:20:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107775475] [2024-10-11 16:20:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:20:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:20:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:20:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:20:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:20:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:20:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:20:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:20:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:20:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 16:20:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 16:20:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:19,414 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-11 16:20:19,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:19,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107775475] [2024-10-11 16:20:19,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107775475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:19,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:19,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:19,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997569849] [2024-10-11 16:20:19,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:19,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:19,418 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-11 16:20:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:21,254 INFO L93 Difference]: Finished difference Result 1667 states and 2287 transitions. [2024-10-11 16:20:21,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:21,254 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-11 16:20:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:21,262 INFO L225 Difference]: With dead ends: 1667 [2024-10-11 16:20:21,262 INFO L226 Difference]: Without dead ends: 1665 [2024-10-11 16:20:21,264 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-11 16:20:21,264 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:21,264 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.6s Time] [2024-10-11 16:20:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2024-10-11 16:20:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2024-10-11 16:20:21,425 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-11 16:20:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2285 transitions. [2024-10-11 16:20:21,432 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2285 transitions. Word has length 94 [2024-10-11 16:20:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:21,432 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2285 transitions. [2024-10-11 16:20:21,432 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-11 16:20:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2285 transitions. [2024-10-11 16:20:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 16:20:21,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:21,434 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-11 16:20:21,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 16:20:21,434 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-11 16:20:21,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2008711655, now seen corresponding path program 1 times [2024-10-11 16:20:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:21,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776968640] [2024-10-11 16:20:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:20:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:20:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:20:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:20:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:20:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:20:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:20:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:20:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:20:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 16:20:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 16:20:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 16:20:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:21,857 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-11 16:20:21,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776968640] [2024-10-11 16:20:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776968640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:21,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:21,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034437134] [2024-10-11 16:20:21,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:21,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:21,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:21,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:21,860 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-11 16:20:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:23,647 INFO L93 Difference]: Finished difference Result 1665 states and 2285 transitions. [2024-10-11 16:20:23,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:23,648 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-11 16:20:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:23,656 INFO L225 Difference]: With dead ends: 1665 [2024-10-11 16:20:23,656 INFO L226 Difference]: Without dead ends: 1663 [2024-10-11 16:20:23,657 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-11 16:20:23,658 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1507 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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-11 16:20:23,658 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-11 16:20:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-10-11 16:20:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2024-10-11 16:20:23,768 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-11 16:20:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2283 transitions. [2024-10-11 16:20:23,775 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2283 transitions. Word has length 99 [2024-10-11 16:20:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2283 transitions. [2024-10-11 16:20:23,775 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-11 16:20:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2283 transitions. [2024-10-11 16:20:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 16:20:23,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:23,777 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-11 16:20:23,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 16:20:23,777 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-11 16:20:23,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1199055038, now seen corresponding path program 1 times [2024-10-11 16:20:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632295086] [2024-10-11 16:20:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:23,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:20:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:20:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:20:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:20:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:20:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:20:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:20:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:20:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:20:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 16:20:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 16:20:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 16:20:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 16:20:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:24,137 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-11 16:20:24,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:24,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632295086] [2024-10-11 16:20:24,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632295086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:24,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:24,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:24,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598704276] [2024-10-11 16:20:24,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:24,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:24,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:24,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:24,141 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-11 16:20:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:26,269 INFO L93 Difference]: Finished difference Result 1663 states and 2283 transitions. [2024-10-11 16:20:26,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:26,270 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-11 16:20:26,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:26,279 INFO L225 Difference]: With dead ends: 1663 [2024-10-11 16:20:26,279 INFO L226 Difference]: Without dead ends: 1661 [2024-10-11 16:20:26,280 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-11 16:20:26,281 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1501 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:26,281 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.8s Time] [2024-10-11 16:20:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-10-11 16:20:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1661. [2024-10-11 16:20:26,407 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-11 16:20:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2281 transitions. [2024-10-11 16:20:26,413 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2281 transitions. Word has length 104 [2024-10-11 16:20:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:26,414 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2281 transitions. [2024-10-11 16:20:26,414 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-11 16:20:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2281 transitions. [2024-10-11 16:20:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 16:20:26,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:26,416 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-11 16:20:26,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 16:20:26,416 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-11 16:20:26,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 98607650, now seen corresponding path program 1 times [2024-10-11 16:20:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042339294] [2024-10-11 16:20:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 16:20:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 16:20:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 16:20:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 16:20:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 16:20:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 16:20:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 16:20:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:26,762 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-11 16:20:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042339294] [2024-10-11 16:20:26,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042339294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:26,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:26,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:20:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256543908] [2024-10-11 16:20:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:26,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:20:26,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:26,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:20:26,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:20:26,764 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-11 16:20:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:29,691 INFO L93 Difference]: Finished difference Result 3378 states and 4666 transitions. [2024-10-11 16:20:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:29,692 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-11 16:20:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:29,700 INFO L225 Difference]: With dead ends: 3378 [2024-10-11 16:20:29,700 INFO L226 Difference]: Without dead ends: 1735 [2024-10-11 16:20:29,705 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-11 16:20:29,706 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-11 16:20:29,707 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-11 16:20:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2024-10-11 16:20:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1655. [2024-10-11 16:20:29,849 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-11 16:20:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2272 transitions. [2024-10-11 16:20:29,857 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2272 transitions. Word has length 121 [2024-10-11 16:20:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:29,858 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2272 transitions. [2024-10-11 16:20:29,858 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-11 16:20:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2272 transitions. [2024-10-11 16:20:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 16:20:29,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:29,860 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-11 16:20:29,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 16:20:29,860 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-11 16:20:29,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:29,861 INFO L85 PathProgramCache]: Analyzing trace with hash 37131002, now seen corresponding path program 1 times [2024-10-11 16:20:29,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:29,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090984428] [2024-10-11 16:20:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:29,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:20:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:20:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:20:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:20:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:20:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:20:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:20:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:20:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:20:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 16:20:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 16:20:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 16:20:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 16:20:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 16:20:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:30,184 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-11 16:20:30,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:30,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090984428] [2024-10-11 16:20:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090984428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:30,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:30,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:30,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771542851] [2024-10-11 16:20:30,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:30,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:30,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:30,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:30,188 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-11 16:20:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:32,367 INFO L93 Difference]: Finished difference Result 1655 states and 2272 transitions. [2024-10-11 16:20:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:20:32,368 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-11 16:20:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:32,375 INFO L225 Difference]: With dead ends: 1655 [2024-10-11 16:20:32,375 INFO L226 Difference]: Without dead ends: 1653 [2024-10-11 16:20:32,376 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-11 16:20:32,377 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 1490 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:32,377 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.9s Time] [2024-10-11 16:20:32,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-10-11 16:20:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2024-10-11 16:20:32,515 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-11 16:20:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2270 transitions. [2024-10-11 16:20:32,520 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2270 transitions. Word has length 109 [2024-10-11 16:20:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:32,521 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2270 transitions. [2024-10-11 16:20:32,521 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-11 16:20:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2270 transitions. [2024-10-11 16:20:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 16:20:32,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:32,523 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-11 16:20:32,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 16:20:32,523 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-11 16:20:32,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -324207322, now seen corresponding path program 1 times [2024-10-11 16:20:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038571638] [2024-10-11 16:20:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 16:20:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 16:20:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 16:20:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 16:20:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 16:20:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 16:20:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 16:20:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 16:20:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 16:20:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 16:20:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:32,942 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-11 16:20:32,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038571638] [2024-10-11 16:20:32,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038571638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:20:32,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033270732] [2024-10-11 16:20:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:32,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:20:32,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:20:32,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:20:32,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 16:20:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:33,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 16:20:33,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:20:33,677 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-11 16:20:33,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:20:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033270732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:33,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:20:33,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-11 16:20:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137039741] [2024-10-11 16:20:33,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:33,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:20:33,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:33,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:20:33,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:20:33,679 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-11 16:20:33,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:20:33,993 INFO L93 Difference]: Finished difference Result 3282 states and 4505 transitions. [2024-10-11 16:20:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:20:33,994 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-11 16:20:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:20:34,002 INFO L225 Difference]: With dead ends: 3282 [2024-10-11 16:20:34,003 INFO L226 Difference]: Without dead ends: 1647 [2024-10-11 16:20:34,008 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-11 16:20:34,009 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:20:34,009 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.2s Time] [2024-10-11 16:20:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-10-11 16:20:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2024-10-11 16:20:34,148 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-11 16:20:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2261 transitions. [2024-10-11 16:20:34,155 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2261 transitions. Word has length 126 [2024-10-11 16:20:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:20:34,155 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2261 transitions. [2024-10-11 16:20:34,156 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-11 16:20:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2261 transitions. [2024-10-11 16:20:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 16:20:34,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:20:34,158 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-11 16:20:34,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 16:20:34,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:20:34,359 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-11 16:20:34,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:20:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2093124221, now seen corresponding path program 1 times [2024-10-11 16:20:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:20:34,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848684462] [2024-10-11 16:20:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:20:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:20:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 16:20:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 16:20:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 16:20:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 16:20:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 16:20:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 16:20:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 16:20:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 16:20:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 16:20:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 16:20:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 16:20:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:20:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:20:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:20:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 16:20:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 16:20:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 16:20:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 16:20:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 16:20:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 16:20:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 16:20:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:20:34,736 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-11 16:20:34,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:20:34,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848684462] [2024-10-11 16:20:34,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848684462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:20:34,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:20:34,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:20:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213399301] [2024-10-11 16:20:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:20:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:20:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:20:34,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:20:34,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:20:34,738 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)