./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--mtd--sm_ftl.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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--mtd--sm_ftl.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 66513110c58cbfd09ef37c44af5b1d4813bd7e87bef538ae0fb21419e856753a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:11:01,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:11:01,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 10:11:01,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:11:01,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:11:01,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:11:01,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:11:01,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:11:01,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:11:01,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:11:01,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:11:01,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:11:01,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:11:01,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:11:01,684 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:11:01,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:11:01,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:11:01,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:11:01,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:11:01,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:11:01,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:11:01,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:11:01,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:11:01,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:11:01,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:11:01,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:11:01,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:11:01,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:11:01,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:11:01,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:11:01,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:11:01,687 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 -> 66513110c58cbfd09ef37c44af5b1d4813bd7e87bef538ae0fb21419e856753a [2025-03-17 10:11:01,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:11:01,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:11:01,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:11:01,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:11:01,919 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:11:01,920 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--mtd--sm_ftl.ko.cil.i [2025-03-17 10:11:03,018 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1484498/11bf87f046ca44cdbfdd2c5dd0389d48/FLAG6db5d4f45 [2025-03-17 10:11:03,453 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:11:03,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2025-03-17 10:11:03,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1484498/11bf87f046ca44cdbfdd2c5dd0389d48/FLAG6db5d4f45 [2025-03-17 10:11:03,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1484498/11bf87f046ca44cdbfdd2c5dd0389d48 [2025-03-17 10:11:03,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:11:03,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:11:03,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:11:03,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:11:03,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:11:03,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:11:03" (1/1) ... [2025-03-17 10:11:03,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31634bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:03, skipping insertion in model container [2025-03-17 10:11:03,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:11:03" (1/1) ... [2025-03-17 10:11:03,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:11:05,358 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--mtd--sm_ftl.ko.cil.i[260078,260091] [2025-03-17 10:11:05,361 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--mtd--sm_ftl.ko.cil.i[260223,260236] [2025-03-17 10:11:05,363 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--mtd--sm_ftl.ko.cil.i[260369,260382] [2025-03-17 10:11:05,363 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--mtd--sm_ftl.ko.cil.i[260534,260547] [2025-03-17 10:11:05,363 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--mtd--sm_ftl.ko.cil.i[260692,260705] [2025-03-17 10:11:05,364 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--mtd--sm_ftl.ko.cil.i[260850,260863] [2025-03-17 10:11:05,364 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--mtd--sm_ftl.ko.cil.i[261008,261021] [2025-03-17 10:11:05,364 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--mtd--sm_ftl.ko.cil.i[261168,261181] [2025-03-17 10:11:05,364 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--mtd--sm_ftl.ko.cil.i[261327,261340] [2025-03-17 10:11:05,364 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--mtd--sm_ftl.ko.cil.i[261466,261479] [2025-03-17 10:11:05,365 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--mtd--sm_ftl.ko.cil.i[261608,261621] [2025-03-17 10:11:05,365 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--mtd--sm_ftl.ko.cil.i[261757,261770] [2025-03-17 10:11:05,366 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--mtd--sm_ftl.ko.cil.i[261896,261909] [2025-03-17 10:11:05,366 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--mtd--sm_ftl.ko.cil.i[262051,262064] [2025-03-17 10:11:05,366 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--mtd--sm_ftl.ko.cil.i[262211,262224] [2025-03-17 10:11:05,366 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--mtd--sm_ftl.ko.cil.i[262362,262375] [2025-03-17 10:11:05,366 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--mtd--sm_ftl.ko.cil.i[262513,262526] [2025-03-17 10:11:05,366 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--mtd--sm_ftl.ko.cil.i[262665,262678] [2025-03-17 10:11:05,367 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--mtd--sm_ftl.ko.cil.i[262814,262827] [2025-03-17 10:11:05,367 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--mtd--sm_ftl.ko.cil.i[262962,262975] [2025-03-17 10:11:05,367 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--mtd--sm_ftl.ko.cil.i[263119,263132] [2025-03-17 10:11:05,367 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--mtd--sm_ftl.ko.cil.i[263268,263281] [2025-03-17 10:11:05,368 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--mtd--sm_ftl.ko.cil.i[263424,263437] [2025-03-17 10:11:05,368 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--mtd--sm_ftl.ko.cil.i[263577,263590] [2025-03-17 10:11:05,368 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--mtd--sm_ftl.ko.cil.i[263723,263736] [2025-03-17 10:11:05,368 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--mtd--sm_ftl.ko.cil.i[263866,263879] [2025-03-17 10:11:05,369 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--mtd--sm_ftl.ko.cil.i[264018,264031] [2025-03-17 10:11:05,369 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--mtd--sm_ftl.ko.cil.i[264164,264177] [2025-03-17 10:11:05,369 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--mtd--sm_ftl.ko.cil.i[264309,264322] [2025-03-17 10:11:05,369 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--mtd--sm_ftl.ko.cil.i[264463,264476] [2025-03-17 10:11:05,369 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--mtd--sm_ftl.ko.cil.i[264614,264627] [2025-03-17 10:11:05,370 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--mtd--sm_ftl.ko.cil.i[264769,264782] [2025-03-17 10:11:05,370 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--mtd--sm_ftl.ko.cil.i[264921,264934] [2025-03-17 10:11:05,370 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--mtd--sm_ftl.ko.cil.i[265076,265089] [2025-03-17 10:11:05,370 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--mtd--sm_ftl.ko.cil.i[265240,265253] [2025-03-17 10:11:05,370 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--mtd--sm_ftl.ko.cil.i[265396,265409] [2025-03-17 10:11:05,370 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--mtd--sm_ftl.ko.cil.i[265560,265573] [2025-03-17 10:11:05,371 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--mtd--sm_ftl.ko.cil.i[265702,265715] [2025-03-17 10:11:05,371 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--mtd--sm_ftl.ko.cil.i[265860,265873] [2025-03-17 10:11:05,371 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--mtd--sm_ftl.ko.cil.i[266027,266040] [2025-03-17 10:11:05,371 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--mtd--sm_ftl.ko.cil.i[266186,266199] [2025-03-17 10:11:05,371 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--mtd--sm_ftl.ko.cil.i[266345,266358] [2025-03-17 10:11:05,372 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--mtd--sm_ftl.ko.cil.i[266494,266507] [2025-03-17 10:11:05,372 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--mtd--sm_ftl.ko.cil.i[266641,266654] [2025-03-17 10:11:05,372 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--mtd--sm_ftl.ko.cil.i[266780,266793] [2025-03-17 10:11:05,372 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--mtd--sm_ftl.ko.cil.i[266943,266956] [2025-03-17 10:11:05,372 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--mtd--sm_ftl.ko.cil.i[267109,267122] [2025-03-17 10:11:05,373 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--mtd--sm_ftl.ko.cil.i[267273,267286] [2025-03-17 10:11:05,373 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--mtd--sm_ftl.ko.cil.i[267438,267451] [2025-03-17 10:11:05,373 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--mtd--sm_ftl.ko.cil.i[267603,267616] [2025-03-17 10:11:05,373 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--mtd--sm_ftl.ko.cil.i[267769,267782] [2025-03-17 10:11:05,374 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--mtd--sm_ftl.ko.cil.i[267934,267947] [2025-03-17 10:11:05,374 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--mtd--sm_ftl.ko.cil.i[268101,268114] [2025-03-17 10:11:05,374 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--mtd--sm_ftl.ko.cil.i[268261,268274] [2025-03-17 10:11:05,374 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--mtd--sm_ftl.ko.cil.i[268423,268436] [2025-03-17 10:11:05,375 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--mtd--sm_ftl.ko.cil.i[268582,268595] [2025-03-17 10:11:05,375 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--mtd--sm_ftl.ko.cil.i[268728,268741] [2025-03-17 10:11:05,375 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--mtd--sm_ftl.ko.cil.i[268871,268884] [2025-03-17 10:11:05,375 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--mtd--sm_ftl.ko.cil.i[269015,269028] [2025-03-17 10:11:05,376 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--mtd--sm_ftl.ko.cil.i[269158,269171] [2025-03-17 10:11:05,376 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--mtd--sm_ftl.ko.cil.i[269302,269315] [2025-03-17 10:11:05,376 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--mtd--sm_ftl.ko.cil.i[269443,269456] [2025-03-17 10:11:05,376 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--mtd--sm_ftl.ko.cil.i[269581,269594] [2025-03-17 10:11:05,377 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--mtd--sm_ftl.ko.cil.i[269739,269752] [2025-03-17 10:11:05,377 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--mtd--sm_ftl.ko.cil.i[269898,269911] [2025-03-17 10:11:05,378 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--mtd--sm_ftl.ko.cil.i[270054,270067] [2025-03-17 10:11:05,378 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--mtd--sm_ftl.ko.cil.i[270203,270216] [2025-03-17 10:11:05,378 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--mtd--sm_ftl.ko.cil.i[270355,270368] [2025-03-17 10:11:05,378 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--mtd--sm_ftl.ko.cil.i[270506,270519] [2025-03-17 10:11:05,378 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--mtd--sm_ftl.ko.cil.i[270655,270668] [2025-03-17 10:11:05,379 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--mtd--sm_ftl.ko.cil.i[270807,270820] [2025-03-17 10:11:05,379 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--mtd--sm_ftl.ko.cil.i[270955,270968] [2025-03-17 10:11:05,379 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--mtd--sm_ftl.ko.cil.i[271108,271121] [2025-03-17 10:11:05,379 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--mtd--sm_ftl.ko.cil.i[271259,271272] [2025-03-17 10:11:05,379 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--mtd--sm_ftl.ko.cil.i[271409,271422] [2025-03-17 10:11:05,380 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--mtd--sm_ftl.ko.cil.i[271556,271569] [2025-03-17 10:11:05,380 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--mtd--sm_ftl.ko.cil.i[271707,271720] [2025-03-17 10:11:05,380 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--mtd--sm_ftl.ko.cil.i[271858,271871] [2025-03-17 10:11:05,380 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--mtd--sm_ftl.ko.cil.i[272006,272019] [2025-03-17 10:11:05,380 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--mtd--sm_ftl.ko.cil.i[272172,272185] [2025-03-17 10:11:05,382 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--mtd--sm_ftl.ko.cil.i[272341,272354] [2025-03-17 10:11:05,382 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--mtd--sm_ftl.ko.cil.i[272508,272521] [2025-03-17 10:11:05,383 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--mtd--sm_ftl.ko.cil.i[272676,272689] [2025-03-17 10:11:05,383 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--mtd--sm_ftl.ko.cil.i[272826,272839] [2025-03-17 10:11:05,383 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--mtd--sm_ftl.ko.cil.i[272973,272986] [2025-03-17 10:11:05,383 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--mtd--sm_ftl.ko.cil.i[273134,273147] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[273304,273317] [2025-03-17 10:11:05,385 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--mtd--sm_ftl.ko.cil.i[273466,273479] [2025-03-17 10:11:05,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:11:05,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:11:05,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [3944] [2025-03-17 10:11:05,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3952-3953] [2025-03-17 10:11:05,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("661:\n\tcall __sw_hweight32\n662:\n.pushsection .altinstructions,\"a\"\n .long 661b - .\n .long 6631f - .\n .word ( 4*32+23)\n .byte 662b-661b\n .byte 6641f-6631f\n.popsection\n.pushsection .discard,\"aw\",@progbits\n .byte 0xff + (6641f-6631f) - (662b-661b)\n.popsection\n.pushsection .altinstr_replacement, \"ax\"\n6631:\n\t.byte 0xf3,0x40,0x0f,0xb8,0xc7\n6641:\n\t.popsection": "=a" (res): "D" (w)); [3965] [2025-03-17 10:11:05,515 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 *)"drivers/mtd/sm_ftl.c"), "i" (326), "i" (12UL)); [4717-4718] [2025-03-17 10:11:05,521 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 *)"drivers/mtd/sm_ftl.c"), "i" (471), "i" (12UL)); [4937-4938] [2025-03-17 10:11:05,538 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 *)"drivers/mtd/sm_ftl.c"), "i" (883), "i" (12UL)); [5594-5595] [2025-03-17 10:11:05,540 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 *)"drivers/mtd/sm_ftl.c"), "i" (943), "i" (12UL)); [5691-5692] [2025-03-17 10:11:05,546 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 *)"drivers/mtd/sm_ftl.c"), "i" (1063), "i" (12UL)); [5888-5889] [2025-03-17 10:11:05,642 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--mtd--sm_ftl.ko.cil.i[260078,260091] [2025-03-17 10:11:05,643 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--mtd--sm_ftl.ko.cil.i[260223,260236] [2025-03-17 10:11:05,643 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--mtd--sm_ftl.ko.cil.i[260369,260382] [2025-03-17 10:11:05,643 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--mtd--sm_ftl.ko.cil.i[260534,260547] [2025-03-17 10:11:05,644 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--mtd--sm_ftl.ko.cil.i[260692,260705] [2025-03-17 10:11:05,645 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--mtd--sm_ftl.ko.cil.i[260850,260863] [2025-03-17 10:11:05,645 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--mtd--sm_ftl.ko.cil.i[261008,261021] [2025-03-17 10:11:05,645 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--mtd--sm_ftl.ko.cil.i[261168,261181] [2025-03-17 10:11:05,645 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--mtd--sm_ftl.ko.cil.i[261327,261340] [2025-03-17 10:11:05,645 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--mtd--sm_ftl.ko.cil.i[261466,261479] [2025-03-17 10:11:05,645 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--mtd--sm_ftl.ko.cil.i[261608,261621] [2025-03-17 10:11:05,646 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--mtd--sm_ftl.ko.cil.i[261757,261770] [2025-03-17 10:11:05,646 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--mtd--sm_ftl.ko.cil.i[261896,261909] [2025-03-17 10:11:05,646 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--mtd--sm_ftl.ko.cil.i[262051,262064] [2025-03-17 10:11:05,646 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--mtd--sm_ftl.ko.cil.i[262211,262224] [2025-03-17 10:11:05,646 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--mtd--sm_ftl.ko.cil.i[262362,262375] [2025-03-17 10:11:05,647 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--mtd--sm_ftl.ko.cil.i[262513,262526] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[262665,262678] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[262814,262827] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[262962,262975] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[263119,263132] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[263268,263281] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[263424,263437] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[263577,263590] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[263723,263736] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[263866,263879] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[264018,264031] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[264164,264177] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[264309,264322] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[264463,264476] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[264614,264627] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[264769,264782] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[264921,264934] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[265076,265089] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[265240,265253] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[265396,265409] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[265560,265573] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[265702,265715] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[265860,265873] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[266027,266040] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[266186,266199] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[266345,266358] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[266494,266507] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[266641,266654] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[266780,266793] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[266943,266956] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[267109,267122] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[267273,267286] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[267438,267451] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[267603,267616] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[267769,267782] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[267934,267947] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[268101,268114] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[268261,268274] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[268423,268436] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[268582,268595] [2025-03-17 10:11:05,659 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--mtd--sm_ftl.ko.cil.i[268728,268741] [2025-03-17 10:11:05,659 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--mtd--sm_ftl.ko.cil.i[268871,268884] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[269015,269028] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[269158,269171] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[269302,269315] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[269443,269456] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[269581,269594] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[269739,269752] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[269898,269911] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[270054,270067] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[270203,270216] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[270355,270368] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[270506,270519] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[270655,270668] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[270807,270820] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[270955,270968] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[271108,271121] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[271259,271272] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[271409,271422] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[271556,271569] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[271707,271720] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[271858,271871] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[272006,272019] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[272172,272185] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[272341,272354] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[272508,272521] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[272676,272689] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[272826,272839] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[272973,272986] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[273134,273147] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[273304,273317] [2025-03-17 10:11:05,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--mtd--sm_ftl.ko.cil.i[273466,273479] [2025-03-17 10:11:05,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:11:05,758 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:11:05,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05 WrapperNode [2025-03-17 10:11:05,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:11:05,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:11:05,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:11:05,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:11:05,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:05,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:05,948 INFO L138 Inliner]: procedures = 497, calls = 1452, calls flagged for inlining = 215, calls inlined = 136, statements flattened = 3328 [2025-03-17 10:11:05,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:11:05,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:11:05,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:11:05,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:11:05,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:05,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:05,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:06,174 INFO L175 MemorySlicer]: Split 483 memory accesses to 22 slices as follows [4, 6, 295, 2, 8, 7, 6, 4, 3, 3, 8, 1, 2, 5, 7, 57, 11, 8, 23, 7, 10, 6]. 61 percent of accesses are in the largest equivalence class. The 27 initializations are split as follows [0, 0, 13, 0, 0, 0, 0, 0, 0, 3, 8, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 227 writes are split as follows [4, 3, 114, 1, 2, 3, 0, 4, 3, 0, 0, 0, 0, 1, 5, 53, 11, 6, 3, 1, 8, 5]. [2025-03-17 10:11:06,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:06,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:06,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:06,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:06,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:06,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:06,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:11:06,410 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:11:06,410 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:11:06,410 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:11:06,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (1/1) ... [2025-03-17 10:11:06,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:11:06,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:11:06,441 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-17 10:11:06,447 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-17 10:11:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mark_block_bad [2025-03-17 10:11:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mark_block_bad [2025-03-17 10:11:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:11:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:11:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-17 10:11:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-17 10:11:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-03-17 10:11:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-03-17 10:11:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2025-03-17 10:11:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2025-03-17 10:11:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 10:11:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 10:11:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:11:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:11:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_lba [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_lba [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure sm_check_block [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_check_block [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure sm_release [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_release [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_init [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_init [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_sector [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_sector [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure sm_write_sector [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_write_sector [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_calculate_ecc [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_calculate_ecc [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2025-03-17 10:11:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-17 10:11:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-17 10:11:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-17 10:11:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-17 10:11:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-17 10:11:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-17 10:11:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-17 10:11:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure sm_remove_dev [2025-03-17 10:11:06,469 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_remove_dev [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-17 10:11:06,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-17 10:11:06,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-17 10:11:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2025-03-17 10:11:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:11:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:11:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-17 10:11:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure sm_recheck_media [2025-03-17 10:11:06,470 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_recheck_media [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-17 10:11:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-17 10:11:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#18 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#19 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#20 [2025-03-17 10:11:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#21 [2025-03-17 10:11:06,472 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-17 10:11:06,472 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-17 10:11:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#18 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#19 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#20 [2025-03-17 10:11:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#21 [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-17 10:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_put [2025-03-17 10:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_put [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_cis [2025-03-17 10:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_cis [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-17 10:11:06,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:11:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-17 10:11:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-17 10:11:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_out [2025-03-17 10:11:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_out [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:11:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2025-03-17 10:11:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_flush [2025-03-17 10:11:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_flush [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:11:06,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:11:06,477 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-17 10:11:06,478 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_zone [2025-03-17 10:11:06,478 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_zone [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight16 [2025-03-17 10:11:06,478 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight16 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-17 10:11:06,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mkoffset [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mkoffset [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-03-17 10:11:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-03-17 10:11:06,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-03-17 10:11:06,482 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-03-17 10:11:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_lba [2025-03-17 10:11:06,482 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_lba [2025-03-17 10:11:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:11:06,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:11:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:11:06,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:11:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:11:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:11:06,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:11:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:11:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:11:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-17 10:11:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure mtd_is_eccerr [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure mtd_is_eccerr [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_in [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_in [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_correct_data [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_correct_data [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:11:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure is_power_of_2 [2025-03-17 10:11:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure is_power_of_2 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 10:11:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:11:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure sm_sector_valid [2025-03-17 10:11:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_sector_valid [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure sm_erase_block [2025-03-17 10:11:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_erase_block [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-17 10:11:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-17 10:11:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure sm_break_offset [2025-03-17 10:11:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_break_offset [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure sm_block_valid [2025-03-17 10:11:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_block_valid [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:11:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-17 10:11:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-17 10:11:07,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:11:07,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:11:07,509 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4153: call ULTIMATE.dealloc(sm_block_erased_~#erased_pattern~0#1.base, sm_block_erased_~#erased_pattern~0#1.offset);havoc sm_block_erased_~#erased_pattern~0#1.base, sm_block_erased_~#erased_pattern~0#1.offset; [2025-03-17 10:11:07,509 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5361: call ULTIMATE.dealloc(sm_init_zone_~#oob~5#1.base, sm_init_zone_~#oob~5#1.offset);havoc sm_init_zone_~#oob~5#1.base, sm_init_zone_~#oob~5#1.offset;call ULTIMATE.dealloc(sm_init_zone_~#block~1#1.base, sm_init_zone_~#block~1#1.offset);havoc sm_init_zone_~#block~1#1.base, sm_init_zone_~#block~1#1.offset;call ULTIMATE.dealloc(sm_init_zone_~#i~3#1.base, sm_init_zone_~#i~3#1.offset);havoc sm_init_zone_~#i~3#1.base, sm_init_zone_~#i~3#1.offset; [2025-03-17 10:11:07,509 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11043: havoc __kfifo_alloc_#t~nondet694#1; [2025-03-17 10:11:07,588 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4867: call ULTIMATE.dealloc(~#oob~1.base, ~#oob~1.offset);havoc ~#oob~1.base, ~#oob~1.offset; [2025-03-17 10:11:07,992 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 10:11:08,134 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: havoc #t~mem160; [2025-03-17 10:11:08,164 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4330: havoc #t~mem130;havoc #t~mem131;havoc #t~bitwise132; [2025-03-17 10:11:08,206 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4335: call ULTIMATE.dealloc(~#erased_pattern~1.base, ~#erased_pattern~1.offset);havoc ~#erased_pattern~1.base, ~#erased_pattern~1.offset; [2025-03-17 10:11:08,887 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5007: call ULTIMATE.dealloc(~#oob~2.base, ~#oob~2.offset);havoc ~#oob~2.base, ~#oob~2.offset;call ULTIMATE.dealloc(~#lbas~0.base, ~#lbas~0.offset);havoc ~#lbas~0.base, ~#lbas~0.offset; [2025-03-17 10:11:08,907 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6305-1: ldv_del_timer_sync_#res#1 := ldv_del_timer_sync_~arg0#1; [2025-03-17 10:11:08,908 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11072: havoc cancel_work_sync_#t~nondet699#1; [2025-03-17 10:11:08,908 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6909-1: ldv_del_timer_sync_97_#res#1 := ldv_del_timer_sync_97_~ldv_func_res~2#1; [2025-03-17 10:11:08,908 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11087: havoc del_timer_sync_#t~nondet702#1; [2025-03-17 10:11:09,012 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4534: call ULTIMATE.dealloc(~#ops~0#1.base, ~#ops~0#1.offset);havoc ~#ops~0#1.base, ~#ops~0#1.offset;call ULTIMATE.dealloc(~#tmp_oob~0#1.base, ~#tmp_oob~0#1.offset);havoc ~#tmp_oob~0#1.base, ~#tmp_oob~0#1.offset; [2025-03-17 10:11:09,012 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4505: call ULTIMATE.dealloc(sm_correct_sector_~#ecc~0#1.base, sm_correct_sector_~#ecc~0#1.offset);havoc sm_correct_sector_~#ecc~0#1.base, sm_correct_sector_~#ecc~0#1.offset; [2025-03-17 10:11:09,012 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11128: havoc mtd_read_oob_#t~nondet708#1; [2025-03-17 10:11:09,015 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11132: havoc #t~nondet709; [2025-03-17 10:11:09,105 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4701: call ULTIMATE.dealloc(~#ops~1#1.base, ~#ops~1#1.offset);havoc ~#ops~1#1.base, ~#ops~1#1.offset; [2025-03-17 10:11:09,111 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11050: havoc #t~nondet695; [2025-03-17 10:11:09,146 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11079: havoc del_mtd_blktrans_dev_#t~nondet700#1; [2025-03-17 10:11:09,174 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11064: havoc #t~nondet697; [2025-03-17 10:11:09,236 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3982: havoc #t~bitwise6;havoc #t~short7; [2025-03-17 10:11:09,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5193: call ULTIMATE.dealloc(~#oob~3.base, ~#oob~3.offset);havoc ~#oob~3.base, ~#oob~3.offset; [2025-03-17 10:11:09,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11124: havoc mtd_erase_#t~nondet707#1; [2025-03-17 10:11:09,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4904: call ULTIMATE.dealloc(~#block#1.base, ~#block#1.offset);havoc ~#block#1.base, ~#block#1.offset;call ULTIMATE.dealloc(~#erase~0#1.base, ~#erase~0#1.offset);havoc ~#erase~0#1.base, ~#erase~0#1.offset; [2025-03-17 10:11:09,390 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11054: havoc #t~nondet696; [2025-03-17 10:11:09,483 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5661: call ULTIMATE.dealloc(~#write_sector~0#1.base, ~#write_sector~0#1.offset);havoc ~#write_sector~0#1.base, ~#write_sector~0#1.offset; [2025-03-17 10:11:09,483 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4383: call ULTIMATE.dealloc(sm_write_lba_~#tmp~13#1.base, sm_write_lba_~#tmp~13#1.offset);havoc sm_write_lba_~#tmp~13#1.base, sm_write_lba_~#tmp~13#1.offset; [2025-03-17 10:11:09,483 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4788: call ULTIMATE.dealloc(sm_write_block_~#invalid_bitmap#1.base, sm_write_block_~#invalid_bitmap#1.offset);havoc sm_write_block_~#invalid_bitmap#1.base, sm_write_block_~#invalid_bitmap#1.offset;call ULTIMATE.dealloc(sm_write_block_~#oob~0#1.base, sm_write_block_~#oob~0#1.offset);havoc sm_write_block_~#oob~0#1.base, sm_write_block_~#oob~0#1.offset; [2025-03-17 10:11:14,307 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11068: havoc add_mtd_blktrans_dev_#t~nondet698#1; [2025-03-17 10:11:14,307 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11036: havoc __alloc_workqueue_key_#t~ret693#1.base, __alloc_workqueue_key_#t~ret693#1.offset; [2025-03-17 10:11:14,307 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11136: havoc queue_work_on_#t~nondet710#1; [2025-03-17 10:11:14,307 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11103: havoc kstrndup_#t~ret704#1.base, kstrndup_#t~ret704#1.offset; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6942-1: ldv_register_mtd_blktrans_100_#res#1 := ldv_register_mtd_blktrans_100_~ldv_func_res~3#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6317-1: ldv_deregister_mtd_blktrans_#res#1 := ldv_deregister_mtd_blktrans_~arg0#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11140: havoc register_mtd_blktrans_#t~nondet711#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6191: call ULTIMATE.dealloc(sm_module_init_~#__key~2#1.base, sm_module_init_~#__key~2#1.offset);havoc sm_module_init_~#__key~2#1.base, sm_module_init_~#__key~2#1.offset; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5234: call ULTIMATE.dealloc(sm_find_cis_~#oob~4#1.base, sm_find_cis_~#oob~4#1.offset);havoc sm_find_cis_~#oob~4#1.base, sm_find_cis_~#oob~4#1.offset; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6524-1: ldv_register_mtd_blktrans_#res#1 := ldv_register_mtd_blktrans_~arg0#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11116: havoc mod_timer_#t~nondet705#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11083: havoc del_timer_#t~nondet701#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6296-1: ldv_del_timer_#res#1 := ldv_del_timer_~arg0#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6957-1: ldv_deregister_mtd_blktrans_101_#res#1 := ldv_deregister_mtd_blktrans_101_~ldv_func_res~4#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6858-1: ldv_mod_timer_92_#res#1 := ldv_mod_timer_92_~ldv_func_res~1#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11120: havoc msecs_to_jiffies_#t~nondet706#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5803: call ULTIMATE.dealloc(sm_read_~#zone_num~1#1.base, sm_read_~#zone_num~1#1.offset);havoc sm_read_~#zone_num~1#1.base, sm_read_~#zone_num~1#1.offset;call ULTIMATE.dealloc(sm_read_~#block~2#1.base, sm_read_~#block~2#1.offset);havoc sm_read_~#block~2#1.base, sm_read_~#block~2#1.offset;call ULTIMATE.dealloc(sm_read_~#boffset~4#1.base, sm_read_~#boffset~4#1.offset);havoc sm_read_~#boffset~4#1.base, sm_read_~#boffset~4#1.offset; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4219: call ULTIMATE.dealloc(sm_create_sysfs_attributes_~#__key~0#1.base, sm_create_sysfs_attributes_~#__key~0#1.offset);havoc sm_create_sysfs_attributes_~#__key~0#1.base, sm_create_sysfs_attributes_~#__key~0#1.offset; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4088: havoc mtd_has_oob_#t~mem83#1.base, mtd_has_oob_#t~mem83#1.offset;havoc mtd_has_oob_#t~mem84#1.base, mtd_has_oob_#t~mem84#1.offset;havoc mtd_has_oob_#t~short85#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11091: havoc deregister_mtd_blktrans_#t~nondet703#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6500-1: ldv_mod_timer_#res#1 := ldv_mod_timer_~arg0#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5873: call ULTIMATE.dealloc(sm_write_~#zone_num~2#1.base, sm_write_~#zone_num~2#1.offset);havoc sm_write_~#zone_num~2#1.base, sm_write_~#zone_num~2#1.offset;call ULTIMATE.dealloc(sm_write_~#block~3#1.base, sm_write_~#block~3#1.offset);havoc sm_write_~#block~3#1.base, sm_write_~#block~3#1.offset;call ULTIMATE.dealloc(sm_write_~#boffset~5#1.base, sm_write_~#boffset~5#1.offset);havoc sm_write_~#boffset~5#1.base, sm_write_~#boffset~5#1.offset; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6834-1: ldv_del_timer_90_#res#1 := ldv_del_timer_90_~ldv_func_res~0#1; [2025-03-17 10:11:14,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978: call ULTIMATE.dealloc(sm_add_mtd_~#__key~1#1.base, sm_add_mtd_~#__key~1#1.offset);havoc sm_add_mtd_~#__key~1#1.base, sm_add_mtd_~#__key~1#1.offset;call ULTIMATE.dealloc(sm_add_mtd_~#__key___0~0#1.base, sm_add_mtd_~#__key___0~0#1.offset);havoc sm_add_mtd_~#__key___0~0#1.base, sm_add_mtd_~#__key___0~0#1.offset;call ULTIMATE.dealloc(sm_add_mtd_~#__key___1~0#1.base, sm_add_mtd_~#__key___1~0#1.offset);havoc sm_add_mtd_~#__key___1~0#1.base, sm_add_mtd_~#__key___1~0#1.offset;call ULTIMATE.dealloc(sm_add_mtd_~#__constr_expr_0~0#1.base, sm_add_mtd_~#__constr_expr_0~0#1.offset);havoc sm_add_mtd_~#__constr_expr_0~0#1.base, sm_add_mtd_~#__constr_expr_0~0#1.offset; [2025-03-17 10:11:14,759 INFO L? ?]: Removed 1629 outVars from TransFormulas that were not future-live. [2025-03-17 10:11:14,759 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:11:14,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:11:14,811 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:11:14,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:11:14 BoogieIcfgContainer [2025-03-17 10:11:14,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:11:14,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:11:14,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:11:14,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:11:14,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:11:03" (1/3) ... [2025-03-17 10:11:14,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9b036b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:11:14, skipping insertion in model container [2025-03-17 10:11:14,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:11:05" (2/3) ... [2025-03-17 10:11:14,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9b036b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:11:14, skipping insertion in model container [2025-03-17 10:11:14,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:11:14" (3/3) ... [2025-03-17 10:11:14,817 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2025-03-17 10:11:14,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:11:14,833 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i that has 122 procedures, 1381 locations, 1 initial locations, 66 loop locations, and 27 error locations. [2025-03-17 10:11:14,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:11:14,913 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;@45629fa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:11:14,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-17 10:11:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 1191 states, 804 states have (on average 1.342039800995025) internal successors, (1079), 855 states have internal predecessors, (1079), 281 states have call successors, (281), 79 states have call predecessors, (281), 78 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-17 10:11:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 10:11:14,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:14,929 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:11:14,929 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 25 more)] === [2025-03-17 10:11:14,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:14,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1982656397, now seen corresponding path program 1 times [2025-03-17 10:11:14,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:14,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852786035] [2025-03-17 10:11:14,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:15,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 10:11:15,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 10:11:15,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:15,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:16,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:16,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852786035] [2025-03-17 10:11:16,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852786035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:16,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:16,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179457933] [2025-03-17 10:11:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:16,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:16,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:16,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:16,338 INFO L87 Difference]: Start difference. First operand has 1191 states, 804 states have (on average 1.342039800995025) internal successors, (1079), 855 states have internal predecessors, (1079), 281 states have call successors, (281), 79 states have call predecessors, (281), 78 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-17 10:11:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:16,594 INFO L93 Difference]: Finished difference Result 2355 states and 3334 transitions. [2025-03-17 10:11:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 57 [2025-03-17 10:11:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:16,621 INFO L225 Difference]: With dead ends: 2355 [2025-03-17 10:11:16,621 INFO L226 Difference]: Without dead ends: 1176 [2025-03-17 10:11:16,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:16,660 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 1581 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:16,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 3183 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-03-17 10:11:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1176. [2025-03-17 10:11:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 795 states have (on average 1.2981132075471697) internal successors, (1032), 843 states have internal predecessors, (1032), 278 states have call successors, (278), 78 states have call predecessors, (278), 77 states have return successors, (276), 274 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-17 10:11:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1586 transitions. [2025-03-17 10:11:16,775 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1586 transitions. Word has length 57 [2025-03-17 10:11:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:16,777 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1586 transitions. [2025-03-17 10:11:16,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-17 10:11:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1586 transitions. [2025-03-17 10:11:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 10:11:16,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:16,779 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:11:16,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:11:16,780 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 25 more)] === [2025-03-17 10:11:16,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash 665284266, now seen corresponding path program 1 times [2025-03-17 10:11:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202458440] [2025-03-17 10:11:16,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:17,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:11:17,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:11:17,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:17,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:17,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202458440] [2025-03-17 10:11:17,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202458440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:17,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:17,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536664404] [2025-03-17 10:11:17,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:17,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:17,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:17,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:17,751 INFO L87 Difference]: Start difference. First operand 1176 states and 1586 transitions. 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, (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-17 10:11:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:17,913 INFO L93 Difference]: Finished difference Result 1176 states and 1586 transitions. [2025-03-17 10:11:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:17,913 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, (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 63 [2025-03-17 10:11:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:17,920 INFO L225 Difference]: With dead ends: 1176 [2025-03-17 10:11:17,920 INFO L226 Difference]: Without dead ends: 1174 [2025-03-17 10:11:17,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:17,922 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 1564 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:17,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 3151 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-03-17 10:11:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2025-03-17 10:11:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 794 states have (on average 1.2972292191435768) internal successors, (1030), 841 states have internal predecessors, (1030), 278 states have call successors, (278), 78 states have call predecessors, (278), 77 states have return successors, (276), 274 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-17 10:11:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1584 transitions. [2025-03-17 10:11:17,988 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1584 transitions. Word has length 63 [2025-03-17 10:11:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:17,989 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1584 transitions. [2025-03-17 10:11:17,989 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, (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-17 10:11:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1584 transitions. [2025-03-17 10:11:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 10:11:17,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:17,991 INFO L218 NwaCegarLoop]: trace histogram [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-17 10:11:17,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:11:17,991 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 25 more)] === [2025-03-17 10:11:17,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash -218775262, now seen corresponding path program 1 times [2025-03-17 10:11:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:17,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231387441] [2025-03-17 10:11:17,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:17,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:18,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:11:18,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:11:18,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:18,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:18,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231387441] [2025-03-17 10:11:18,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231387441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:18,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:18,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:18,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767048156] [2025-03-17 10:11:18,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:18,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:18,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:18,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:18,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:18,836 INFO L87 Difference]: Start difference. First operand 1174 states and 1584 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, (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-17 10:11:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:18,971 INFO L93 Difference]: Finished difference Result 1174 states and 1584 transitions. [2025-03-17 10:11:18,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:18,972 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, (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 69 [2025-03-17 10:11:18,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:18,977 INFO L225 Difference]: With dead ends: 1174 [2025-03-17 10:11:18,977 INFO L226 Difference]: Without dead ends: 1172 [2025-03-17 10:11:18,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:18,978 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 1561 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:18,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 3147 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-03-17 10:11:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2025-03-17 10:11:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 793 states have (on average 1.296343001261034) internal successors, (1028), 839 states have internal predecessors, (1028), 278 states have call successors, (278), 78 states have call predecessors, (278), 77 states have return successors, (276), 274 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-17 10:11:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1582 transitions. [2025-03-17 10:11:19,019 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1582 transitions. Word has length 69 [2025-03-17 10:11:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:19,019 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1582 transitions. [2025-03-17 10:11:19,019 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, (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-17 10:11:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1582 transitions. [2025-03-17 10:11:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 10:11:19,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:19,021 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-17 10:11:19,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:11:19,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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 25 more)] === [2025-03-17 10:11:19,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash -729110765, now seen corresponding path program 1 times [2025-03-17 10:11:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:19,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119050065] [2025-03-17 10:11:19,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:19,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 10:11:19,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 10:11:19,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:19,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:11:20,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:20,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119050065] [2025-03-17 10:11:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119050065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:11:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000288010] [2025-03-17 10:11:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:20,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:11:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:20,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:11:20,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:11:20,264 INFO L87 Difference]: Start difference. First operand 1172 states and 1582 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 10:11:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:20,799 INFO L93 Difference]: Finished difference Result 2572 states and 3415 transitions. [2025-03-17 10:11:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:11:20,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2025-03-17 10:11:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:20,811 INFO L225 Difference]: With dead ends: 2572 [2025-03-17 10:11:20,811 INFO L226 Difference]: Without dead ends: 1407 [2025-03-17 10:11:20,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:11:20,817 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 261 mSDsluCounter, 6278 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 7852 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:20,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 7852 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:11:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-03-17 10:11:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1225. [2025-03-17 10:11:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 825 states have (on average 1.2872727272727273) internal successors, (1062), 873 states have internal predecessors, (1062), 290 states have call successors, (290), 86 states have call predecessors, (290), 86 states have return successors, (289), 285 states have call predecessors, (289), 288 states have call successors, (289) [2025-03-17 10:11:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1641 transitions. [2025-03-17 10:11:20,886 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1641 transitions. Word has length 72 [2025-03-17 10:11:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:20,887 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1641 transitions. [2025-03-17 10:11:20,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 10:11:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1641 transitions. [2025-03-17 10:11:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 10:11:20,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:20,888 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:11:20,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:11:20,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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 25 more)] === [2025-03-17 10:11:20,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash -364667470, now seen corresponding path program 1 times [2025-03-17 10:11:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:20,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868298098] [2025-03-17 10:11:20,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:21,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 10:11:21,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 10:11:21,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:21,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:21,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:21,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868298098] [2025-03-17 10:11:21,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868298098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:21,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:21,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:21,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482617893] [2025-03-17 10:11:21,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:21,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:21,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:21,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:21,762 INFO L87 Difference]: Start difference. First operand 1225 states and 1641 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, (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-17 10:11:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:21,939 INFO L93 Difference]: Finished difference Result 1225 states and 1641 transitions. [2025-03-17 10:11:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:21,940 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, (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 75 [2025-03-17 10:11:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:21,946 INFO L225 Difference]: With dead ends: 1225 [2025-03-17 10:11:21,947 INFO L226 Difference]: Without dead ends: 1223 [2025-03-17 10:11:21,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:21,948 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 1558 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 3143 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:21,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 3143 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-03-17 10:11:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2025-03-17 10:11:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 824 states have (on average 1.2864077669902914) internal successors, (1060), 871 states have internal predecessors, (1060), 290 states have call successors, (290), 86 states have call predecessors, (290), 86 states have return successors, (289), 285 states have call predecessors, (289), 288 states have call successors, (289) [2025-03-17 10:11:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1639 transitions. [2025-03-17 10:11:21,996 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1639 transitions. Word has length 75 [2025-03-17 10:11:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:21,996 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1639 transitions. [2025-03-17 10:11:21,996 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, (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-17 10:11:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1639 transitions. [2025-03-17 10:11:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 10:11:21,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:21,998 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:11:21,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:11:21,999 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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 25 more)] === [2025-03-17 10:11:21,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash 155861308, now seen corresponding path program 1 times [2025-03-17 10:11:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:22,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741596907] [2025-03-17 10:11:22,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:22,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 10:11:22,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 10:11:22,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:22,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741596907] [2025-03-17 10:11:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741596907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:22,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:22,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:22,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434773538] [2025-03-17 10:11:22,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:22,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:22,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:22,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:22,787 INFO L87 Difference]: Start difference. First operand 1223 states and 1639 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, (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-17 10:11:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:22,946 INFO L93 Difference]: Finished difference Result 1223 states and 1639 transitions. [2025-03-17 10:11:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:22,947 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, (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 81 [2025-03-17 10:11:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:22,953 INFO L225 Difference]: With dead ends: 1223 [2025-03-17 10:11:22,953 INFO L226 Difference]: Without dead ends: 1221 [2025-03-17 10:11:22,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:22,955 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 1555 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:22,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 3139 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-17 10:11:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1221. [2025-03-17 10:11:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 823 states have (on average 1.2855407047387606) internal successors, (1058), 869 states have internal predecessors, (1058), 290 states have call successors, (290), 86 states have call predecessors, (290), 86 states have return successors, (289), 285 states have call predecessors, (289), 288 states have call successors, (289) [2025-03-17 10:11:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1637 transitions. [2025-03-17 10:11:23,007 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1637 transitions. Word has length 81 [2025-03-17 10:11:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:23,007 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1637 transitions. [2025-03-17 10:11:23,007 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, (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-17 10:11:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1637 transitions. [2025-03-17 10:11:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 10:11:23,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:23,010 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 10:11:23,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:11:23,010 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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 25 more)] === [2025-03-17 10:11:23,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash 395941404, now seen corresponding path program 1 times [2025-03-17 10:11:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:23,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610179103] [2025-03-17 10:11:23,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:23,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 10:11:23,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 10:11:23,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:23,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 10:11:24,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:24,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610179103] [2025-03-17 10:11:24,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610179103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:24,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:24,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:11:24,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265864292] [2025-03-17 10:11:24,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:24,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:11:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:24,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:11:24,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:24,091 INFO L87 Difference]: Start difference. First operand 1221 states and 1637 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 10:11:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:24,449 INFO L93 Difference]: Finished difference Result 1457 states and 1940 transitions. [2025-03-17 10:11:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:11:24,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2025-03-17 10:11:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:24,457 INFO L225 Difference]: With dead ends: 1457 [2025-03-17 10:11:24,458 INFO L226 Difference]: Without dead ends: 1455 [2025-03-17 10:11:24,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:11:24,460 INFO L435 NwaCegarLoop]: 1808 mSDtfsCounter, 904 mSDsluCounter, 4555 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 6363 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:24,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 6363 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:11:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2025-03-17 10:11:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1451. [2025-03-17 10:11:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 981 states have (on average 1.2874617737003058) internal successors, (1263), 1032 states have internal predecessors, (1263), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1936 transitions. [2025-03-17 10:11:24,559 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1936 transitions. Word has length 88 [2025-03-17 10:11:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:24,560 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 1936 transitions. [2025-03-17 10:11:24,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 10:11:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1936 transitions. [2025-03-17 10:11:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 10:11:24,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:24,563 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:11:24,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:11:24,564 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 25 more)] === [2025-03-17 10:11:24,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash 189191527, now seen corresponding path program 1 times [2025-03-17 10:11:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:24,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855366242] [2025-03-17 10:11:24,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:25,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 10:11:25,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 10:11:25,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:25,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:25,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855366242] [2025-03-17 10:11:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855366242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885660476] [2025-03-17 10:11:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:25,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:25,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:25,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:25,405 INFO L87 Difference]: Start difference. First operand 1451 states and 1936 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, (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-17 10:11:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:25,605 INFO L93 Difference]: Finished difference Result 1451 states and 1936 transitions. [2025-03-17 10:11:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:25,606 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, (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 87 [2025-03-17 10:11:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:25,613 INFO L225 Difference]: With dead ends: 1451 [2025-03-17 10:11:25,613 INFO L226 Difference]: Without dead ends: 1449 [2025-03-17 10:11:25,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:25,614 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 1550 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:25,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 3131 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-03-17 10:11:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1449. [2025-03-17 10:11:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 980 states have (on average 1.286734693877551) internal successors, (1261), 1030 states have internal predecessors, (1261), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1934 transitions. [2025-03-17 10:11:25,678 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1934 transitions. Word has length 87 [2025-03-17 10:11:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:25,679 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 1934 transitions. [2025-03-17 10:11:25,679 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, (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-17 10:11:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1934 transitions. [2025-03-17 10:11:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 10:11:25,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:25,682 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:11:25,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:11:25,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:11:25,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash -657530190, now seen corresponding path program 1 times [2025-03-17 10:11:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:25,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796213569] [2025-03-17 10:11:25,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:25,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:26,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 10:11:26,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 10:11:26,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:26,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:26,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:26,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796213569] [2025-03-17 10:11:26,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796213569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:26,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:26,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098660191] [2025-03-17 10:11:26,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:26,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:26,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:26,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:26,427 INFO L87 Difference]: Start difference. First operand 1449 states and 1934 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, (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-17 10:11:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:26,608 INFO L93 Difference]: Finished difference Result 1449 states and 1934 transitions. [2025-03-17 10:11:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:26,608 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, (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 93 [2025-03-17 10:11:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:26,616 INFO L225 Difference]: With dead ends: 1449 [2025-03-17 10:11:26,616 INFO L226 Difference]: Without dead ends: 1447 [2025-03-17 10:11:26,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:26,619 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 1547 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:26,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 3127 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-03-17 10:11:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2025-03-17 10:11:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 979 states have (on average 1.286006128702758) internal successors, (1259), 1028 states have internal predecessors, (1259), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1932 transitions. [2025-03-17 10:11:26,743 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1932 transitions. Word has length 93 [2025-03-17 10:11:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:26,743 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1932 transitions. [2025-03-17 10:11:26,743 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, (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-17 10:11:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1932 transitions. [2025-03-17 10:11:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 10:11:26,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:26,748 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 10:11:26,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:11:26,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:11:26,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 572586205, now seen corresponding path program 1 times [2025-03-17 10:11:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353857933] [2025-03-17 10:11:26,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:27,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 10:11:27,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 10:11:27,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:27,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 10:11:28,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:28,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353857933] [2025-03-17 10:11:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353857933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:28,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:11:28,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463172488] [2025-03-17 10:11:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:28,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:11:28,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:28,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:11:28,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:11:28,087 INFO L87 Difference]: Start difference. First operand 1447 states and 1932 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 10:11:32,106 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-17 10:11:35,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:35,882 INFO L93 Difference]: Finished difference Result 2822 states and 3788 transitions. [2025-03-17 10:11:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:11:35,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2025-03-17 10:11:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:35,892 INFO L225 Difference]: With dead ends: 2822 [2025-03-17 10:11:35,892 INFO L226 Difference]: Without dead ends: 1447 [2025-03-17 10:11:35,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:11:35,898 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 1538 mSDsluCounter, 4123 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 5685 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:35,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 5685 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 594 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2025-03-17 10:11:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-03-17 10:11:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2025-03-17 10:11:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 979 states have (on average 1.2839632277834525) internal successors, (1257), 1028 states have internal predecessors, (1257), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1930 transitions. [2025-03-17 10:11:35,971 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1930 transitions. Word has length 97 [2025-03-17 10:11:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:35,971 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1930 transitions. [2025-03-17 10:11:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 10:11:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1930 transitions. [2025-03-17 10:11:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 10:11:35,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:35,974 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 10:11:35,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:11:35,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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 25 more)] === [2025-03-17 10:11:35,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 572615996, now seen corresponding path program 1 times [2025-03-17 10:11:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101724282] [2025-03-17 10:11:35,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:36,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 10:11:36,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 10:11:36,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:36,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 10:11:36,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:36,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101724282] [2025-03-17 10:11:36,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101724282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:36,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923326630] [2025-03-17 10:11:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:36,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:36,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:36,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:36,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:36,884 INFO L87 Difference]: Start difference. First operand 1447 states and 1930 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 10:11:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:37,149 INFO L93 Difference]: Finished difference Result 1447 states and 1930 transitions. [2025-03-17 10:11:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:37,152 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), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-03-17 10:11:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:37,160 INFO L225 Difference]: With dead ends: 1447 [2025-03-17 10:11:37,160 INFO L226 Difference]: Without dead ends: 1445 [2025-03-17 10:11:37,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:37,161 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 0 mSDsluCounter, 3118 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4679 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:37,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4679 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:11:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-03-17 10:11:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2025-03-17 10:11:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 978 states have (on average 1.2822085889570551) internal successors, (1254), 1026 states have internal predecessors, (1254), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1927 transitions. [2025-03-17 10:11:37,280 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1927 transitions. Word has length 97 [2025-03-17 10:11:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:37,280 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1927 transitions. [2025-03-17 10:11:37,280 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), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 10:11:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1927 transitions. [2025-03-17 10:11:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 10:11:37,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:37,283 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:11:37,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:11:37,284 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:11:37,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1942927993, now seen corresponding path program 1 times [2025-03-17 10:11:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:37,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372177634] [2025-03-17 10:11:37,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:37,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 10:11:37,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 10:11:37,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:37,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:38,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372177634] [2025-03-17 10:11:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372177634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:38,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118442854] [2025-03-17 10:11:38,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:38,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:38,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:38,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:38,192 INFO L87 Difference]: Start difference. First operand 1445 states and 1927 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, (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-17 10:11:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:38,408 INFO L93 Difference]: Finished difference Result 1445 states and 1927 transitions. [2025-03-17 10:11:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:38,409 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, (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 99 [2025-03-17 10:11:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:38,415 INFO L225 Difference]: With dead ends: 1445 [2025-03-17 10:11:38,416 INFO L226 Difference]: Without dead ends: 1443 [2025-03-17 10:11:38,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:38,417 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 1541 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:38,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 3117 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-03-17 10:11:38,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2025-03-17 10:11:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 977 states have (on average 1.2814738996929376) internal successors, (1252), 1024 states have internal predecessors, (1252), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1925 transitions. [2025-03-17 10:11:38,493 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1925 transitions. Word has length 99 [2025-03-17 10:11:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:38,494 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 1925 transitions. [2025-03-17 10:11:38,494 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, (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-17 10:11:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1925 transitions. [2025-03-17 10:11:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 10:11:38,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:38,496 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 10:11:38,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:11:38,496 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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 25 more)] === [2025-03-17 10:11:38,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash -805196365, now seen corresponding path program 1 times [2025-03-17 10:11:38,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937942215] [2025-03-17 10:11:38,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:39,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:11:39,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:11:39,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:39,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 10:11:39,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:39,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937942215] [2025-03-17 10:11:39,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937942215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:39,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:39,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:11:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676569293] [2025-03-17 10:11:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:39,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:11:39,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:39,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:11:39,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:11:39,277 INFO L87 Difference]: Start difference. First operand 1443 states and 1925 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 10:11:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:39,385 INFO L93 Difference]: Finished difference Result 2808 states and 3767 transitions. [2025-03-17 10:11:39,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:11:39,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2025-03-17 10:11:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:39,393 INFO L225 Difference]: With dead ends: 2808 [2025-03-17 10:11:39,393 INFO L226 Difference]: Without dead ends: 1437 [2025-03-17 10:11:39,398 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-17 10:11:39,399 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 1526 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:39,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1555 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:11:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-03-17 10:11:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1437. [2025-03-17 10:11:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 972 states have (on average 1.27880658436214) internal successors, (1243), 1018 states have internal predecessors, (1243), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1916 transitions. [2025-03-17 10:11:39,514 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1916 transitions. Word has length 100 [2025-03-17 10:11:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:39,514 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1916 transitions. [2025-03-17 10:11:39,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 10:11:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1916 transitions. [2025-03-17 10:11:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 10:11:39,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:39,516 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 10:11:39,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:11:39,516 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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 25 more)] === [2025-03-17 10:11:39,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:39,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1156914987, now seen corresponding path program 1 times [2025-03-17 10:11:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:39,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053652035] [2025-03-17 10:11:39,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:40,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 10:11:40,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 10:11:40,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:40,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:40,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:40,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053652035] [2025-03-17 10:11:40,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053652035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:40,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:40,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:40,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199347901] [2025-03-17 10:11:40,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:40,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:40,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:40,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:40,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:40,468 INFO L87 Difference]: Start difference. First operand 1437 states and 1916 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-17 10:11:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:40,676 INFO L93 Difference]: Finished difference Result 1437 states and 1916 transitions. [2025-03-17 10:11:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:40,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 101 [2025-03-17 10:11:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:40,687 INFO L225 Difference]: With dead ends: 1437 [2025-03-17 10:11:40,687 INFO L226 Difference]: Without dead ends: 1435 [2025-03-17 10:11:40,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:40,688 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 1532 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:40,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3103 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-03-17 10:11:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1435. [2025-03-17 10:11:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 971 states have (on average 1.278063851699279) internal successors, (1241), 1016 states have internal predecessors, (1241), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1914 transitions. [2025-03-17 10:11:40,844 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1914 transitions. Word has length 101 [2025-03-17 10:11:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:40,844 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 1914 transitions. [2025-03-17 10:11:40,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-17 10:11:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1914 transitions. [2025-03-17 10:11:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 10:11:40,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:40,850 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 10:11:40,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:11:40,851 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:11:40,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash 639551653, now seen corresponding path program 1 times [2025-03-17 10:11:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:40,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185946891] [2025-03-17 10:11:40,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:41,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 10:11:41,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 10:11:41,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:41,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-17 10:11:41,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185946891] [2025-03-17 10:11:41,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185946891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:41,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:41,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:11:41,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897346940] [2025-03-17 10:11:41,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:41,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:11:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:41,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:11:41,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:41,831 INFO L87 Difference]: Start difference. First operand 1435 states and 1914 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:11:45,848 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-17 10:11:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:46,274 INFO L93 Difference]: Finished difference Result 1435 states and 1914 transitions. [2025-03-17 10:11:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:11:46,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-03-17 10:11:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:46,283 INFO L225 Difference]: With dead ends: 1435 [2025-03-17 10:11:46,283 INFO L226 Difference]: Without dead ends: 1433 [2025-03-17 10:11:46,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:11:46,285 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 934 mSDsluCounter, 4110 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 5712 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:46,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 5712 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 10:11:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-03-17 10:11:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2025-03-17 10:11:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 970 states have (on average 1.2773195876288659) internal successors, (1239), 1014 states have internal predecessors, (1239), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1912 transitions. [2025-03-17 10:11:46,421 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1912 transitions. Word has length 106 [2025-03-17 10:11:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:46,421 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1912 transitions. [2025-03-17 10:11:46,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:11:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1912 transitions. [2025-03-17 10:11:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 10:11:46,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:46,423 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2025-03-17 10:11:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:11:46,424 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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 25 more)] === [2025-03-17 10:11:46,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -47951168, now seen corresponding path program 1 times [2025-03-17 10:11:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:46,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220259787] [2025-03-17 10:11:46,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:46,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 10:11:46,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 10:11:46,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:46,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:47,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220259787] [2025-03-17 10:11:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220259787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:47,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083764862] [2025-03-17 10:11:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:47,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:47,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:47,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:47,221 INFO L87 Difference]: Start difference. First operand 1433 states and 1912 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, (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-17 10:11:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:47,418 INFO L93 Difference]: Finished difference Result 1433 states and 1912 transitions. [2025-03-17 10:11:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:47,418 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, (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 107 [2025-03-17 10:11:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:47,424 INFO L225 Difference]: With dead ends: 1433 [2025-03-17 10:11:47,424 INFO L226 Difference]: Without dead ends: 1431 [2025-03-17 10:11:47,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:47,426 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 1529 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:47,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 3095 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2025-03-17 10:11:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2025-03-17 10:11:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 969 states have (on average 1.2765737874097007) internal successors, (1237), 1012 states have internal predecessors, (1237), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1910 transitions. [2025-03-17 10:11:47,502 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1910 transitions. Word has length 107 [2025-03-17 10:11:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:47,503 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1910 transitions. [2025-03-17 10:11:47,503 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, (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-17 10:11:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1910 transitions. [2025-03-17 10:11:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 10:11:47,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:47,504 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:11:47,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:11:47,504 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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 25 more)] === [2025-03-17 10:11:47,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:47,505 INFO L85 PathProgramCache]: Analyzing trace with hash -147891319, now seen corresponding path program 1 times [2025-03-17 10:11:47,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:47,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510591690] [2025-03-17 10:11:47,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:47,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:47,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 10:11:47,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 10:11:47,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:47,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:48,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:48,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510591690] [2025-03-17 10:11:48,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510591690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:48,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:48,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:48,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166857612] [2025-03-17 10:11:48,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:48,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:48,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:48,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:48,207 INFO L87 Difference]: Start difference. First operand 1431 states and 1910 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, (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-17 10:11:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:48,414 INFO L93 Difference]: Finished difference Result 1431 states and 1910 transitions. [2025-03-17 10:11:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:48,414 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, (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 113 [2025-03-17 10:11:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:48,420 INFO L225 Difference]: With dead ends: 1431 [2025-03-17 10:11:48,420 INFO L226 Difference]: Without dead ends: 1429 [2025-03-17 10:11:48,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:48,421 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 1526 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:48,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 3091 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-03-17 10:11:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1429. [2025-03-17 10:11:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 968 states have (on average 1.2758264462809918) internal successors, (1235), 1010 states have internal predecessors, (1235), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1908 transitions. [2025-03-17 10:11:48,499 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1908 transitions. Word has length 113 [2025-03-17 10:11:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:48,499 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1908 transitions. [2025-03-17 10:11:48,499 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, (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-17 10:11:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1908 transitions. [2025-03-17 10:11:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 10:11:48,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:48,501 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:11:48,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:11:48,501 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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 25 more)] === [2025-03-17 10:11:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash -44297085, now seen corresponding path program 1 times [2025-03-17 10:11:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846555022] [2025-03-17 10:11:48,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:49,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 10:11:49,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 10:11:49,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:49,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846555022] [2025-03-17 10:11:49,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846555022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:49,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867326532] [2025-03-17 10:11:49,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:49,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:49,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:49,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:49,348 INFO L87 Difference]: Start difference. First operand 1429 states and 1908 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, (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-17 10:11:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:49,529 INFO L93 Difference]: Finished difference Result 1429 states and 1908 transitions. [2025-03-17 10:11:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:49,530 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, (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 119 [2025-03-17 10:11:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:49,536 INFO L225 Difference]: With dead ends: 1429 [2025-03-17 10:11:49,536 INFO L226 Difference]: Without dead ends: 1427 [2025-03-17 10:11:49,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:49,537 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 1523 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 3087 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:49,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 3087 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-17 10:11:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2025-03-17 10:11:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 967 states have (on average 1.2750775594622543) internal successors, (1233), 1008 states have internal predecessors, (1233), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1906 transitions. [2025-03-17 10:11:49,624 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1906 transitions. Word has length 119 [2025-03-17 10:11:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:49,625 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1906 transitions. [2025-03-17 10:11:49,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, (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-17 10:11:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1906 transitions. [2025-03-17 10:11:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 10:11:49,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:49,628 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:11:49,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:11:49,628 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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 25 more)] === [2025-03-17 10:11:49,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash -250736226, now seen corresponding path program 1 times [2025-03-17 10:11:49,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:49,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860481380] [2025-03-17 10:11:49,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:49,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:50,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 10:11:50,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 10:11:50,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:50,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:50,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:50,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860481380] [2025-03-17 10:11:50,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860481380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:50,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:50,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:50,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273731882] [2025-03-17 10:11:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:50,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:50,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:50,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:50,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:50,359 INFO L87 Difference]: Start difference. First operand 1427 states and 1906 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, (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-17 10:11:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:50,578 INFO L93 Difference]: Finished difference Result 1427 states and 1906 transitions. [2025-03-17 10:11:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:50,578 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, (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 125 [2025-03-17 10:11:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:50,600 INFO L225 Difference]: With dead ends: 1427 [2025-03-17 10:11:50,600 INFO L226 Difference]: Without dead ends: 1425 [2025-03-17 10:11:50,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:50,604 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1520 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:50,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 3083 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-03-17 10:11:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2025-03-17 10:11:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 966 states have (on average 1.274327122153209) internal successors, (1231), 1006 states have internal predecessors, (1231), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1904 transitions. [2025-03-17 10:11:50,692 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1904 transitions. Word has length 125 [2025-03-17 10:11:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:50,692 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1904 transitions. [2025-03-17 10:11:50,692 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, (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-17 10:11:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1904 transitions. [2025-03-17 10:11:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 10:11:50,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:50,696 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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-17 10:11:50,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:11:50,696 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 25 more)] === [2025-03-17 10:11:50,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:50,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1852878643, now seen corresponding path program 1 times [2025-03-17 10:11:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:50,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682582556] [2025-03-17 10:11:50,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:51,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 10:11:51,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 10:11:51,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:51,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:51,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682582556] [2025-03-17 10:11:51,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682582556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:51,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:51,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:51,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157852517] [2025-03-17 10:11:51,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:51,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:51,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:51,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:51,427 INFO L87 Difference]: Start difference. First operand 1425 states and 1904 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, (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-17 10:11:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:51,620 INFO L93 Difference]: Finished difference Result 1425 states and 1904 transitions. [2025-03-17 10:11:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:51,620 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, (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 131 [2025-03-17 10:11:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:51,632 INFO L225 Difference]: With dead ends: 1425 [2025-03-17 10:11:51,632 INFO L226 Difference]: Without dead ends: 1423 [2025-03-17 10:11:51,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:51,634 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1517 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:51,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 3079 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-03-17 10:11:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1423. [2025-03-17 10:11:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 965 states have (on average 1.2735751295336788) internal successors, (1229), 1004 states have internal predecessors, (1229), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1902 transitions. [2025-03-17 10:11:51,722 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1902 transitions. Word has length 131 [2025-03-17 10:11:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:51,722 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1902 transitions. [2025-03-17 10:11:51,722 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, (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-17 10:11:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1902 transitions. [2025-03-17 10:11:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 10:11:51,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:51,725 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:11:51,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:11:51,725 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 25 more)] === [2025-03-17 10:11:51,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash -793758536, now seen corresponding path program 1 times [2025-03-17 10:11:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055877811] [2025-03-17 10:11:51,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:52,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 10:11:52,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 10:11:52,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:52,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:52,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:52,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055877811] [2025-03-17 10:11:52,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055877811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:52,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:52,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:52,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74323485] [2025-03-17 10:11:52,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:52,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:52,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:52,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:52,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:52,550 INFO L87 Difference]: Start difference. First operand 1423 states and 1902 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, (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-17 10:11:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:52,732 INFO L93 Difference]: Finished difference Result 1423 states and 1902 transitions. [2025-03-17 10:11:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:52,732 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, (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 137 [2025-03-17 10:11:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:52,738 INFO L225 Difference]: With dead ends: 1423 [2025-03-17 10:11:52,738 INFO L226 Difference]: Without dead ends: 1421 [2025-03-17 10:11:52,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:52,739 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 1514 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:52,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 3075 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-03-17 10:11:52,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1421. [2025-03-17 10:11:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 964 states have (on average 1.2728215767634854) internal successors, (1227), 1002 states have internal predecessors, (1227), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1900 transitions. [2025-03-17 10:11:52,826 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1900 transitions. Word has length 137 [2025-03-17 10:11:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 1900 transitions. [2025-03-17 10:11:52,827 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, (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-17 10:11:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1900 transitions. [2025-03-17 10:11:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 10:11:52,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:52,829 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:11:52,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:11:52,830 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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 25 more)] === [2025-03-17 10:11:52,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 693034212, now seen corresponding path program 1 times [2025-03-17 10:11:52,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:52,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572467865] [2025-03-17 10:11:52,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:52,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:53,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 10:11:53,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 10:11:53,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:53,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:11:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:53,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572467865] [2025-03-17 10:11:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572467865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:53,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:53,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328414540] [2025-03-17 10:11:53,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:53,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:53,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:53,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:53,534 INFO L87 Difference]: Start difference. First operand 1421 states and 1900 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, (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-17 10:11:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:53,712 INFO L93 Difference]: Finished difference Result 1421 states and 1900 transitions. [2025-03-17 10:11:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:53,713 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, (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 143 [2025-03-17 10:11:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:53,720 INFO L225 Difference]: With dead ends: 1421 [2025-03-17 10:11:53,720 INFO L226 Difference]: Without dead ends: 1419 [2025-03-17 10:11:53,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:53,724 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1511 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:53,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 3071 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2025-03-17 10:11:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1419. [2025-03-17 10:11:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 963 states have (on average 1.272066458982347) internal successors, (1225), 1000 states have internal predecessors, (1225), 337 states have call successors, (337), 112 states have call predecessors, (337), 112 states have return successors, (336), 332 states have call predecessors, (336), 335 states have call successors, (336) [2025-03-17 10:11:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1898 transitions. [2025-03-17 10:11:53,826 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1898 transitions. Word has length 143 [2025-03-17 10:11:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:53,826 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 1898 transitions. [2025-03-17 10:11:53,827 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, (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-17 10:11:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1898 transitions. [2025-03-17 10:11:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 10:11:53,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:53,829 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:11:53,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 10:11:53,829 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:11:53,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1605423265, now seen corresponding path program 1 times [2025-03-17 10:11:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:53,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439462355] [2025-03-17 10:11:53,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:53,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:54,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 10:11:54,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 10:11:54,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:54,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-17 10:11:54,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:54,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439462355] [2025-03-17 10:11:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439462355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:54,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:54,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:11:54,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993401814] [2025-03-17 10:11:54,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:54,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:11:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:54,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:11:54,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:54,576 INFO L87 Difference]: Start difference. First operand 1419 states and 1898 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 10:11:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:54,859 INFO L93 Difference]: Finished difference Result 2772 states and 3725 transitions. [2025-03-17 10:11:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:11:54,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-03-17 10:11:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:54,865 INFO L225 Difference]: With dead ends: 2772 [2025-03-17 10:11:54,865 INFO L226 Difference]: Without dead ends: 1425 [2025-03-17 10:11:54,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:54,869 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 0 mSDsluCounter, 4600 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6136 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:54,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6136 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:11:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-03-17 10:11:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1423. [2025-03-17 10:11:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 966 states have (on average 1.2712215320910973) internal successors, (1228), 1003 states have internal predecessors, (1228), 337 states have call successors, (337), 112 states have call predecessors, (337), 113 states have return successors, (341), 333 states have call predecessors, (341), 335 states have call successors, (341) [2025-03-17 10:11:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1906 transitions. [2025-03-17 10:11:54,958 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1906 transitions. Word has length 145 [2025-03-17 10:11:54,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:54,958 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1906 transitions. [2025-03-17 10:11:54,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 10:11:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1906 transitions. [2025-03-17 10:11:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 10:11:54,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:54,963 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:11:54,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 10:11:54,963 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:11:54,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:54,963 INFO L85 PathProgramCache]: Analyzing trace with hash 876188173, now seen corresponding path program 1 times [2025-03-17 10:11:54,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:54,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820546616] [2025-03-17 10:11:54,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:55,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 10:11:55,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 10:11:55,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:55,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-17 10:11:55,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820546616] [2025-03-17 10:11:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820546616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:55,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:55,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:55,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710294081] [2025-03-17 10:11:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:55,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:55,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:55,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:55,757 INFO L87 Difference]: Start difference. First operand 1423 states and 1906 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:11:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:56,056 INFO L93 Difference]: Finished difference Result 2783 states and 3776 transitions. [2025-03-17 10:11:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:11:56,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2025-03-17 10:11:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:56,066 INFO L225 Difference]: With dead ends: 2783 [2025-03-17 10:11:56,066 INFO L226 Difference]: Without dead ends: 1430 [2025-03-17 10:11:56,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:11:56,072 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 4 mSDsluCounter, 3060 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4594 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:56,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4594 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:11:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-03-17 10:11:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1429. [2025-03-17 10:11:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 971 states have (on average 1.2718846549948506) internal successors, (1235), 1008 states have internal predecessors, (1235), 337 states have call successors, (337), 113 states have call predecessors, (337), 114 states have return successors, (342), 333 states have call predecessors, (342), 335 states have call successors, (342) [2025-03-17 10:11:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1914 transitions. [2025-03-17 10:11:56,165 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1914 transitions. Word has length 152 [2025-03-17 10:11:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:56,166 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1914 transitions. [2025-03-17 10:11:56,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:11:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1914 transitions. [2025-03-17 10:11:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 10:11:56,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:56,169 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:11:56,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 10:11:56,169 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:11:56,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2015441772, now seen corresponding path program 1 times [2025-03-17 10:11:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:56,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529070664] [2025-03-17 10:11:56,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:56,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 10:11:56,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 10:11:56,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:56,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-17 10:11:57,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:57,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529070664] [2025-03-17 10:11:57,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529070664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:11:57,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:11:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:11:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92000344] [2025-03-17 10:11:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:11:57,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:11:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:11:57,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:11:57,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:57,013 INFO L87 Difference]: Start difference. First operand 1429 states and 1914 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 10:11:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:11:57,259 INFO L93 Difference]: Finished difference Result 2794 states and 3793 transitions. [2025-03-17 10:11:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:11:57,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 150 [2025-03-17 10:11:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:11:57,266 INFO L225 Difference]: With dead ends: 2794 [2025-03-17 10:11:57,267 INFO L226 Difference]: Without dead ends: 1437 [2025-03-17 10:11:57,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:11:57,273 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 4 mSDsluCounter, 3060 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4596 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:11:57,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4596 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:11:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-03-17 10:11:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1433. [2025-03-17 10:11:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 975 states have (on average 1.2707692307692309) internal successors, (1239), 1012 states have internal predecessors, (1239), 337 states have call successors, (337), 113 states have call predecessors, (337), 114 states have return successors, (342), 333 states have call predecessors, (342), 335 states have call successors, (342) [2025-03-17 10:11:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1918 transitions. [2025-03-17 10:11:57,375 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1918 transitions. Word has length 150 [2025-03-17 10:11:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:11:57,376 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1918 transitions. [2025-03-17 10:11:57,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 10:11:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1918 transitions. [2025-03-17 10:11:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 10:11:57,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:11:57,379 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:11:57,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 10:11:57,379 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:11:57,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:11:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1498069949, now seen corresponding path program 1 times [2025-03-17 10:11:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:11:57,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456118640] [2025-03-17 10:11:57,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:11:57,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 10:11:57,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 10:11:57,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:57,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-17 10:11:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:11:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456118640] [2025-03-17 10:11:58,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456118640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:11:58,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299380589] [2025-03-17 10:11:58,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:11:58,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:11:58,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:11:58,409 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-17 10:11:58,410 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-17 10:11:59,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 10:11:59,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 10:11:59,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:11:59,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:11:59,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 2077 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 10:11:59,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:12:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-17 10:12:00,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:12:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-17 10:12:02,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299380589] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:12:02,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:12:02,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 17 [2025-03-17 10:12:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142009287] [2025-03-17 10:12:02,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:12:02,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 10:12:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:12:02,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 10:12:02,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-17 10:12:02,991 INFO L87 Difference]: Start difference. First operand 1433 states and 1918 transitions. Second operand has 17 states, 16 states have (on average 8.9375) internal successors, (143), 15 states have internal predecessors, (143), 5 states have call successors, (50), 2 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 5 states have call successors, (50) [2025-03-17 10:12:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:12:05,320 INFO L93 Difference]: Finished difference Result 2803 states and 3799 transitions. [2025-03-17 10:12:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 10:12:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 8.9375) internal successors, (143), 15 states have internal predecessors, (143), 5 states have call successors, (50), 2 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 5 states have call successors, (50) Word has length 153 [2025-03-17 10:12:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:12:05,327 INFO L225 Difference]: With dead ends: 2803 [2025-03-17 10:12:05,327 INFO L226 Difference]: Without dead ends: 1440 [2025-03-17 10:12:05,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-17 10:12:05,333 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 255 mSDsluCounter, 15927 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 17438 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:12:05,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 17438 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 10:12:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2025-03-17 10:12:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1437. [2025-03-17 10:12:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 978 states have (on average 1.2699386503067485) internal successors, (1242), 1016 states have internal predecessors, (1242), 337 states have call successors, (337), 113 states have call predecessors, (337), 115 states have return successors, (343), 333 states have call predecessors, (343), 335 states have call successors, (343) [2025-03-17 10:12:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1922 transitions. [2025-03-17 10:12:05,433 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1922 transitions. Word has length 153 [2025-03-17 10:12:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:12:05,434 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1922 transitions. [2025-03-17 10:12:05,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 8.9375) internal successors, (143), 15 states have internal predecessors, (143), 5 states have call successors, (50), 2 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 5 states have call successors, (50) [2025-03-17 10:12:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1922 transitions. [2025-03-17 10:12:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 10:12:05,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:12:05,441 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:12:05,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 10:12:05,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 10:12:05,642 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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 25 more)] === [2025-03-17 10:12:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:12:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash -554313841, now seen corresponding path program 1 times [2025-03-17 10:12:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:12:05,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80322360] [2025-03-17 10:12:05,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:12:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:12:06,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 10:12:06,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 10:12:06,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:12:06,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:12:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:12:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:12:06,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80322360] [2025-03-17 10:12:06,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80322360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:12:06,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:12:06,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:12:06,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204931413] [2025-03-17 10:12:06,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:12:06,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:12:06,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:12:06,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:12:06,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:12:06,355 INFO L87 Difference]: Start difference. First operand 1437 states and 1922 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, (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-17 10:12:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:12:06,546 INFO L93 Difference]: Finished difference Result 1437 states and 1922 transitions. [2025-03-17 10:12:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:12:06,547 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, (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 149 [2025-03-17 10:12:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:12:06,552 INFO L225 Difference]: With dead ends: 1437 [2025-03-17 10:12:06,553 INFO L226 Difference]: Without dead ends: 1435 [2025-03-17 10:12:06,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:12:06,554 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 1507 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 3065 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:12:06,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 3065 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:12:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-03-17 10:12:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1435. [2025-03-17 10:12:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 977 states have (on average 1.2691914022517912) internal successors, (1240), 1014 states have internal predecessors, (1240), 337 states have call successors, (337), 113 states have call predecessors, (337), 115 states have return successors, (343), 333 states have call predecessors, (343), 335 states have call successors, (343) [2025-03-17 10:12:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1920 transitions. [2025-03-17 10:12:06,653 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1920 transitions. Word has length 149 [2025-03-17 10:12:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:12:06,654 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 1920 transitions. [2025-03-17 10:12:06,654 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, (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-17 10:12:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1920 transitions. [2025-03-17 10:12:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 10:12:06,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:12:06,656 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 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] [2025-03-17 10:12:06,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 10:12:06,656 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:12:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:12:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1509191054, now seen corresponding path program 1 times [2025-03-17 10:12:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:12:06,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954116259] [2025-03-17 10:12:06,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:12:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:12:07,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 10:12:07,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 10:12:07,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:12:07,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:12:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-17 10:12:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:12:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954116259] [2025-03-17 10:12:07,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954116259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:12:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390149109] [2025-03-17 10:12:07,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:12:07,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:12:07,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:12:07,689 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-17 10:12:07,690 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-17 10:12:09,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 10:12:13,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 10:12:13,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:12:13,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:12:13,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 2110 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 10:12:13,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:12:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 10:12:13,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:12:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-17 10:12:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390149109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:12:14,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:12:14,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 10:12:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037361464] [2025-03-17 10:12:14,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:12:14,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:12:14,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:12:14,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:12:14,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:12:14,761 INFO L87 Difference]: Start difference. First operand 1435 states and 1920 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:12:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:12:15,817 INFO L93 Difference]: Finished difference Result 2819 states and 3827 transitions. [2025-03-17 10:12:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 10:12:15,818 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 158 [2025-03-17 10:12:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:12:15,824 INFO L225 Difference]: With dead ends: 2819 [2025-03-17 10:12:15,825 INFO L226 Difference]: Without dead ends: 1450 [2025-03-17 10:12:15,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2025-03-17 10:12:15,831 INFO L435 NwaCegarLoop]: 1532 mSDtfsCounter, 5 mSDsluCounter, 4585 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6117 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:12:15,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6117 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:12:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-17 10:12:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1446. [2025-03-17 10:12:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 988 states have (on average 1.2722672064777327) internal successors, (1257), 1025 states have internal predecessors, (1257), 337 states have call successors, (337), 113 states have call predecessors, (337), 115 states have return successors, (343), 333 states have call predecessors, (343), 335 states have call successors, (343) [2025-03-17 10:12:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1937 transitions. [2025-03-17 10:12:15,939 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1937 transitions. Word has length 158 [2025-03-17 10:12:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:12:15,940 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 1937 transitions. [2025-03-17 10:12:15,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:12:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1937 transitions. [2025-03-17 10:12:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 10:12:15,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:12:15,942 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:12:15,999 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-17 10:12:16,143 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,SelfDestructingSolverStorable27 [2025-03-17 10:12:16,143 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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 25 more)] === [2025-03-17 10:12:16,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:12:16,144 INFO L85 PathProgramCache]: Analyzing trace with hash 286658106, now seen corresponding path program 1 times [2025-03-17 10:12:16,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:12:16,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258564489] [2025-03-17 10:12:16,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:12:16,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:12:16,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 10:12:16,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 10:12:16,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:12:16,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:12:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 10:12:16,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:12:16,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258564489] [2025-03-17 10:12:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258564489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:12:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:12:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:12:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14984486] [2025-03-17 10:12:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:12:16,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:12:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:12:16,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:12:16,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:12:16,890 INFO L87 Difference]: Start difference. First operand 1446 states and 1937 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, (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-17 10:12:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:12:17,107 INFO L93 Difference]: Finished difference Result 1446 states and 1937 transitions. [2025-03-17 10:12:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:12:17,108 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, (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 155 [2025-03-17 10:12:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:12:17,114 INFO L225 Difference]: With dead ends: 1446 [2025-03-17 10:12:17,114 INFO L226 Difference]: Without dead ends: 1444 [2025-03-17 10:12:17,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:12:17,115 INFO L435 NwaCegarLoop]: 1531 mSDtfsCounter, 1504 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:12:17,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 3061 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:12:17,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2025-03-17 10:12:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2025-03-17 10:12:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 987 states have (on average 1.2715298885511652) internal successors, (1255), 1023 states have internal predecessors, (1255), 337 states have call successors, (337), 113 states have call predecessors, (337), 115 states have return successors, (343), 333 states have call predecessors, (343), 335 states have call successors, (343) [2025-03-17 10:12:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1935 transitions. [2025-03-17 10:12:17,222 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1935 transitions. Word has length 155 [2025-03-17 10:12:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:12:17,222 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1935 transitions. [2025-03-17 10:12:17,222 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, (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-17 10:12:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1935 transitions. [2025-03-17 10:12:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 10:12:17,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:12:17,225 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:12:17,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 10:12:17,225 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting sm_cache_flushErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-03-17 10:12:17,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:12:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1685857, now seen corresponding path program 1 times [2025-03-17 10:12:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:12:17,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160269271] [2025-03-17 10:12:17,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:12:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:12:17,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 10:12:17,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 10:12:17,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:12:17,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:12:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-17 10:12:18,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:12:18,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160269271] [2025-03-17 10:12:18,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160269271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:12:18,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926889889] [2025-03-17 10:12:18,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:12:18,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:12:18,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3