./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:54:57,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:54:57,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 05:54:57,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:54:57,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:54:57,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:54:57,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:54:57,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:54:57,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:54:57,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:54:57,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:54:57,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:54:57,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:54:57,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:54:57,408 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:54:57,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:54:57,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:54:57,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:54:57,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:54:57,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:54:57,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:54:57,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:54:57,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:54:57,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:54:57,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:54:57,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:54:57,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:54:57,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:54:57,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:54:57,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:54:57,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:54:57,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:54:57,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:54:57,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:54:57,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:54:57,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:54:57,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:54:57,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:54:57,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:54:57,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:54:57,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 [2025-03-04 05:54:57,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:54:57,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:54:57,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:54:57,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:54:57,782 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:54:57,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2025-03-04 05:54:58,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3e1538bf/b7cb7544da7a49738d6368810162fb30/FLAG8d41a8f9f [2025-03-04 05:54:59,436 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:54:59,437 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 [2025-03-04 05:54:59,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3e1538bf/b7cb7544da7a49738d6368810162fb30/FLAG8d41a8f9f [2025-03-04 05:54:59,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3e1538bf/b7cb7544da7a49738d6368810162fb30 [2025-03-04 05:54:59,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:54:59,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:54:59,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:54:59,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:54:59,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:54:59,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:54:59" (1/1) ... [2025-03-04 05:54:59,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5740a7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:54:59, skipping insertion in model container [2025-03-04 05:54:59,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:54:59" (1/1) ... [2025-03-04 05:54:59,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:55:02,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:55:02,440 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:55:02,490 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] [2025-03-04 05:55:02,491 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] [2025-03-04 05:55:02,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2025-03-04 05:55:02,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:55:02,766 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:55:02,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02 WrapperNode [2025-03-04 05:55:02,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:55:02,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:55:02,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:55:02,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:55:02,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:02,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:02,907 INFO L138 Inliner]: procedures = 570, calls = 1770, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2609 [2025-03-04 05:55:02,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:55:02,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:55:02,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:55:02,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:55:02,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:02,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:02,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:03,245 INFO L175 MemorySlicer]: Split 367 memory accesses to 20 slices as follows [2, 8, 8, 8, 8, 9, 8, 8, 8, 264, 8, 8, 6, 2, 2, 2, 1, 1, 5, 1]. 72 percent of accesses are in the largest equivalence class. The 107 initializations are split as follows [2, 8, 8, 8, 8, 8, 8, 8, 8, 14, 8, 8, 4, 0, 0, 0, 0, 1, 5, 1]. The 114 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 112, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0]. [2025-03-04 05:55:03,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:03,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:03,307 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:03,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:03,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:03,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:03,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:55:03,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:55:03,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:55:03,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:55:03,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (1/1) ... [2025-03-04 05:55:03,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:55:03,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:55:03,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:55:03,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:55:03,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-03-04 05:55:03,434 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 05:55:03,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-04 05:55:03,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-03-04 05:55:03,435 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-04 05:55:03,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-04 05:55:03,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:55:03,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:55:03,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:55:03,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:55:03,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 05:55:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:55:03,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 05:55:03,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 05:55:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:55:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:55:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2025-03-04 05:55:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:55:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-03-04 05:55:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-04 05:55:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:55:03,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 05:55:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 05:55:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-04 05:55:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-04 05:55:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 05:55:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:55:03,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 05:55:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 05:55:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2025-03-04 05:55:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-03-04 05:55:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 05:55:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 05:55:03,446 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 05:55:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:55:03,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 05:55:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2025-03-04 05:55:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:55:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 05:55:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:55:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-04 05:55:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-04 05:55:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:55:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2025-03-04 05:55:03,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 05:55:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 05:55:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 05:55:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 05:55:03,937 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:55:03,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:55:03,965 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 05:55:04,056 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12667: havoc #t~nondet966; [2025-03-04 05:55:04,194 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4342: havoc #t~mem97.base, #t~mem97.offset; [2025-03-04 05:55:04,262 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12717: havoc #t~nondet971; [2025-03-04 05:55:04,307 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4199: havoc arch_irqs_disabled_flags_#t~bitwise27#1; [2025-03-04 05:55:04,421 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4291: havoc dev_get_drvdata_#t~mem59#1.base, dev_get_drvdata_#t~mem59#1.offset; [2025-03-04 05:55:04,538 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12629: havoc __phys_addr_#t~nondet964#1; [2025-03-04 05:55:04,637 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6100: call ULTIMATE.dealloc(ca91cx42_dma_list_exec_~#__wait~1#1.base, ca91cx42_dma_list_exec_~#__wait~1#1.offset);havoc ca91cx42_dma_list_exec_~#__wait~1#1.base, ca91cx42_dma_list_exec_~#__wait~1#1.offset; [2025-03-04 05:55:04,637 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4155: havoc list_empty_#t~mem16#1.base, list_empty_#t~mem16#1.offset; [2025-03-04 05:55:09,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7930-1: ldv___pci_register_driver_138_#res#1 := ldv___pci_register_driver_138_~ldv_func_res~1#1; [2025-03-04 05:55:09,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12625: havoc __pci_register_driver_#t~nondet963#1; [2025-03-04 05:55:09,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12725: havoc request_threaded_irq_#t~nondet973#1; [2025-03-04 05:55:09,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7638-1: ldv_request_irq_96_#res#1 := ldv_request_irq_96_~ldv_func_res~0#1; [2025-03-04 05:55:09,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7411-1: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2025-03-04 05:55:09,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7411: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2025-03-04 05:55:09,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7411-2: call ULTIMATE.dealloc(ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset);havoc ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.base, ldv_pci_pci_instance_1_~#ldv_1_resource_pm_message~0#1.offset; [2025-03-04 05:55:09,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4807: call ULTIMATE.dealloc(ca91cx42_irq_init_~#__key~0#1.base, ca91cx42_irq_init_~#__key~0#1.offset);havoc ca91cx42_irq_init_~#__key~0#1.base, ca91cx42_irq_init_~#__key~0#1.offset; [2025-03-04 05:55:09,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12703: havoc pci_enable_device_#t~nondet969#1; [2025-03-04 05:55:09,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7385: call ULTIMATE.dealloc(ldv_pci_instance_suspend_1_8_~#arg2#1.base, ldv_pci_instance_suspend_1_8_~#arg2#1.offset);havoc ldv_pci_instance_suspend_1_8_~#arg2#1.base, ldv_pci_instance_suspend_1_8_~#arg2#1.offset; [2025-03-04 05:55:09,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12738: havoc vme_register_bridge_#t~nondet974#1; [2025-03-04 05:55:09,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7586-1: ldv_request_irq_#res#1 := ldv_request_irq_~arg0#1; [2025-03-04 05:55:09,578 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12710: havoc pci_request_regions_#t~nondet970#1; [2025-03-04 05:55:09,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6569: call ULTIMATE.dealloc(ca91cx42_probe_~#__key~1#1.base, ca91cx42_probe_~#__key~1#1.offset);havoc ca91cx42_probe_~#__key~1#1.base, ca91cx42_probe_~#__key~1#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___0~0#1.base, ca91cx42_probe_~#__key___0~0#1.offset);havoc ca91cx42_probe_~#__key___0~0#1.base, ca91cx42_probe_~#__key___0~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___1~0#1.base, ca91cx42_probe_~#__key___1~0#1.offset);havoc ca91cx42_probe_~#__key___1~0#1.base, ca91cx42_probe_~#__key___1~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___2~0#1.base, ca91cx42_probe_~#__key___2~0#1.offset);havoc ca91cx42_probe_~#__key___2~0#1.base, ca91cx42_probe_~#__key___2~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___3~0#1.base, ca91cx42_probe_~#__key___3~0#1.offset);havoc ca91cx42_probe_~#__key___3~0#1.base, ca91cx42_probe_~#__key___3~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___4~0#1.base, ca91cx42_probe_~#__key___4~0#1.offset);havoc ca91cx42_probe_~#__key___4~0#1.base, ca91cx42_probe_~#__key___4~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___5~0#1.base, ca91cx42_probe_~#__key___5~0#1.offset);havoc ca91cx42_probe_~#__key___5~0#1.base, ca91cx42_probe_~#__key___5~0#1.offset;call ULTIMATE.dealloc(ca91cx42_probe_~#__key___6~0#1.base, ca91cx42_probe_~#__key___6~0#1.offset);havoc ca91cx42_probe_~#__key___6~0#1.base, ca91cx42_probe_~#__key___6~0#1.offset; [2025-03-04 05:55:09,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7396: call ULTIMATE.dealloc(ldv_pci_instance_suspend_late_1_7_~#arg2#1.base, ldv_pci_instance_suspend_late_1_7_~#arg2#1.offset);havoc ldv_pci_instance_suspend_late_1_7_~#arg2#1.base, ldv_pci_instance_suspend_late_1_7_~#arg2#1.offset; [2025-03-04 05:55:09,582 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7169-1: ldv___pci_register_driver_#res#1 := ldv___pci_register_driver_~arg0#1; [2025-03-04 05:55:09,934 INFO L? ?]: Removed 1235 outVars from TransFormulas that were not future-live. [2025-03-04 05:55:09,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:55:09,981 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:55:09,986 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 05:55:09,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:55:09 BoogieIcfgContainer [2025-03-04 05:55:09,986 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:55:09,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:55:09,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:55:09,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:55:09,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:54:59" (1/3) ... [2025-03-04 05:55:09,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671fc587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:55:09, skipping insertion in model container [2025-03-04 05:55:09,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:02" (2/3) ... [2025-03-04 05:55:09,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671fc587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:55:09, skipping insertion in model container [2025-03-04 05:55:09,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:55:09" (3/3) ... [2025-03-04 05:55:09,995 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2025-03-04 05:55:10,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:55:10,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i that has 95 procedures, 1169 locations, 1 initial locations, 21 loop locations, and 28 error locations. [2025-03-04 05:55:10,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:55:10,085 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;@3c5d9197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:55:10,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 05:55:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 1092 states, 717 states have (on average 1.2733612273361228) internal successors, (913), 760 states have internal predecessors, (913), 272 states have call successors, (272), 75 states have call predecessors, (272), 74 states have return successors, (269), 266 states have call predecessors, (269), 269 states have call successors, (269) [2025-03-04 05:55:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 05:55:10,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:10,100 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:10,100 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)] === [2025-03-04 05:55:10,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1667640861, now seen corresponding path program 1 times [2025-03-04 05:55:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:10,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517007870] [2025-03-04 05:55:10,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:10,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 05:55:10,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 05:55:10,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:10,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:11,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:11,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517007870] [2025-03-04 05:55:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517007870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:11,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:11,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522182579] [2025-03-04 05:55:11,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:11,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:11,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:11,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:11,144 INFO L87 Difference]: Start difference. First operand has 1092 states, 717 states have (on average 1.2733612273361228) internal successors, (913), 760 states have internal predecessors, (913), 272 states have call successors, (272), 75 states have call predecessors, (272), 74 states have return successors, (269), 266 states have call predecessors, (269), 269 states have call successors, (269) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 05:55:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:11,566 INFO L93 Difference]: Finished difference Result 3204 states and 4406 transitions. [2025-03-04 05:55:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:11,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-04 05:55:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:11,593 INFO L225 Difference]: With dead ends: 3204 [2025-03-04 05:55:11,594 INFO L226 Difference]: Without dead ends: 2118 [2025-03-04 05:55:11,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:11,603 INFO L435 NwaCegarLoop]: 1695 mSDtfsCounter, 1369 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 4744 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:11,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 4744 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:55:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2025-03-04 05:55:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1924. [2025-03-04 05:55:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1284 states have (on average 1.2344236760124612) internal successors, (1585), 1344 states have internal predecessors, (1585), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2558 transitions. [2025-03-04 05:55:11,785 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2558 transitions. Word has length 64 [2025-03-04 05:55:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:11,785 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2558 transitions. [2025-03-04 05:55:11,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 05:55:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2558 transitions. [2025-03-04 05:55:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 05:55:11,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:11,790 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:11,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:55:11,791 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)] === [2025-03-04 05:55:11,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1587355676, now seen corresponding path program 1 times [2025-03-04 05:55:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736058701] [2025-03-04 05:55:11,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:12,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 05:55:12,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 05:55:12,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:12,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:12,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:12,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736058701] [2025-03-04 05:55:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736058701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:12,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:12,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63922293] [2025-03-04 05:55:12,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:12,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:12,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:12,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:12,452 INFO L87 Difference]: Start difference. First operand 1924 states and 2558 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 05:55:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:12,617 INFO L93 Difference]: Finished difference Result 1924 states and 2558 transitions. [2025-03-04 05:55:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:12,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2025-03-04 05:55:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:12,630 INFO L225 Difference]: With dead ends: 1924 [2025-03-04 05:55:12,630 INFO L226 Difference]: Without dead ends: 1922 [2025-03-04 05:55:12,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:12,632 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 1374 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:12,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2745 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-03-04 05:55:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2025-03-04 05:55:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1283 states have (on average 1.2338269680436478) internal successors, (1583), 1342 states have internal predecessors, (1583), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2556 transitions. [2025-03-04 05:55:12,738 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2556 transitions. Word has length 70 [2025-03-04 05:55:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:12,738 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2556 transitions. [2025-03-04 05:55:12,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 05:55:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2556 transitions. [2025-03-04 05:55:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 05:55:12,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:12,740 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:12,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:55:12,741 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)] === [2025-03-04 05:55:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash 417504983, now seen corresponding path program 1 times [2025-03-04 05:55:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:12,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614112936] [2025-03-04 05:55:12,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:12,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 05:55:12,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 05:55:12,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:12,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:13,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:13,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614112936] [2025-03-04 05:55:13,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614112936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:13,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:13,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092839728] [2025-03-04 05:55:13,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:13,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:13,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:13,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:13,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:13,252 INFO L87 Difference]: Start difference. First operand 1922 states and 2556 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 05:55:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:13,409 INFO L93 Difference]: Finished difference Result 1922 states and 2556 transitions. [2025-03-04 05:55:13,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:13,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-03-04 05:55:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:13,421 INFO L225 Difference]: With dead ends: 1922 [2025-03-04 05:55:13,422 INFO L226 Difference]: Without dead ends: 1920 [2025-03-04 05:55:13,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:13,424 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1371 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:13,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 2741 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-03-04 05:55:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1920. [2025-03-04 05:55:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1282 states have (on average 1.2332293291731669) internal successors, (1581), 1340 states have internal predecessors, (1581), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2554 transitions. [2025-03-04 05:55:13,521 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2554 transitions. Word has length 76 [2025-03-04 05:55:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:13,522 INFO L471 AbstractCegarLoop]: Abstraction has 1920 states and 2554 transitions. [2025-03-04 05:55:13,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 05:55:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2554 transitions. [2025-03-04 05:55:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 05:55:13,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:13,525 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:55:13,525 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)] === [2025-03-04 05:55:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash -536021917, now seen corresponding path program 1 times [2025-03-04 05:55:13,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:13,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402245872] [2025-03-04 05:55:13,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:13,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:13,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 05:55:13,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 05:55:13,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:13,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402245872] [2025-03-04 05:55:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402245872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:14,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293511804] [2025-03-04 05:55:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:14,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:14,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:14,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:14,021 INFO L87 Difference]: Start difference. First operand 1920 states and 2554 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 05:55:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:14,194 INFO L93 Difference]: Finished difference Result 1920 states and 2554 transitions. [2025-03-04 05:55:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:14,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-03-04 05:55:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:14,203 INFO L225 Difference]: With dead ends: 1920 [2025-03-04 05:55:14,203 INFO L226 Difference]: Without dead ends: 1918 [2025-03-04 05:55:14,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:14,204 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 1368 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:14,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 2737 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2025-03-04 05:55:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1918. [2025-03-04 05:55:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1281 states have (on average 1.2326307572209212) internal successors, (1579), 1338 states have internal predecessors, (1579), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2552 transitions. [2025-03-04 05:55:14,303 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2552 transitions. Word has length 82 [2025-03-04 05:55:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:14,303 INFO L471 AbstractCegarLoop]: Abstraction has 1918 states and 2552 transitions. [2025-03-04 05:55:14,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 05:55:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2552 transitions. [2025-03-04 05:55:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 05:55:14,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:14,305 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:14,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:55:14,305 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)] === [2025-03-04 05:55:14,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash -815204445, now seen corresponding path program 1 times [2025-03-04 05:55:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:14,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445995462] [2025-03-04 05:55:14,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:14,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 05:55:14,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 05:55:14,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:14,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:14,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445995462] [2025-03-04 05:55:14,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445995462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:14,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:14,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182095861] [2025-03-04 05:55:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:14,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:14,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:14,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:14,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:14,816 INFO L87 Difference]: Start difference. First operand 1918 states and 2552 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:55:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:14,975 INFO L93 Difference]: Finished difference Result 1918 states and 2552 transitions. [2025-03-04 05:55:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:14,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2025-03-04 05:55:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:14,987 INFO L225 Difference]: With dead ends: 1918 [2025-03-04 05:55:14,987 INFO L226 Difference]: Without dead ends: 1916 [2025-03-04 05:55:14,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:14,989 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1365 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:14,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 2733 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-04 05:55:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2025-03-04 05:55:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1280 states have (on average 1.23203125) internal successors, (1577), 1336 states have internal predecessors, (1577), 487 states have call successors, (487), 128 states have call predecessors, (487), 125 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2550 transitions. [2025-03-04 05:55:15,081 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2550 transitions. Word has length 88 [2025-03-04 05:55:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:15,082 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2550 transitions. [2025-03-04 05:55:15,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:55:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2550 transitions. [2025-03-04 05:55:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 05:55:15,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:15,083 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:55:15,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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)] === [2025-03-04 05:55:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 478164675, now seen corresponding path program 1 times [2025-03-04 05:55:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799486633] [2025-03-04 05:55:15,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:15,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 05:55:15,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 05:55:15,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:15,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:55:16,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:16,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799486633] [2025-03-04 05:55:16,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799486633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:16,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:16,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:55:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638026992] [2025-03-04 05:55:16,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:16,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:55:16,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:16,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:55:16,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:55:16,323 INFO L87 Difference]: Start difference. First operand 1916 states and 2550 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:55:20,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:55:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:21,855 INFO L93 Difference]: Finished difference Result 3835 states and 5103 transitions. [2025-03-04 05:55:21,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:55:21,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 2 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 116 [2025-03-04 05:55:21,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:21,866 INFO L225 Difference]: With dead ends: 3835 [2025-03-04 05:55:21,866 INFO L226 Difference]: Without dead ends: 1940 [2025-03-04 05:55:21,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:55:21,873 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1164 mSDsluCounter, 3765 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 5132 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:21,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 5132 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 663 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-03-04 05:55:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2025-03-04 05:55:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1940. [2025-03-04 05:55:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1296 states have (on average 1.2276234567901234) internal successors, (1591), 1352 states have internal predecessors, (1591), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2564 transitions. [2025-03-04 05:55:22,003 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2564 transitions. Word has length 116 [2025-03-04 05:55:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:22,003 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 2564 transitions. [2025-03-04 05:55:22,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:55:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2564 transitions. [2025-03-04 05:55:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 05:55:22,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:22,006 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:22,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 05:55:22,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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)] === [2025-03-04 05:55:22,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash 478194466, now seen corresponding path program 1 times [2025-03-04 05:55:22,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:22,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776754341] [2025-03-04 05:55:22,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:22,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:22,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 05:55:22,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 05:55:22,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:22,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:55:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776754341] [2025-03-04 05:55:22,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776754341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:22,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:22,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:22,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351444097] [2025-03-04 05:55:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:22,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:22,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:22,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:22,581 INFO L87 Difference]: Start difference. First operand 1940 states and 2564 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 05:55:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:22,767 INFO L93 Difference]: Finished difference Result 1940 states and 2564 transitions. [2025-03-04 05:55:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:22,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 1 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 116 [2025-03-04 05:55:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:22,777 INFO L225 Difference]: With dead ends: 1940 [2025-03-04 05:55:22,777 INFO L226 Difference]: Without dead ends: 1938 [2025-03-04 05:55:22,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:22,779 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 0 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4088 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:22,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4088 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-03-04 05:55:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2025-03-04 05:55:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1295 states have (on average 1.2262548262548263) internal successors, (1588), 1350 states have internal predecessors, (1588), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2561 transitions. [2025-03-04 05:55:22,885 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2561 transitions. Word has length 116 [2025-03-04 05:55:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:22,885 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 2561 transitions. [2025-03-04 05:55:22,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 05:55:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2561 transitions. [2025-03-04 05:55:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 05:55:22,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:22,887 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:22,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:55:22,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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)] === [2025-03-04 05:55:22,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2132427411, now seen corresponding path program 1 times [2025-03-04 05:55:22,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:22,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578646637] [2025-03-04 05:55:22,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:23,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 05:55:23,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 05:55:23,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:23,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:23,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578646637] [2025-03-04 05:55:23,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578646637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:23,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:23,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609365375] [2025-03-04 05:55:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:23,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:23,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:23,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:23,372 INFO L87 Difference]: Start difference. First operand 1938 states and 2561 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:55:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:23,540 INFO L93 Difference]: Finished difference Result 1938 states and 2561 transitions. [2025-03-04 05:55:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:23,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2025-03-04 05:55:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:23,551 INFO L225 Difference]: With dead ends: 1938 [2025-03-04 05:55:23,551 INFO L226 Difference]: Without dead ends: 1936 [2025-03-04 05:55:23,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:23,554 INFO L435 NwaCegarLoop]: 1362 mSDtfsCounter, 1359 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:23,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 2723 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2025-03-04 05:55:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1936. [2025-03-04 05:55:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1294 states have (on average 1.2256568778979908) internal successors, (1586), 1348 states have internal predecessors, (1586), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2559 transitions. [2025-03-04 05:55:23,676 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2559 transitions. Word has length 94 [2025-03-04 05:55:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:23,676 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2559 transitions. [2025-03-04 05:55:23,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:55:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2559 transitions. [2025-03-04 05:55:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 05:55:23,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:23,679 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:23,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:55:23,679 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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)] === [2025-03-04 05:55:23,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1243942075, now seen corresponding path program 1 times [2025-03-04 05:55:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:23,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779762814] [2025-03-04 05:55:23,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:23,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 05:55:23,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 05:55:23,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:23,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:55:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779762814] [2025-03-04 05:55:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779762814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:24,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:24,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:55:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193711598] [2025-03-04 05:55:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:24,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:55:24,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:24,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:55:24,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:55:24,084 INFO L87 Difference]: Start difference. First operand 1936 states and 2559 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:55:24,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:24,245 INFO L93 Difference]: Finished difference Result 3845 states and 5098 transitions. [2025-03-04 05:55:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:55:24,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 2 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 120 [2025-03-04 05:55:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:24,256 INFO L225 Difference]: With dead ends: 3845 [2025-03-04 05:55:24,257 INFO L226 Difference]: Without dead ends: 1930 [2025-03-04 05:55:24,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:55:24,266 INFO L435 NwaCegarLoop]: 1358 mSDtfsCounter, 1350 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:24,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 1358 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:55:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2025-03-04 05:55:24,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2025-03-04 05:55:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1289 states have (on average 1.2234290147401086) internal successors, (1577), 1342 states have internal predecessors, (1577), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2550 transitions. [2025-03-04 05:55:24,387 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2550 transitions. Word has length 120 [2025-03-04 05:55:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:24,388 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 2550 transitions. [2025-03-04 05:55:24,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:55:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2550 transitions. [2025-03-04 05:55:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 05:55:24,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:24,390 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:24,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 05:55:24,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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)] === [2025-03-04 05:55:24,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2132797160, now seen corresponding path program 1 times [2025-03-04 05:55:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085407800] [2025-03-04 05:55:24,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:24,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 05:55:24,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 05:55:24,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:24,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085407800] [2025-03-04 05:55:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085407800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:24,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600540101] [2025-03-04 05:55:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:24,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:24,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:24,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:24,791 INFO L87 Difference]: Start difference. First operand 1930 states and 2550 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:55:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:24,950 INFO L93 Difference]: Finished difference Result 1930 states and 2550 transitions. [2025-03-04 05:55:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-04 05:55:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:24,959 INFO L225 Difference]: With dead ends: 1930 [2025-03-04 05:55:24,959 INFO L226 Difference]: Without dead ends: 1928 [2025-03-04 05:55:24,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:24,961 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 1351 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:24,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 2709 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-03-04 05:55:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928. [2025-03-04 05:55:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1288 states have (on average 1.2228260869565217) internal successors, (1575), 1340 states have internal predecessors, (1575), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2548 transitions. [2025-03-04 05:55:25,070 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2548 transitions. Word has length 100 [2025-03-04 05:55:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:25,071 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2548 transitions. [2025-03-04 05:55:25,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:55:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2548 transitions. [2025-03-04 05:55:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 05:55:25,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:25,073 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:25,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:55:25,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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)] === [2025-03-04 05:55:25,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:25,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1675762637, now seen corresponding path program 1 times [2025-03-04 05:55:25,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:25,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020214375] [2025-03-04 05:55:25,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:25,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 05:55:25,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 05:55:25,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:25,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:25,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:25,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020214375] [2025-03-04 05:55:25,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020214375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:25,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:25,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:25,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884987784] [2025-03-04 05:55:25,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:25,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:25,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:25,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:25,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:25,690 INFO L87 Difference]: Start difference. First operand 1928 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:55:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:25,998 INFO L93 Difference]: Finished difference Result 1928 states and 2548 transitions. [2025-03-04 05:55:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:25,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-03-04 05:55:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:26,012 INFO L225 Difference]: With dead ends: 1928 [2025-03-04 05:55:26,013 INFO L226 Difference]: Without dead ends: 1926 [2025-03-04 05:55:26,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:26,014 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 1348 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:26,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 2705 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2025-03-04 05:55:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1926. [2025-03-04 05:55:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1287 states have (on average 1.2222222222222223) internal successors, (1573), 1338 states have internal predecessors, (1573), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2546 transitions. [2025-03-04 05:55:26,157 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2546 transitions. Word has length 106 [2025-03-04 05:55:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:26,159 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2546 transitions. [2025-03-04 05:55:26,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:55:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2546 transitions. [2025-03-04 05:55:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 05:55:26,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:26,160 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:26,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 05:55:26,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 05:55:26,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash 204878638, now seen corresponding path program 1 times [2025-03-04 05:55:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:26,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878324944] [2025-03-04 05:55:26,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:26,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 05:55:26,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 05:55:26,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:26,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:26,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878324944] [2025-03-04 05:55:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878324944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:26,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:26,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808446965] [2025-03-04 05:55:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:26,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:26,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:26,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:26,577 INFO L87 Difference]: Start difference. First operand 1926 states and 2546 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:55:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:26,761 INFO L93 Difference]: Finished difference Result 1926 states and 2546 transitions. [2025-03-04 05:55:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:26,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2025-03-04 05:55:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:26,771 INFO L225 Difference]: With dead ends: 1926 [2025-03-04 05:55:26,772 INFO L226 Difference]: Without dead ends: 1924 [2025-03-04 05:55:26,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:26,772 INFO L435 NwaCegarLoop]: 1351 mSDtfsCounter, 1344 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:26,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 2701 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2025-03-04 05:55:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1924. [2025-03-04 05:55:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1286 states have (on average 1.2216174183514774) internal successors, (1571), 1336 states have internal predecessors, (1571), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2544 transitions. [2025-03-04 05:55:26,871 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2544 transitions. Word has length 108 [2025-03-04 05:55:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:26,871 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2544 transitions. [2025-03-04 05:55:26,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:55:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2544 transitions. [2025-03-04 05:55:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 05:55:26,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:26,873 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:26,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 05:55:26,874 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)] === [2025-03-04 05:55:26,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash 930384464, now seen corresponding path program 1 times [2025-03-04 05:55:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768240981] [2025-03-04 05:55:26,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:27,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 05:55:27,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 05:55:27,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:27,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768240981] [2025-03-04 05:55:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768240981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:27,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271107226] [2025-03-04 05:55:27,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:27,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:27,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:27,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:27,461 INFO L87 Difference]: Start difference. First operand 1924 states and 2544 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 05:55:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:27,675 INFO L93 Difference]: Finished difference Result 1924 states and 2544 transitions. [2025-03-04 05:55:27,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:27,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2025-03-04 05:55:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:27,683 INFO L225 Difference]: With dead ends: 1924 [2025-03-04 05:55:27,683 INFO L226 Difference]: Without dead ends: 1922 [2025-03-04 05:55:27,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:27,684 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 1343 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:27,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 2697 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:27,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-03-04 05:55:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2025-03-04 05:55:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1285 states have (on average 1.221011673151751) internal successors, (1569), 1334 states have internal predecessors, (1569), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2542 transitions. [2025-03-04 05:55:27,796 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2542 transitions. Word has length 114 [2025-03-04 05:55:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:27,796 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2542 transitions. [2025-03-04 05:55:27,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 05:55:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2542 transitions. [2025-03-04 05:55:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 05:55:27,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:27,799 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:27,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:55:27,799 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)] === [2025-03-04 05:55:27,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash 343842681, now seen corresponding path program 1 times [2025-03-04 05:55:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:27,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874970826] [2025-03-04 05:55:27,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:28,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 05:55:28,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 05:55:28,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:28,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:28,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:28,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874970826] [2025-03-04 05:55:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874970826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:28,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:28,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:28,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858389116] [2025-03-04 05:55:28,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:28,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:28,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:28,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:28,312 INFO L87 Difference]: Start difference. First operand 1922 states and 2542 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:55:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:28,495 INFO L93 Difference]: Finished difference Result 1922 states and 2542 transitions. [2025-03-04 05:55:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2025-03-04 05:55:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:28,510 INFO L225 Difference]: With dead ends: 1922 [2025-03-04 05:55:28,513 INFO L226 Difference]: Without dead ends: 1920 [2025-03-04 05:55:28,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:28,515 INFO L435 NwaCegarLoop]: 1347 mSDtfsCounter, 1340 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:28,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 2693 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2025-03-04 05:55:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1920. [2025-03-04 05:55:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1284 states have (on average 1.220404984423676) internal successors, (1567), 1332 states have internal predecessors, (1567), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2540 transitions. [2025-03-04 05:55:28,624 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2540 transitions. Word has length 120 [2025-03-04 05:55:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:28,625 INFO L471 AbstractCegarLoop]: Abstraction has 1920 states and 2540 transitions. [2025-03-04 05:55:28,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:55:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2540 transitions. [2025-03-04 05:55:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 05:55:28,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:28,627 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:28,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:55:28,627 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)] === [2025-03-04 05:55:28,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash 53490328, now seen corresponding path program 1 times [2025-03-04 05:55:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:28,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26757470] [2025-03-04 05:55:28,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:28,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 05:55:28,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 05:55:28,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:28,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:29,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26757470] [2025-03-04 05:55:29,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26757470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:29,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:29,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:29,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356963897] [2025-03-04 05:55:29,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:29,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:29,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:29,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:29,124 INFO L87 Difference]: Start difference. First operand 1920 states and 2540 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:55:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:29,319 INFO L93 Difference]: Finished difference Result 1920 states and 2540 transitions. [2025-03-04 05:55:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:29,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2025-03-04 05:55:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:29,333 INFO L225 Difference]: With dead ends: 1920 [2025-03-04 05:55:29,333 INFO L226 Difference]: Without dead ends: 1918 [2025-03-04 05:55:29,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:29,336 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 1337 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:29,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 2689 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2025-03-04 05:55:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1918. [2025-03-04 05:55:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1283 states have (on average 1.2197973499610288) internal successors, (1565), 1330 states have internal predecessors, (1565), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2538 transitions. [2025-03-04 05:55:29,446 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2538 transitions. Word has length 126 [2025-03-04 05:55:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:29,446 INFO L471 AbstractCegarLoop]: Abstraction has 1918 states and 2538 transitions. [2025-03-04 05:55:29,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:55:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2538 transitions. [2025-03-04 05:55:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 05:55:29,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:29,448 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:29,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:55:29,448 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)] === [2025-03-04 05:55:29,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash 996411755, now seen corresponding path program 1 times [2025-03-04 05:55:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:29,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138449731] [2025-03-04 05:55:29,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 05:55:29,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 05:55:29,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:29,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:29,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:29,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138449731] [2025-03-04 05:55:29,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138449731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:29,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:29,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804271010] [2025-03-04 05:55:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:29,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:29,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:29,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:29,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:29,862 INFO L87 Difference]: Start difference. First operand 1918 states and 2538 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 05:55:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:30,055 INFO L93 Difference]: Finished difference Result 1918 states and 2538 transitions. [2025-03-04 05:55:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:30,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2025-03-04 05:55:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:30,062 INFO L225 Difference]: With dead ends: 1918 [2025-03-04 05:55:30,062 INFO L226 Difference]: Without dead ends: 1916 [2025-03-04 05:55:30,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:30,063 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1334 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:30,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 2685 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-04 05:55:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2025-03-04 05:55:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1282 states have (on average 1.219188767550702) internal successors, (1563), 1328 states have internal predecessors, (1563), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2536 transitions. [2025-03-04 05:55:30,257 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2536 transitions. Word has length 132 [2025-03-04 05:55:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:30,258 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2536 transitions. [2025-03-04 05:55:30,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 05:55:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2536 transitions. [2025-03-04 05:55:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 05:55:30,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:30,260 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 05:55:30,261 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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)] === [2025-03-04 05:55:30,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1899052602, now seen corresponding path program 1 times [2025-03-04 05:55:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:30,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896784489] [2025-03-04 05:55:30,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:30,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 05:55:30,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 05:55:30,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:30,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 05:55:30,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896784489] [2025-03-04 05:55:30,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896784489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:30,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:30,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:55:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430717575] [2025-03-04 05:55:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:30,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:55:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:30,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:55:30,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:55:30,702 INFO L87 Difference]: Start difference. First operand 1916 states and 2536 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:55:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:30,880 INFO L93 Difference]: Finished difference Result 3805 states and 5034 transitions. [2025-03-04 05:55:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:55:30,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (19), 1 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 154 [2025-03-04 05:55:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:30,890 INFO L225 Difference]: With dead ends: 3805 [2025-03-04 05:55:30,890 INFO L226 Difference]: Without dead ends: 1910 [2025-03-04 05:55:30,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:55:30,896 INFO L435 NwaCegarLoop]: 1339 mSDtfsCounter, 1352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:30,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 1339 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2025-03-04 05:55:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1910. [2025-03-04 05:55:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1277 states have (on average 1.2169146436961629) internal successors, (1554), 1322 states have internal predecessors, (1554), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2527 transitions. [2025-03-04 05:55:31,044 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2527 transitions. Word has length 154 [2025-03-04 05:55:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:31,044 INFO L471 AbstractCegarLoop]: Abstraction has 1910 states and 2527 transitions. [2025-03-04 05:55:31,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:55:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2527 transitions. [2025-03-04 05:55:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 05:55:31,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:31,046 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:31,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 05:55:31,046 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)] === [2025-03-04 05:55:31,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash 207833989, now seen corresponding path program 1 times [2025-03-04 05:55:31,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:31,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770165466] [2025-03-04 05:55:31,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:31,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:31,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 05:55:31,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 05:55:31,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:31,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:31,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770165466] [2025-03-04 05:55:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770165466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:31,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:31,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213216459] [2025-03-04 05:55:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:31,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:31,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:31,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:31,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:31,453 INFO L87 Difference]: Start difference. First operand 1910 states and 2527 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:55:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:31,620 INFO L93 Difference]: Finished difference Result 1910 states and 2527 transitions. [2025-03-04 05:55:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:31,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2025-03-04 05:55:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:31,627 INFO L225 Difference]: With dead ends: 1910 [2025-03-04 05:55:31,628 INFO L226 Difference]: Without dead ends: 1908 [2025-03-04 05:55:31,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:31,629 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 1326 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:31,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 2671 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2025-03-04 05:55:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1908. [2025-03-04 05:55:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1276 states have (on average 1.2163009404388714) internal successors, (1552), 1320 states have internal predecessors, (1552), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2525 transitions. [2025-03-04 05:55:31,785 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2525 transitions. Word has length 138 [2025-03-04 05:55:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:31,786 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2525 transitions. [2025-03-04 05:55:31,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:55:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2525 transitions. [2025-03-04 05:55:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 05:55:31,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:31,788 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:31,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 05:55:31,788 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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)] === [2025-03-04 05:55:31,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:31,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1790619803, now seen corresponding path program 1 times [2025-03-04 05:55:31,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:31,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425999146] [2025-03-04 05:55:31,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:32,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 05:55:32,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 05:55:32,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:32,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-04 05:55:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425999146] [2025-03-04 05:55:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425999146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:55:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587360893] [2025-03-04 05:55:32,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:32,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:55:32,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:55:32,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:55:32,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:55:33,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 05:55:33,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 05:55:33,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:33,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:33,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1984 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 05:55:33,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:55:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 05:55:33,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:55:33,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587360893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:33,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:55:33,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-04 05:55:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714133925] [2025-03-04 05:55:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:33,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:55:33,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:33,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:55:33,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:55:33,365 INFO L87 Difference]: Start difference. First operand 1908 states and 2525 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2025-03-04 05:55:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:33,560 INFO L93 Difference]: Finished difference Result 3789 states and 5012 transitions. [2025-03-04 05:55:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:55:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 160 [2025-03-04 05:55:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:33,569 INFO L225 Difference]: With dead ends: 3789 [2025-03-04 05:55:33,570 INFO L226 Difference]: Without dead ends: 1902 [2025-03-04 05:55:33,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:55:33,575 INFO L435 NwaCegarLoop]: 1332 mSDtfsCounter, 1300 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:33,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 1332 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-03-04 05:55:33,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1902. [2025-03-04 05:55:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1271 states have (on average 1.2140047206923683) internal successors, (1543), 1314 states have internal predecessors, (1543), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2516 transitions. [2025-03-04 05:55:33,703 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2516 transitions. Word has length 160 [2025-03-04 05:55:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:33,704 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 2516 transitions. [2025-03-04 05:55:33,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2025-03-04 05:55:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2516 transitions. [2025-03-04 05:55:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 05:55:33,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:33,706 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:33,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 05:55:33,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:55:33,907 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)] === [2025-03-04 05:55:33,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:33,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1180983305, now seen corresponding path program 1 times [2025-03-04 05:55:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:33,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711754810] [2025-03-04 05:55:33,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:34,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 05:55:34,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 05:55:34,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:34,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:34,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:34,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711754810] [2025-03-04 05:55:34,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711754810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:34,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:34,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:34,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122438566] [2025-03-04 05:55:34,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:34,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:34,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:34,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:34,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:34,299 INFO L87 Difference]: Start difference. First operand 1902 states and 2516 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 05:55:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:34,504 INFO L93 Difference]: Finished difference Result 1902 states and 2516 transitions. [2025-03-04 05:55:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:34,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-03-04 05:55:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:34,512 INFO L225 Difference]: With dead ends: 1902 [2025-03-04 05:55:34,513 INFO L226 Difference]: Without dead ends: 1900 [2025-03-04 05:55:34,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:34,514 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 1318 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:34,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 2657 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2025-03-04 05:55:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1900. [2025-03-04 05:55:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1270 states have (on average 1.2133858267716535) internal successors, (1541), 1312 states have internal predecessors, (1541), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2514 transitions. [2025-03-04 05:55:34,645 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2514 transitions. Word has length 144 [2025-03-04 05:55:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:34,645 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2514 transitions. [2025-03-04 05:55:34,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 05:55:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2514 transitions. [2025-03-04 05:55:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 05:55:34,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:34,647 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:34,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 05:55:34,647 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 05:55:34,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1831045724, now seen corresponding path program 1 times [2025-03-04 05:55:34,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:34,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92135675] [2025-03-04 05:55:34,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:34,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:34,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 05:55:34,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 05:55:34,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:34,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:35,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:35,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92135675] [2025-03-04 05:55:35,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92135675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:35,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:35,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:35,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755058981] [2025-03-04 05:55:35,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:35,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:35,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:35,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:35,071 INFO L87 Difference]: Start difference. First operand 1900 states and 2514 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 05:55:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:35,260 INFO L93 Difference]: Finished difference Result 1900 states and 2514 transitions. [2025-03-04 05:55:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:35,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2025-03-04 05:55:35,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:35,268 INFO L225 Difference]: With dead ends: 1900 [2025-03-04 05:55:35,268 INFO L226 Difference]: Without dead ends: 1898 [2025-03-04 05:55:35,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:35,269 INFO L435 NwaCegarLoop]: 1327 mSDtfsCounter, 1315 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:35,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 2653 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-03-04 05:55:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2025-03-04 05:55:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1269 states have (on average 1.2127659574468086) internal successors, (1539), 1310 states have internal predecessors, (1539), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2512 transitions. [2025-03-04 05:55:35,413 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2512 transitions. Word has length 150 [2025-03-04 05:55:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:35,414 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2512 transitions. [2025-03-04 05:55:35,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 05:55:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2512 transitions. [2025-03-04 05:55:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 05:55:35,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:35,416 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:35,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 05:55:35,416 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_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)] === [2025-03-04 05:55:35,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1920474254, now seen corresponding path program 1 times [2025-03-04 05:55:35,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:35,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705699586] [2025-03-04 05:55:35,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:35,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:35,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 05:55:35,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 05:55:35,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:35,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:35,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705699586] [2025-03-04 05:55:35,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705699586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:35,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:35,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420432985] [2025-03-04 05:55:35,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:35,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:35,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:35,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:35,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:35,755 INFO L87 Difference]: Start difference. First operand 1898 states and 2512 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 05:55:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:35,998 INFO L93 Difference]: Finished difference Result 1898 states and 2512 transitions. [2025-03-04 05:55:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:35,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2025-03-04 05:55:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:36,005 INFO L225 Difference]: With dead ends: 1898 [2025-03-04 05:55:36,005 INFO L226 Difference]: Without dead ends: 1896 [2025-03-04 05:55:36,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:36,008 INFO L435 NwaCegarLoop]: 1325 mSDtfsCounter, 1312 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:36,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 2649 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2025-03-04 05:55:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2025-03-04 05:55:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1268 states have (on average 1.2121451104100947) internal successors, (1537), 1308 states have internal predecessors, (1537), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2510 transitions. [2025-03-04 05:55:36,286 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2510 transitions. Word has length 156 [2025-03-04 05:55:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:36,286 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2510 transitions. [2025-03-04 05:55:36,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 05:55:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2510 transitions. [2025-03-04 05:55:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 05:55:36,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:36,289 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:36,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 05:55:36,289 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_sock_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)] === [2025-03-04 05:55:36,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:36,290 INFO L85 PathProgramCache]: Analyzing trace with hash -182018461, now seen corresponding path program 1 times [2025-03-04 05:55:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:36,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322036556] [2025-03-04 05:55:36,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:36,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:36,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 05:55:36,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 05:55:36,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:36,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:36,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:36,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322036556] [2025-03-04 05:55:36,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322036556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:36,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:36,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94135335] [2025-03-04 05:55:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:36,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:36,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:36,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:36,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:36,716 INFO L87 Difference]: Start difference. First operand 1896 states and 2510 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 05:55:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:36,928 INFO L93 Difference]: Finished difference Result 1896 states and 2510 transitions. [2025-03-04 05:55:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:36,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2025-03-04 05:55:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:36,936 INFO L225 Difference]: With dead ends: 1896 [2025-03-04 05:55:36,937 INFO L226 Difference]: Without dead ends: 1894 [2025-03-04 05:55:36,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:36,938 INFO L435 NwaCegarLoop]: 1323 mSDtfsCounter, 1309 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:36,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 2645 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-03-04 05:55:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1894. [2025-03-04 05:55:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1267 states have (on average 1.2115232833464877) internal successors, (1535), 1306 states have internal predecessors, (1535), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2508 transitions. [2025-03-04 05:55:37,096 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2508 transitions. Word has length 162 [2025-03-04 05:55:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:37,097 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2508 transitions. [2025-03-04 05:55:37,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 05:55:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2508 transitions. [2025-03-04 05:55:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 05:55:37,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:37,100 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:37,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 05:55:37,100 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_coherent_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)] === [2025-03-04 05:55:37,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1078011449, now seen corresponding path program 1 times [2025-03-04 05:55:37,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:37,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239292556] [2025-03-04 05:55:37,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:37,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:37,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 05:55:37,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 05:55:37,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:37,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:37,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:37,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239292556] [2025-03-04 05:55:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239292556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:37,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:37,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:37,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034513534] [2025-03-04 05:55:37,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:37,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:37,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:37,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:37,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:37,491 INFO L87 Difference]: Start difference. First operand 1894 states and 2508 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 05:55:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:37,694 INFO L93 Difference]: Finished difference Result 1894 states and 2508 transitions. [2025-03-04 05:55:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:37,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2025-03-04 05:55:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:37,702 INFO L225 Difference]: With dead ends: 1894 [2025-03-04 05:55:37,702 INFO L226 Difference]: Without dead ends: 1892 [2025-03-04 05:55:37,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:37,704 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 1306 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:37,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 2641 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2025-03-04 05:55:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1892. [2025-03-04 05:55:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1266 states have (on average 1.2109004739336493) internal successors, (1533), 1304 states have internal predecessors, (1533), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2506 transitions. [2025-03-04 05:55:37,883 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2506 transitions. Word has length 168 [2025-03-04 05:55:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:37,884 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2506 transitions. [2025-03-04 05:55:37,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 05:55:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2506 transitions. [2025-03-04 05:55:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 05:55:37,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:37,888 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:37,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 05:55:37,888 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_gadget_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)] === [2025-03-04 05:55:37,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:37,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2018245669, now seen corresponding path program 1 times [2025-03-04 05:55:37,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:37,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486302654] [2025-03-04 05:55:37,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:38,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 05:55:38,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 05:55:38,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:38,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:38,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:38,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486302654] [2025-03-04 05:55:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486302654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:38,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817104023] [2025-03-04 05:55:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:38,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:38,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:38,239 INFO L87 Difference]: Start difference. First operand 1892 states and 2506 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-04 05:55:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:38,433 INFO L93 Difference]: Finished difference Result 1892 states and 2506 transitions. [2025-03-04 05:55:38,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:38,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2025-03-04 05:55:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:38,440 INFO L225 Difference]: With dead ends: 1892 [2025-03-04 05:55:38,440 INFO L226 Difference]: Without dead ends: 1890 [2025-03-04 05:55:38,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:38,441 INFO L435 NwaCegarLoop]: 1319 mSDtfsCounter, 1303 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:38,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 2637 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2025-03-04 05:55:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2025-03-04 05:55:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1265 states have (on average 1.2102766798418971) internal successors, (1531), 1302 states have internal predecessors, (1531), 487 states have call successors, (487), 136 states have call predecessors, (487), 133 states have return successors, (486), 471 states have call predecessors, (486), 485 states have call successors, (486) [2025-03-04 05:55:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2504 transitions. [2025-03-04 05:55:38,597 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2504 transitions. Word has length 174 [2025-03-04 05:55:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:38,597 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2504 transitions. [2025-03-04 05:55:38,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-04 05:55:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2504 transitions. [2025-03-04 05:55:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-04 05:55:38,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:38,599 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:38,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 05:55:38,599 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 05:55:38,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash 357130641, now seen corresponding path program 1 times [2025-03-04 05:55:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096412] [2025-03-04 05:55:38,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:38,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-04 05:55:38,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-04 05:55:38,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:38,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-04 05:55:39,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:39,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096412] [2025-03-04 05:55:39,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:39,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:39,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 05:55:39,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79509729] [2025-03-04 05:55:39,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:39,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:55:39,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:39,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:55:39,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:55:39,293 INFO L87 Difference]: Start difference. First operand 1890 states and 2504 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 05:55:43,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:55:47,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:55:51,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:55:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:57,870 INFO L93 Difference]: Finished difference Result 3913 states and 5148 transitions. [2025-03-04 05:55:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 05:55:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 222 [2025-03-04 05:55:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:57,886 INFO L225 Difference]: With dead ends: 3913 [2025-03-04 05:55:57,886 INFO L226 Difference]: Without dead ends: 3911 [2025-03-04 05:55:57,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 05:55:57,889 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 2932 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 6052 mSolverCounterSat, 1159 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3337 SdHoareTripleChecker+Valid, 4695 SdHoareTripleChecker+Invalid, 7214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1159 IncrementalHoareTripleChecker+Valid, 6052 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:57,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3337 Valid, 4695 Invalid, 7214 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1159 Valid, 6052 Invalid, 3 Unknown, 0 Unchecked, 17.8s Time] [2025-03-04 05:55:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2025-03-04 05:55:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3589. [2025-03-04 05:55:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 2413 states have (on average 1.2188147534189806) internal successors, (2941), 2483 states have internal predecessors, (2941), 924 states have call successors, (924), 251 states have call predecessors, (924), 247 states have return successors, (925), 892 states have call predecessors, (925), 922 states have call successors, (925) [2025-03-04 05:55:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 4790 transitions. [2025-03-04 05:55:58,253 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 4790 transitions. Word has length 222 [2025-03-04 05:55:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:58,253 INFO L471 AbstractCegarLoop]: Abstraction has 3589 states and 4790 transitions. [2025-03-04 05:55:58,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 4 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 05:55:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 4790 transitions. [2025-03-04 05:55:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-04 05:55:58,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:58,256 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:58,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 05:55:58,256 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 05:55:58,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash 575985359, now seen corresponding path program 1 times [2025-03-04 05:55:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:58,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549412313] [2025-03-04 05:55:58,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:58,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-04 05:55:58,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-04 05:55:58,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:58,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 05:55:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549412313] [2025-03-04 05:55:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549412313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:55:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447868591] [2025-03-04 05:55:59,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:55:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:55:59,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:55:59,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 05:56:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-04 05:56:00,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-04 05:56:00,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:00,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:00,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 2273 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 05:56:00,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:56:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 104 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-04 05:56:00,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:56:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 05:56:01,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447868591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 05:56:01,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 05:56:01,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2025-03-04 05:56:01,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454098199] [2025-03-04 05:56:01,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 05:56:01,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 05:56:01,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:01,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 05:56:01,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2025-03-04 05:56:01,081 INFO L87 Difference]: Start difference. First operand 3589 states and 4790 transitions. Second operand has 22 states, 21 states have (on average 8.047619047619047) internal successors, (169), 18 states have internal predecessors, (169), 6 states have call successors, (57), 2 states have call predecessors, (57), 7 states have return successors, (60), 9 states have call predecessors, (60), 6 states have call successors, (60) [2025-03-04 05:56:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:02,507 INFO L93 Difference]: Finished difference Result 7205 states and 9615 transitions. [2025-03-04 05:56:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 05:56:02,508 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 8.047619047619047) internal successors, (169), 18 states have internal predecessors, (169), 6 states have call successors, (57), 2 states have call predecessors, (57), 7 states have return successors, (60), 9 states have call predecessors, (60), 6 states have call successors, (60) Word has length 222 [2025-03-04 05:56:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:02,524 INFO L225 Difference]: With dead ends: 7205 [2025-03-04 05:56:02,524 INFO L226 Difference]: Without dead ends: 3633 [2025-03-04 05:56:02,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2025-03-04 05:56:02,536 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 780 mSDsluCounter, 18838 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 20130 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:02,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 20130 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 05:56:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2025-03-04 05:56:02,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3633. [2025-03-04 05:56:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 2445 states have (on average 1.2155419222903885) internal successors, (2972), 2514 states have internal predecessors, (2972), 928 states have call successors, (928), 251 states have call predecessors, (928), 255 states have return successors, (945), 904 states have call predecessors, (945), 926 states have call successors, (945) [2025-03-04 05:56:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 4845 transitions. [2025-03-04 05:56:02,918 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 4845 transitions. Word has length 222 [2025-03-04 05:56:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:02,919 INFO L471 AbstractCegarLoop]: Abstraction has 3633 states and 4845 transitions. [2025-03-04 05:56:02,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 8.047619047619047) internal successors, (169), 18 states have internal predecessors, (169), 6 states have call successors, (57), 2 states have call predecessors, (57), 7 states have return successors, (60), 9 states have call predecessors, (60), 6 states have call successors, (60) [2025-03-04 05:56:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 4845 transitions. [2025-03-04 05:56:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 05:56:02,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:02,921 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:02,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 05:56:03,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 05:56:03,122 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_urb_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)] === [2025-03-04 05:56:03,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash -619308751, now seen corresponding path program 1 times [2025-03-04 05:56:03,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268572896] [2025-03-04 05:56:03,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:03,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 05:56:03,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 05:56:03,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:03,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:03,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:03,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268572896] [2025-03-04 05:56:03,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268572896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:03,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:03,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:03,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987961107] [2025-03-04 05:56:03,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:03,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:03,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:03,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:03,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:03,469 INFO L87 Difference]: Start difference. First operand 3633 states and 4845 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-04 05:56:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:03,822 INFO L93 Difference]: Finished difference Result 3633 states and 4845 transitions. [2025-03-04 05:56:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2025-03-04 05:56:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:03,834 INFO L225 Difference]: With dead ends: 3633 [2025-03-04 05:56:03,834 INFO L226 Difference]: Without dead ends: 3458 [2025-03-04 05:56:03,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:03,837 INFO L435 NwaCegarLoop]: 1317 mSDtfsCounter, 1299 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:03,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 2634 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2025-03-04 05:56:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3458. [2025-03-04 05:56:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 2340 states have (on average 1.2235042735042736) internal successors, (2863), 2406 states have internal predecessors, (2863), 879 states have call successors, (879), 231 states have call predecessors, (879), 235 states have return successors, (896), 857 states have call predecessors, (896), 877 states have call successors, (896) [2025-03-04 05:56:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4638 transitions. [2025-03-04 05:56:04,128 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4638 transitions. Word has length 180 [2025-03-04 05:56:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:04,129 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 4638 transitions. [2025-03-04 05:56:04,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-04 05:56:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4638 transitions. [2025-03-04 05:56:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-04 05:56:04,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:04,131 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:04,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 05:56:04,131 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 05:56:04,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash -142744378, now seen corresponding path program 1 times [2025-03-04 05:56:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:04,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936936090] [2025-03-04 05:56:04,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:04,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-04 05:56:04,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-04 05:56:04,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:04,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-04 05:56:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936936090] [2025-03-04 05:56:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936936090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:05,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:05,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 05:56:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370556884] [2025-03-04 05:56:05,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:05,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 05:56:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:05,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 05:56:05,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:56:05,221 INFO L87 Difference]: Start difference. First operand 3458 states and 4638 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 5 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-04 05:56:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:05,809 INFO L93 Difference]: Finished difference Result 6905 states and 9262 transitions. [2025-03-04 05:56:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 05:56:05,810 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 5 states have call predecessors, (31), 3 states have call successors, (31) Word has length 247 [2025-03-04 05:56:05,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:05,822 INFO L225 Difference]: With dead ends: 6905 [2025-03-04 05:56:05,823 INFO L226 Difference]: Without dead ends: 3466 [2025-03-04 05:56:05,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:56:05,832 INFO L435 NwaCegarLoop]: 1154 mSDtfsCounter, 0 mSDsluCounter, 9217 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10371 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:05,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10371 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:56:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2025-03-04 05:56:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3466. [2025-03-04 05:56:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 2348 states have (on average 1.2227427597955707) internal successors, (2871), 2410 states have internal predecessors, (2871), 879 states have call successors, (879), 231 states have call predecessors, (879), 235 states have return successors, (896), 861 states have call predecessors, (896), 877 states have call successors, (896) [2025-03-04 05:56:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 4646 transitions. [2025-03-04 05:56:06,362 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 4646 transitions. Word has length 247 [2025-03-04 05:56:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:06,364 INFO L471 AbstractCegarLoop]: Abstraction has 3466 states and 4646 transitions. [2025-03-04 05:56:06,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 5 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-04 05:56:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 4646 transitions. [2025-03-04 05:56:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-04 05:56:06,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:06,366 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:06,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 05:56:06,366 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 05:56:06,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1251457504, now seen corresponding path program 1 times [2025-03-04 05:56:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:06,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847128909] [2025-03-04 05:56:06,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:06,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-04 05:56:06,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-04 05:56:06,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:06,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 05:56:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847128909] [2025-03-04 05:56:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847128909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:07,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:07,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 05:56:07,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247407490] [2025-03-04 05:56:07,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:07,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 05:56:07,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:07,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 05:56:07,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:56:07,616 INFO L87 Difference]: Start difference. First operand 3466 states and 4646 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 05:56:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:08,071 INFO L93 Difference]: Finished difference Result 6949 states and 9318 transitions. [2025-03-04 05:56:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 05:56:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 268 [2025-03-04 05:56:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:08,086 INFO L225 Difference]: With dead ends: 6949 [2025-03-04 05:56:08,086 INFO L226 Difference]: Without dead ends: 3502 [2025-03-04 05:56:08,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:56:08,096 INFO L435 NwaCegarLoop]: 1155 mSDtfsCounter, 0 mSDsluCounter, 8075 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9230 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:08,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9230 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:56:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2025-03-04 05:56:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3502. [2025-03-04 05:56:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 2376 states have (on average 1.2201178451178452) internal successors, (2899), 2438 states have internal predecessors, (2899), 879 states have call successors, (879), 231 states have call predecessors, (879), 243 states have return successors, (908), 869 states have call predecessors, (908), 877 states have call successors, (908) [2025-03-04 05:56:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 4686 transitions. [2025-03-04 05:56:08,392 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 4686 transitions. Word has length 268 [2025-03-04 05:56:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:08,393 INFO L471 AbstractCegarLoop]: Abstraction has 3502 states and 4686 transitions. [2025-03-04 05:56:08,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 05:56:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4686 transitions. [2025-03-04 05:56:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-04 05:56:08,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:08,396 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:08,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 05:56:08,396 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 05:56:08,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1412661762, now seen corresponding path program 1 times [2025-03-04 05:56:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:08,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026051534] [2025-03-04 05:56:08,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:08,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-04 05:56:08,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-04 05:56:08,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:08,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-04 05:56:09,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:09,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026051534] [2025-03-04 05:56:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026051534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:09,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:56:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56856441] [2025-03-04 05:56:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:09,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:56:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:09,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:56:09,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:09,036 INFO L87 Difference]: Start difference. First operand 3502 states and 4686 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-04 05:56:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:09,394 INFO L93 Difference]: Finished difference Result 3526 states and 4702 transitions. [2025-03-04 05:56:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:56:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 244 [2025-03-04 05:56:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:09,405 INFO L225 Difference]: With dead ends: 3526 [2025-03-04 05:56:09,406 INFO L226 Difference]: Without dead ends: 3524 [2025-03-04 05:56:09,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:56:09,407 INFO L435 NwaCegarLoop]: 1157 mSDtfsCounter, 1087 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:09,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 3503 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:56:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2025-03-04 05:56:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3524. [2025-03-04 05:56:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3524 states, 2391 states have (on average 1.2170639899623588) internal successors, (2910), 2452 states have internal predecessors, (2910), 879 states have call successors, (879), 239 states have call predecessors, (879), 251 states have return successors, (908), 869 states have call predecessors, (908), 877 states have call successors, (908) [2025-03-04 05:56:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4697 transitions. [2025-03-04 05:56:09,732 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4697 transitions. Word has length 244 [2025-03-04 05:56:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:09,733 INFO L471 AbstractCegarLoop]: Abstraction has 3524 states and 4697 transitions. [2025-03-04 05:56:09,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (33), 3 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-04 05:56:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4697 transitions. [2025-03-04 05:56:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-04 05:56:09,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:09,735 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:09,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 05:56:09,735 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-04 05:56:09,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1267818099, now seen corresponding path program 1 times [2025-03-04 05:56:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140541714] [2025-03-04 05:56:09,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:09,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-04 05:56:10,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-04 05:56:10,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:10,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat