./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-09 20:29:15,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:29:15,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 20:29:15,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:29:15,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:29:15,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:29:15,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:29:15,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:29:15,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:29:15,958 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:29:15,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:29:15,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:29:15,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:29:15,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:29:15,960 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:29:15,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:29:15,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:29:15,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:29:15,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:29:15,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:29:15,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:29:15,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:29:15,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:29:15,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:29:15,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:29:15,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:29:15,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:29:15,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:29:15,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:29:15,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:29:15,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:29:15,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:29:15,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:29:15,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:29:15,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:29:15,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:29:15,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:29:15,962 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:29:15,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:29:15,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:29:15,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:29:15,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:29:15,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:29:15,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:29:15,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:29:15,963 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-jdk21/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-01-09 20:29:16,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:29:16,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:29:16,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:29:16,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:29:16,144 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:29:16,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-01-09 20:29:17,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1dc03282/67c1e293f59c4c928de689d4871f3cf6/FLAG830359ff3 [2025-01-09 20:29:17,765 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:29:17,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2025-01-09 20:29:17,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1dc03282/67c1e293f59c4c928de689d4871f3cf6/FLAG830359ff3 [2025-01-09 20:29:17,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1dc03282/67c1e293f59c4c928de689d4871f3cf6 [2025-01-09 20:29:17,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:29:17,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:29:17,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:29:17,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:29:17,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:29:17,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:29:17" (1/1) ... [2025-01-09 20:29:17,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b305ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:17, skipping insertion in model container [2025-01-09 20:29:17,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:29:17" (1/1) ... [2025-01-09 20:29:17,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:29:19,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:29:19,165 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:29:19,226 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-01-09 20:29:19,227 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-01-09 20:29:19,227 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-01-09 20:29:19,307 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-01-09 20:29:19,315 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-01-09 20:29:19,332 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-01-09 20:29:19,335 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-01-09 20:29:19,339 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-01-09 20:29:19,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 20:29:19,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:29:19,524 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:29:19,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19 WrapperNode [2025-01-09 20:29:19,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:29:19,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:29:19,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:29:19,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:29:19,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:19,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:19,654 INFO L138 Inliner]: procedures = 497, calls = 1452, calls flagged for inlining = 215, calls inlined = 136, statements flattened = 3328 [2025-01-09 20:29:19,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:29:19,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:29:19,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:29:19,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:29:19,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:19,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:19,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:19,915 INFO L175 MemorySlicer]: Split 483 memory accesses to 22 slices as follows [4, 8, 10, 6, 7, 7, 6, 3, 8, 295, 1, 2, 57, 11, 6, 7, 5, 2, 4, 8, 3, 23]. 61 percent of accesses are in the largest equivalence class. The 27 initializations are split as follows [0, 0, 0, 0, 0, 0, 0, 3, 8, 13, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 227 writes are split as follows [4, 2, 8, 0, 3, 5, 3, 0, 0, 114, 0, 0, 53, 11, 5, 1, 1, 1, 4, 6, 3, 3]. [2025-01-09 20:29:19,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:19,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:20,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:20,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:20,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:20,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:20,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:20,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:29:20,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:29:20,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:29:20,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:29:20,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (1/1) ... [2025-01-09 20:29:20,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:29:20,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:29:20,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:29:20,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:29:20,187 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mark_block_bad [2025-01-09 20:29:20,188 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mark_block_bad [2025-01-09 20:29:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:29:20,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:29:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 20:29:20,188 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 20:29:20,188 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-01-09 20:29:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-01-09 20:29:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2025-01-09 20:29:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_sm_ftl [2025-01-09 20:29:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 20:29:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 20:29:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:29:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:29:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-01-09 20:29:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-01-09 20:29:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:29:20,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:29:20,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:29:20,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:29:20,190 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_lba [2025-01-09 20:29:20,190 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_lba [2025-01-09 20:29:20,190 INFO L130 BoogieDeclarations]: Found specification of procedure sm_check_block [2025-01-09 20:29:20,190 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_check_block [2025-01-09 20:29:20,190 INFO L130 BoogieDeclarations]: Found specification of procedure sm_release [2025-01-09 20:29:20,190 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_release [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-01-09 20:29:20,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_init [2025-01-09 20:29:20,191 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_init [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 20:29:20,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:29:20,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_sector [2025-01-09 20:29:20,191 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_sector [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:29:20,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure sm_write_sector [2025-01-09 20:29:20,191 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_write_sector [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_calculate_ecc [2025-01-09 20:29:20,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_calculate_ecc [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2025-01-09 20:29:20,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-01-09 20:29:20,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure sm_remove_dev [2025-01-09 20:29:20,192 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_remove_dev [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-01-09 20:29:20,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-01-09 20:29:20,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2025-01-09 20:29:20,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_sm_ftl [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:29:20,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:29:20,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:29:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:29:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:29:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:29:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 20:29:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 20:29:20,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure sm_recheck_media [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_recheck_media [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#18 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#19 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#20 [2025-01-09 20:29:20,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#21 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 20:29:20,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#18 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#19 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#20 [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#21 [2025-01-09 20:29:20,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:29:20,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:29:20,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_put [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_put [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure sm_read_cis [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_read_cis [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_out [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_out [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2025-01-09 20:29:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2025-01-09 20:29:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure sm_cache_flush [2025-01-09 20:29:20,199 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_cache_flush [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:29:20,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 20:29:20,199 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_zone [2025-01-09 20:29:20,199 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_zone [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-01-09 20:29:20,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-01-09 20:29:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-01-09 20:29:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-01-09 20:29:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-01-09 20:29:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight16 [2025-01-09 20:29:20,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight16 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 20:29:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure sm_mkoffset [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_mkoffset [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-01-09 20:29:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 20:29:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure sm_get_lba [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_get_lba [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:29:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 20:29:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure mtd_is_eccerr [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure mtd_is_eccerr [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_in [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_in [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure __nand_correct_data [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __nand_correct_data [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 20:29:20,206 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 20:29:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:29:20,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:29:20,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure is_power_of_2 [2025-01-09 20:29:20,207 INFO L138 BoogieDeclarations]: Found implementation of procedure is_power_of_2 [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 20:29:20,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:29:20,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure sm_sector_valid [2025-01-09 20:29:20,207 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_sector_valid [2025-01-09 20:29:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure sm_erase_block [2025-01-09 20:29:20,207 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_erase_block [2025-01-09 20:29:20,211 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-01-09 20:29:20,211 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-01-09 20:29:20,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-01-09 20:29:20,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure sm_break_offset [2025-01-09 20:29:20,212 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_break_offset [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure sm_block_valid [2025-01-09 20:29:20,212 INFO L138 BoogieDeclarations]: Found implementation of procedure sm_block_valid [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:29:20,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 20:29:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 20:29:20,737 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:29:20,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:29:21,699 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 20:29:28,828 INFO L? ?]: Removed 1772 outVars from TransFormulas that were not future-live. [2025-01-09 20:29:28,828 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:29:28,862 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:29:28,863 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 20:29:28,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:29:28 BoogieIcfgContainer [2025-01-09 20:29:28,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:29:28,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:29:28,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:29:28,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:29:28,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:29:17" (1/3) ... [2025-01-09 20:29:28,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a33d938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:29:28, skipping insertion in model container [2025-01-09 20:29:28,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:29:19" (2/3) ... [2025-01-09 20:29:28,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a33d938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:29:28, skipping insertion in model container [2025-01-09 20:29:28,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:29:28" (3/3) ... [2025-01-09 20:29:28,871 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i [2025-01-09 20:29:28,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:29:28,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--mtd--sm_ftl.ko.cil.i that has 122 procedures, 1431 locations, 1 initial locations, 66 loop locations, and 27 error locations. [2025-01-09 20:29:28,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:29:28,944 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;@350353bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:29:28,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-09 20:29:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 1241 states, 854 states have (on average 1.3220140515222483) internal successors, (1129), 905 states have internal predecessors, (1129), 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-01-09 20:29:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 20:29:28,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:28,955 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] [2025-01-09 20:29:28,955 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-01-09 20:29:28,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2103888352, now seen corresponding path program 1 times [2025-01-09 20:29:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:28,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756253811] [2025-01-09 20:29:28,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:29,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 20:29:29,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 20:29:29,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:29,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:30,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:30,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756253811] [2025-01-09 20:29:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756253811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:30,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:30,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608739951] [2025-01-09 20:29:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:30,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:30,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:30,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:30,389 INFO L87 Difference]: Start difference. First operand has 1241 states, 854 states have (on average 1.3220140515222483) internal successors, (1129), 905 states have internal predecessors, (1129), 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 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-01-09 20:29:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:30,629 INFO L93 Difference]: Finished difference Result 2451 states and 3430 transitions. [2025-01-09 20:29:30,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:30,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 62 [2025-01-09 20:29:30,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:30,653 INFO L225 Difference]: With dead ends: 2451 [2025-01-09 20:29:30,653 INFO L226 Difference]: Without dead ends: 1225 [2025-01-09 20:29:30,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:30,667 INFO L435 NwaCegarLoop]: 1647 mSDtfsCounter, 1625 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 3293 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:30,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 3293 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-01-09 20:29:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2025-01-09 20:29:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 844 states have (on average 1.2808056872037914) internal successors, (1081), 892 states have internal predecessors, (1081), 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-01-09 20:29:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1635 transitions. [2025-01-09 20:29:30,792 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1635 transitions. Word has length 62 [2025-01-09 20:29:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:30,796 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1635 transitions. [2025-01-09 20:29:30,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-01-09 20:29:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1635 transitions. [2025-01-09 20:29:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:29:30,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:30,800 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] [2025-01-09 20:29:30,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:29:30,801 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-01-09 20:29:30,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash -686532870, now seen corresponding path program 1 times [2025-01-09 20:29:30,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:30,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355024271] [2025-01-09 20:29:30,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:31,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:29:31,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:29:31,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:31,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:31,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:31,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355024271] [2025-01-09 20:29:31,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355024271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:31,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:31,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:31,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059557790] [2025-01-09 20:29:31,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:31,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:31,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:31,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:31,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:31,835 INFO L87 Difference]: Start difference. First operand 1225 states and 1635 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-01-09 20:29:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:31,942 INFO L93 Difference]: Finished difference Result 1225 states and 1635 transitions. [2025-01-09 20:29:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:31,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 68 [2025-01-09 20:29:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:31,954 INFO L225 Difference]: With dead ends: 1225 [2025-01-09 20:29:31,954 INFO L226 Difference]: Without dead ends: 1223 [2025-01-09 20:29:31,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:31,956 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 1608 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:31,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 3261 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-01-09 20:29:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2025-01-09 20:29:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 843 states have (on average 1.2799525504151839) internal successors, (1079), 890 states have internal predecessors, (1079), 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-01-09 20:29:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1633 transitions. [2025-01-09 20:29:32,047 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1633 transitions. Word has length 68 [2025-01-09 20:29:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:32,049 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1633 transitions. [2025-01-09 20:29:32,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-01-09 20:29:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1633 transitions. [2025-01-09 20:29:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 20:29:32,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:32,051 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, 1, 1] [2025-01-09 20:29:32,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:29:32,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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-01-09 20:29:32,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:32,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1556455587, now seen corresponding path program 1 times [2025-01-09 20:29:32,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:32,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259457825] [2025-01-09 20:29:32,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:32,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:32,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 20:29:32,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 20:29:32,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:32,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:29:33,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:33,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259457825] [2025-01-09 20:29:33,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259457825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:33,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:33,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:29:33,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880028753] [2025-01-09 20:29:33,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:33,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:29:33,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:33,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:29:33,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:29:33,497 INFO L87 Difference]: Start difference. First operand 1223 states and 1633 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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-01-09 20:29:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:33,913 INFO L93 Difference]: Finished difference Result 2680 states and 3523 transitions. [2025-01-09 20:29:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:29:33,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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 74 [2025-01-09 20:29:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:33,920 INFO L225 Difference]: With dead ends: 2680 [2025-01-09 20:29:33,920 INFO L226 Difference]: Without dead ends: 1466 [2025-01-09 20:29:33,923 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-01-09 20:29:33,924 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 271 mSDsluCounter, 6504 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 8135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:33,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 8135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:29:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2025-01-09 20:29:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1279. [2025-01-09 20:29:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 878 states have (on average 1.2710706150341686) internal successors, (1116), 927 states have internal predecessors, (1116), 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-01-09 20:29:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1695 transitions. [2025-01-09 20:29:33,975 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1695 transitions. Word has length 74 [2025-01-09 20:29:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:33,975 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1695 transitions. [2025-01-09 20:29:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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-01-09 20:29:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1695 transitions. [2025-01-09 20:29:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 20:29:33,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:33,976 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] [2025-01-09 20:29:33,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:29:33,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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-01-09 20:29:33,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash 56580618, now seen corresponding path program 1 times [2025-01-09 20:29:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:33,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872067185] [2025-01-09 20:29:33,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:33,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:34,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 20:29:34,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 20:29:34,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:34,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:34,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:34,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872067185] [2025-01-09 20:29:34,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872067185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:34,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:34,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:34,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125832535] [2025-01-09 20:29:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:34,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:34,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:34,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:34,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:34,803 INFO L87 Difference]: Start difference. First operand 1279 states and 1695 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-01-09 20:29:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:34,888 INFO L93 Difference]: Finished difference Result 1279 states and 1695 transitions. [2025-01-09 20:29:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:34,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 74 [2025-01-09 20:29:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:34,894 INFO L225 Difference]: With dead ends: 1279 [2025-01-09 20:29:34,894 INFO L226 Difference]: Without dead ends: 1277 [2025-01-09 20:29:34,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:34,895 INFO L435 NwaCegarLoop]: 1629 mSDtfsCounter, 1605 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 3257 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:34,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 3257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-01-09 20:29:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2025-01-09 20:29:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 877 states have (on average 1.2702394526795895) internal successors, (1114), 925 states have internal predecessors, (1114), 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-01-09 20:29:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1693 transitions. [2025-01-09 20:29:34,934 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1693 transitions. Word has length 74 [2025-01-09 20:29:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:34,935 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1693 transitions. [2025-01-09 20:29:34,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-01-09 20:29:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1693 transitions. [2025-01-09 20:29:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 20:29:34,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:34,936 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] [2025-01-09 20:29:34,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:29:34,936 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-01-09 20:29:34,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1301840116, now seen corresponding path program 1 times [2025-01-09 20:29:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:34,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765260116] [2025-01-09 20:29:34,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:34,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:35,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 20:29:35,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 20:29:35,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:35,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:35,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765260116] [2025-01-09 20:29:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765260116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:35,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:35,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896083551] [2025-01-09 20:29:35,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:35,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:35,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:35,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:35,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:35,872 INFO L87 Difference]: Start difference. First operand 1277 states and 1693 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-01-09 20:29:35,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:35,936 INFO L93 Difference]: Finished difference Result 1277 states and 1693 transitions. [2025-01-09 20:29:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:35,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 80 [2025-01-09 20:29:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:35,941 INFO L225 Difference]: With dead ends: 1277 [2025-01-09 20:29:35,941 INFO L226 Difference]: Without dead ends: 1275 [2025-01-09 20:29:35,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:35,942 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1602 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:35,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 3253 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2025-01-09 20:29:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2025-01-09 20:29:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 876 states have (on average 1.269406392694064) internal successors, (1112), 923 states have internal predecessors, (1112), 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-01-09 20:29:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1691 transitions. [2025-01-09 20:29:36,026 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1691 transitions. Word has length 80 [2025-01-09 20:29:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:36,026 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1691 transitions. [2025-01-09 20:29:36,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-01-09 20:29:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1691 transitions. [2025-01-09 20:29:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 20:29:36,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:36,028 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] [2025-01-09 20:29:36,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:29:36,028 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-01-09 20:29:36,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1864326259, now seen corresponding path program 1 times [2025-01-09 20:29:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610809518] [2025-01-09 20:29:36,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:36,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 20:29:36,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 20:29:36,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:36,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:36,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610809518] [2025-01-09 20:29:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610809518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:36,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:36,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213059609] [2025-01-09 20:29:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:36,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:36,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:36,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:36,682 INFO L87 Difference]: Start difference. First operand 1275 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-01-09 20:29:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:36,792 INFO L93 Difference]: Finished difference Result 1275 states and 1691 transitions. [2025-01-09 20:29:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:36,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 86 [2025-01-09 20:29:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:36,797 INFO L225 Difference]: With dead ends: 1275 [2025-01-09 20:29:36,797 INFO L226 Difference]: Without dead ends: 1273 [2025-01-09 20:29:36,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:36,798 INFO L435 NwaCegarLoop]: 1625 mSDtfsCounter, 1599 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:36,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 3249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-01-09 20:29:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1273. [2025-01-09 20:29:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 875 states have (on average 1.2685714285714285) internal successors, (1110), 921 states have internal predecessors, (1110), 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-01-09 20:29:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1689 transitions. [2025-01-09 20:29:36,842 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1689 transitions. Word has length 86 [2025-01-09 20:29:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:36,842 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1689 transitions. [2025-01-09 20:29:36,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-01-09 20:29:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1689 transitions. [2025-01-09 20:29:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 20:29:36,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:36,843 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] [2025-01-09 20:29:36,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:29:36,843 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-01-09 20:29:36,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash 203868573, now seen corresponding path program 1 times [2025-01-09 20:29:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:36,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409682144] [2025-01-09 20:29:36,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:37,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 20:29:37,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 20:29:37,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:37,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 20:29:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:37,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409682144] [2025-01-09 20:29:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409682144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:37,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:29:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246550551] [2025-01-09 20:29:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:37,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:29:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:37,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:29:37,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:37,798 INFO L87 Difference]: Start difference. First operand 1273 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-01-09 20:29:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:37,920 INFO L93 Difference]: Finished difference Result 1512 states and 1995 transitions. [2025-01-09 20:29:37,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:29:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 90 [2025-01-09 20:29:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:37,927 INFO L225 Difference]: With dead ends: 1512 [2025-01-09 20:29:37,928 INFO L226 Difference]: Without dead ends: 1510 [2025-01-09 20:29:37,928 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-01-09 20:29:37,929 INFO L435 NwaCegarLoop]: 1866 mSDtfsCounter, 931 mSDsluCounter, 4700 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 6566 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:37,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 6566 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2025-01-09 20:29:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1506. [2025-01-09 20:29:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1036 states have (on average 1.2722007722007722) internal successors, (1318), 1087 states have internal predecessors, (1318), 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-01-09 20:29:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1991 transitions. [2025-01-09 20:29:37,994 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1991 transitions. Word has length 90 [2025-01-09 20:29:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:37,994 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1991 transitions. [2025-01-09 20:29:37,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-01-09 20:29:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1991 transitions. [2025-01-09 20:29:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 20:29:37,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:37,996 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] [2025-01-09 20:29:37,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:29:37,997 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-01-09 20:29:37,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash 575714052, now seen corresponding path program 1 times [2025-01-09 20:29:37,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:37,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976838698] [2025-01-09 20:29:37,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:37,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:38,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 20:29:38,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 20:29:38,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:38,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:38,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:38,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976838698] [2025-01-09 20:29:38,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976838698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:38,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:38,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:38,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419706602] [2025-01-09 20:29:38,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:38,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:38,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:38,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:38,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:38,820 INFO L87 Difference]: Start difference. First operand 1506 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-01-09 20:29:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:38,941 INFO L93 Difference]: Finished difference Result 1506 states and 1991 transitions. [2025-01-09 20:29:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:38,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 92 [2025-01-09 20:29:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:38,948 INFO L225 Difference]: With dead ends: 1506 [2025-01-09 20:29:38,948 INFO L226 Difference]: Without dead ends: 1504 [2025-01-09 20:29:38,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:38,949 INFO L435 NwaCegarLoop]: 1621 mSDtfsCounter, 1594 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:38,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 3241 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-01-09 20:29:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2025-01-09 20:29:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1035 states have (on average 1.2714975845410628) internal successors, (1316), 1085 states have internal predecessors, (1316), 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-01-09 20:29:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1989 transitions. [2025-01-09 20:29:39,052 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1989 transitions. Word has length 92 [2025-01-09 20:29:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:39,053 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 1989 transitions. [2025-01-09 20:29:39,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-01-09 20:29:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1989 transitions. [2025-01-09 20:29:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 20:29:39,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:39,056 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] [2025-01-09 20:29:39,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:29:39,056 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-01-09 20:29:39,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -381418851, now seen corresponding path program 1 times [2025-01-09 20:29:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747854457] [2025-01-09 20:29:39,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:39,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 20:29:39,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 20:29:39,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:39,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:39,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:39,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747854457] [2025-01-09 20:29:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747854457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:39,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:39,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167812470] [2025-01-09 20:29:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:39,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:39,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:39,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:39,876 INFO L87 Difference]: Start difference. First operand 1504 states and 1989 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-09 20:29:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:39,957 INFO L93 Difference]: Finished difference Result 1504 states and 1989 transitions. [2025-01-09 20:29:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:39,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 98 [2025-01-09 20:29:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:39,963 INFO L225 Difference]: With dead ends: 1504 [2025-01-09 20:29:39,963 INFO L226 Difference]: Without dead ends: 1502 [2025-01-09 20:29:39,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:39,966 INFO L435 NwaCegarLoop]: 1619 mSDtfsCounter, 1591 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:39,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 3237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-01-09 20:29:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2025-01-09 20:29:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1034 states have (on average 1.2707930367504836) internal successors, (1314), 1083 states have internal predecessors, (1314), 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-01-09 20:29:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1987 transitions. [2025-01-09 20:29:40,091 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1987 transitions. Word has length 98 [2025-01-09 20:29:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:40,092 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1987 transitions. [2025-01-09 20:29:40,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-09 20:29:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1987 transitions. [2025-01-09 20:29:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 20:29:40,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:40,094 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] [2025-01-09 20:29:40,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:29:40,094 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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-01-09 20:29:40,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1732185645, now seen corresponding path program 1 times [2025-01-09 20:29:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:40,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091013710] [2025-01-09 20:29:40,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:40,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:40,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 20:29:40,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 20:29:40,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:40,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 20:29:41,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091013710] [2025-01-09 20:29:41,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091013710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:41,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:29:41,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209134370] [2025-01-09 20:29:41,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:41,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:29:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:41,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:29:41,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:29:41,666 INFO L87 Difference]: Start difference. First operand 1502 states and 1987 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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-01-09 20:29:45,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:29:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:49,448 INFO L93 Difference]: Finished difference Result 2927 states and 3893 transitions. [2025-01-09 20:29:49,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:29:49,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 99 [2025-01-09 20:29:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:49,457 INFO L225 Difference]: With dead ends: 2927 [2025-01-09 20:29:49,457 INFO L226 Difference]: Without dead ends: 1502 [2025-01-09 20:29:49,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:29:49,462 INFO L435 NwaCegarLoop]: 1617 mSDtfsCounter, 1577 mSDsluCounter, 4296 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 5913 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:49,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 5913 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 571 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2025-01-09 20:29:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2025-01-09 20:29:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2025-01-09 20:29:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1034 states have (on average 1.2688588007736943) internal successors, (1312), 1083 states have internal predecessors, (1312), 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-01-09 20:29:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1985 transitions. [2025-01-09 20:29:49,533 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1985 transitions. Word has length 99 [2025-01-09 20:29:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:49,534 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1985 transitions. [2025-01-09 20:29:49,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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-01-09 20:29:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1985 transitions. [2025-01-09 20:29:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 20:29:49,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:49,536 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] [2025-01-09 20:29:49,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:29:49,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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-01-09 20:29:49,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1732126063, now seen corresponding path program 1 times [2025-01-09 20:29:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282075184] [2025-01-09 20:29:49,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:50,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 20:29:50,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 20:29:50,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:50,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 20:29:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282075184] [2025-01-09 20:29:50,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282075184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:50,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:50,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:50,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466839681] [2025-01-09 20:29:50,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:50,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:50,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:50,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:50,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:50,498 INFO L87 Difference]: Start difference. First operand 1502 states and 1985 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-01-09 20:29:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:50,612 INFO L93 Difference]: Finished difference Result 1502 states and 1985 transitions. [2025-01-09 20:29:50,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:50,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 99 [2025-01-09 20:29:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:50,624 INFO L225 Difference]: With dead ends: 1502 [2025-01-09 20:29:50,624 INFO L226 Difference]: Without dead ends: 1500 [2025-01-09 20:29:50,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:50,626 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 0 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4844 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:50,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4844 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2025-01-09 20:29:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1500. [2025-01-09 20:29:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1033 states have (on average 1.2671829622458857) internal successors, (1309), 1081 states have internal predecessors, (1309), 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-01-09 20:29:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1982 transitions. [2025-01-09 20:29:50,698 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1982 transitions. Word has length 99 [2025-01-09 20:29:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:50,699 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1982 transitions. [2025-01-09 20:29:50,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-01-09 20:29:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1982 transitions. [2025-01-09 20:29:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 20:29:50,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:50,700 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] [2025-01-09 20:29:50,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:29:50,700 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-01-09 20:29:50,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1779819676, now seen corresponding path program 1 times [2025-01-09 20:29:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586098295] [2025-01-09 20:29:50,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:51,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 20:29:51,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 20:29:51,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:51,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:51,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:51,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586098295] [2025-01-09 20:29:51,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586098295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:51,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:51,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:51,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273267779] [2025-01-09 20:29:51,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:51,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:51,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:51,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:51,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:51,537 INFO L87 Difference]: Start difference. First operand 1500 states and 1982 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-09 20:29:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:51,629 INFO L93 Difference]: Finished difference Result 1500 states and 1982 transitions. [2025-01-09 20:29:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:51,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 104 [2025-01-09 20:29:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:51,635 INFO L225 Difference]: With dead ends: 1500 [2025-01-09 20:29:51,635 INFO L226 Difference]: Without dead ends: 1498 [2025-01-09 20:29:51,636 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-01-09 20:29:51,636 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1585 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 3227 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:51,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 3227 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-01-09 20:29:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1498. [2025-01-09 20:29:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1032 states have (on average 1.2664728682170543) internal successors, (1307), 1079 states have internal predecessors, (1307), 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-01-09 20:29:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1980 transitions. [2025-01-09 20:29:51,696 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1980 transitions. Word has length 104 [2025-01-09 20:29:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:51,696 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1980 transitions. [2025-01-09 20:29:51,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-09 20:29:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1980 transitions. [2025-01-09 20:29:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 20:29:51,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:51,698 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] [2025-01-09 20:29:51,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:29:51,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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-01-09 20:29:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1644805143, now seen corresponding path program 1 times [2025-01-09 20:29:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624095926] [2025-01-09 20:29:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:52,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 20:29:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 20:29:52,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:52,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 20:29:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624095926] [2025-01-09 20:29:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624095926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:29:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230947325] [2025-01-09 20:29:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:52,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:29:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:52,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:29:52,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:29:52,625 INFO L87 Difference]: Start difference. First operand 1498 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-01-09 20:29:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:52,690 INFO L93 Difference]: Finished difference Result 2913 states and 3872 transitions. [2025-01-09 20:29:52,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:29:52,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 103 [2025-01-09 20:29:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:52,698 INFO L225 Difference]: With dead ends: 2913 [2025-01-09 20:29:52,698 INFO L226 Difference]: Without dead ends: 1492 [2025-01-09 20:29:52,701 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-01-09 20:29:52,702 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 1572 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:52,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 1610 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-01-09 20:29:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2025-01-09 20:29:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1027 states have (on average 1.263875365141188) internal successors, (1298), 1073 states have internal predecessors, (1298), 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-01-09 20:29:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1971 transitions. [2025-01-09 20:29:52,796 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1971 transitions. Word has length 103 [2025-01-09 20:29:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:52,797 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1971 transitions. [2025-01-09 20:29:52,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-01-09 20:29:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1971 transitions. [2025-01-09 20:29:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 20:29:52,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:52,799 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, 1, 1] [2025-01-09 20:29:52,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:29:52,799 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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-01-09 20:29:52,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -869596816, now seen corresponding path program 1 times [2025-01-09 20:29:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594681931] [2025-01-09 20:29:52,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:53,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 20:29:53,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 20:29:53,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:53,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 20:29:53,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:53,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594681931] [2025-01-09 20:29:53,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594681931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:53,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:53,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:29:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113716002] [2025-01-09 20:29:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:53,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:29:53,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:53,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:29:53,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:53,707 INFO L87 Difference]: Start difference. First operand 1492 states and 1971 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-01-09 20:29:57,731 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-01-09 20:29:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:57,933 INFO L93 Difference]: Finished difference Result 1492 states and 1971 transitions. [2025-01-09 20:29:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:29:57,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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 108 [2025-01-09 20:29:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:57,941 INFO L225 Difference]: With dead ends: 1492 [2025-01-09 20:29:57,941 INFO L226 Difference]: Without dead ends: 1490 [2025-01-09 20:29:57,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 20:29:57,942 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 957 mSDsluCounter, 4258 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 5918 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:57,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 5918 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 20:29:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-01-09 20:29:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2025-01-09 20:29:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1026 states have (on average 1.263157894736842) internal successors, (1296), 1071 states have internal predecessors, (1296), 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-01-09 20:29:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1969 transitions. [2025-01-09 20:29:58,024 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1969 transitions. Word has length 108 [2025-01-09 20:29:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:58,024 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1969 transitions. [2025-01-09 20:29:58,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 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-01-09 20:29:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1969 transitions. [2025-01-09 20:29:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 20:29:58,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:58,026 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] [2025-01-09 20:29:58,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:29:58,026 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-01-09 20:29:58,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1009896703, now seen corresponding path program 1 times [2025-01-09 20:29:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:58,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989825920] [2025-01-09 20:29:58,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:58,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 20:29:58,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 20:29:58,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:58,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989825920] [2025-01-09 20:29:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989825920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283181693] [2025-01-09 20:29:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:58,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:58,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:58,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:58,779 INFO L87 Difference]: Start difference. First operand 1490 states and 1969 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 20:29:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:58,930 INFO L93 Difference]: Finished difference Result 1490 states and 1969 transitions. [2025-01-09 20:29:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:58,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-01-09 20:29:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:58,937 INFO L225 Difference]: With dead ends: 1490 [2025-01-09 20:29:58,937 INFO L226 Difference]: Without dead ends: 1488 [2025-01-09 20:29:58,938 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-01-09 20:29:58,939 INFO L435 NwaCegarLoop]: 1605 mSDtfsCounter, 1574 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:58,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 3209 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2025-01-09 20:29:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2025-01-09 20:29:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1025 states have (on average 1.262439024390244) internal successors, (1294), 1069 states have internal predecessors, (1294), 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-01-09 20:29:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1967 transitions. [2025-01-09 20:29:59,065 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1967 transitions. Word has length 106 [2025-01-09 20:29:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:59,065 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1967 transitions. [2025-01-09 20:29:59,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-01-09 20:29:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1967 transitions. [2025-01-09 20:29:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 20:29:59,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:59,067 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] [2025-01-09 20:29:59,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:29:59,068 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-01-09 20:29:59,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash 779114621, now seen corresponding path program 1 times [2025-01-09 20:29:59,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:59,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112449021] [2025-01-09 20:29:59,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:59,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 20:29:59,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 20:29:59,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:59,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:59,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:59,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112449021] [2025-01-09 20:29:59,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112449021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:59,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:59,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:59,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826311268] [2025-01-09 20:29:59,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:59,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:59,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:59,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:59,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:59,805 INFO L87 Difference]: Start difference. First operand 1488 states and 1967 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-01-09 20:29:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:59,890 INFO L93 Difference]: Finished difference Result 1488 states and 1967 transitions. [2025-01-09 20:29:59,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:59,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 112 [2025-01-09 20:29:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:59,894 INFO L225 Difference]: With dead ends: 1488 [2025-01-09 20:29:59,894 INFO L226 Difference]: Without dead ends: 1486 [2025-01-09 20:29:59,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:59,895 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 1573 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:59,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 3205 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-01-09 20:29:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2025-01-09 20:29:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1024 states have (on average 1.26171875) internal successors, (1292), 1067 states have internal predecessors, (1292), 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-01-09 20:29:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1965 transitions. [2025-01-09 20:29:59,957 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1965 transitions. Word has length 112 [2025-01-09 20:29:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:59,957 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 1965 transitions. [2025-01-09 20:29:59,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-01-09 20:29:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1965 transitions. [2025-01-09 20:29:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 20:29:59,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:59,959 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] [2025-01-09 20:29:59,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:29:59,959 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-01-09 20:29:59,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:59,959 INFO L85 PathProgramCache]: Analyzing trace with hash 416304117, now seen corresponding path program 1 times [2025-01-09 20:29:59,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:59,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525652900] [2025-01-09 20:29:59,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:00,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 20:30:00,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 20:30:00,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:00,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:30:00,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:00,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525652900] [2025-01-09 20:30:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525652900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:00,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:00,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070840868] [2025-01-09 20:30:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:00,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:00,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:00,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:00,685 INFO L87 Difference]: Start difference. First operand 1486 states and 1965 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-01-09 20:30:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:00,836 INFO L93 Difference]: Finished difference Result 1486 states and 1965 transitions. [2025-01-09 20:30:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 118 [2025-01-09 20:30:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:00,842 INFO L225 Difference]: With dead ends: 1486 [2025-01-09 20:30:00,842 INFO L226 Difference]: Without dead ends: 1484 [2025-01-09 20:30:00,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:30:00,843 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 1570 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:00,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 3201 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-01-09 20:30:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2025-01-09 20:30:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1023 states have (on average 1.2609970674486803) internal successors, (1290), 1065 states have internal predecessors, (1290), 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-01-09 20:30:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1963 transitions. [2025-01-09 20:30:00,952 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1963 transitions. Word has length 118 [2025-01-09 20:30:00,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:00,953 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1963 transitions. [2025-01-09 20:30:00,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-01-09 20:30:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1963 transitions. [2025-01-09 20:30:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 20:30:00,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:00,955 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] [2025-01-09 20:30:00,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:30:00,955 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-01-09 20:30:00,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash -159543557, now seen corresponding path program 1 times [2025-01-09 20:30:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:00,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101541962] [2025-01-09 20:30:00,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:01,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 20:30:01,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 20:30:01,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:01,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:30:01,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:01,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101541962] [2025-01-09 20:30:01,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101541962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:01,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:01,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:01,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857019855] [2025-01-09 20:30:01,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:01,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:01,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:01,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:01,679 INFO L87 Difference]: Start difference. First operand 1484 states and 1963 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, (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-01-09 20:30:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:01,812 INFO L93 Difference]: Finished difference Result 1484 states and 1963 transitions. [2025-01-09 20:30:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:01,813 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, (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 124 [2025-01-09 20:30:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:01,818 INFO L225 Difference]: With dead ends: 1484 [2025-01-09 20:30:01,818 INFO L226 Difference]: Without dead ends: 1482 [2025-01-09 20:30:01,818 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-01-09 20:30:01,818 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 1567 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 3197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:01,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 3197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-01-09 20:30:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-01-09 20:30:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1022 states have (on average 1.2602739726027397) internal successors, (1288), 1063 states have internal predecessors, (1288), 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-01-09 20:30:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1961 transitions. [2025-01-09 20:30:01,886 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1961 transitions. Word has length 124 [2025-01-09 20:30:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:01,887 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1961 transitions. [2025-01-09 20:30:01,887 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, (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-01-09 20:30:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1961 transitions. [2025-01-09 20:30:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 20:30:01,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:01,889 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] [2025-01-09 20:30:01,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:30:01,889 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-01-09 20:30:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 548458967, now seen corresponding path program 1 times [2025-01-09 20:30:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338951443] [2025-01-09 20:30:01,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:02,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 20:30:02,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 20:30:02,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:02,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:30:02,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:02,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338951443] [2025-01-09 20:30:02,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338951443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:02,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278351361] [2025-01-09 20:30:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:02,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:02,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:02,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:02,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:02,552 INFO L87 Difference]: Start difference. First operand 1482 states and 1961 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-01-09 20:30:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:02,651 INFO L93 Difference]: Finished difference Result 1482 states and 1961 transitions. [2025-01-09 20:30:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 130 [2025-01-09 20:30:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:02,656 INFO L225 Difference]: With dead ends: 1482 [2025-01-09 20:30:02,656 INFO L226 Difference]: Without dead ends: 1480 [2025-01-09 20:30:02,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:30:02,657 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 1564 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:02,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 3193 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-01-09 20:30:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2025-01-09 20:30:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1021 states have (on average 1.2595494613124387) internal successors, (1286), 1061 states have internal predecessors, (1286), 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-01-09 20:30:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1959 transitions. [2025-01-09 20:30:02,729 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1959 transitions. Word has length 130 [2025-01-09 20:30:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:02,729 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 1959 transitions. [2025-01-09 20:30:02,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-01-09 20:30:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1959 transitions. [2025-01-09 20:30:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 20:30:02,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:02,731 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] [2025-01-09 20:30:02,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:30:02,732 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-01-09 20:30:02,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:02,732 INFO L85 PathProgramCache]: Analyzing trace with hash -769401392, now seen corresponding path program 1 times [2025-01-09 20:30:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:02,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142581910] [2025-01-09 20:30:02,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:02,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:03,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 20:30:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 20:30:03,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:30:03,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:03,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142581910] [2025-01-09 20:30:03,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142581910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:03,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:03,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:03,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571635155] [2025-01-09 20:30:03,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:03,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:03,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:03,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:03,553 INFO L87 Difference]: Start difference. First operand 1480 states and 1959 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-01-09 20:30:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:03,690 INFO L93 Difference]: Finished difference Result 1480 states and 1959 transitions. [2025-01-09 20:30:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:03,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 136 [2025-01-09 20:30:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:03,699 INFO L225 Difference]: With dead ends: 1480 [2025-01-09 20:30:03,699 INFO L226 Difference]: Without dead ends: 1478 [2025-01-09 20:30:03,699 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-01-09 20:30:03,699 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1561 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 3189 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:03,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 3189 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-01-09 20:30:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1478. [2025-01-09 20:30:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1020 states have (on average 1.2588235294117647) internal successors, (1284), 1059 states have internal predecessors, (1284), 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-01-09 20:30:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1957 transitions. [2025-01-09 20:30:03,780 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1957 transitions. Word has length 136 [2025-01-09 20:30:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:03,780 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1957 transitions. [2025-01-09 20:30:03,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-01-09 20:30:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1957 transitions. [2025-01-09 20:30:03,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 20:30:03,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:03,783 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] [2025-01-09 20:30:03,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:30:03,783 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-01-09 20:30:03,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash 369094305, now seen corresponding path program 1 times [2025-01-09 20:30:03,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:03,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90583478] [2025-01-09 20:30:03,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:04,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 20:30:04,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 20:30:04,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:04,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:30:04,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:04,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90583478] [2025-01-09 20:30:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90583478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:04,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:04,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410789356] [2025-01-09 20:30:04,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:04,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:04,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:04,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:04,476 INFO L87 Difference]: Start difference. First operand 1478 states and 1957 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-01-09 20:30:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:04,629 INFO L93 Difference]: Finished difference Result 1478 states and 1957 transitions. [2025-01-09 20:30:04,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 142 [2025-01-09 20:30:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:04,635 INFO L225 Difference]: With dead ends: 1478 [2025-01-09 20:30:04,635 INFO L226 Difference]: Without dead ends: 1476 [2025-01-09 20:30:04,635 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-01-09 20:30:04,635 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1558 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:04,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 3185 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2025-01-09 20:30:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1476. [2025-01-09 20:30:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1019 states have (on average 1.2580961727183513) internal successors, (1282), 1057 states have internal predecessors, (1282), 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-01-09 20:30:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1955 transitions. [2025-01-09 20:30:04,752 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1955 transitions. Word has length 142 [2025-01-09 20:30:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:04,752 INFO L471 AbstractCegarLoop]: Abstraction has 1476 states and 1955 transitions. [2025-01-09 20:30:04,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-01-09 20:30:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1955 transitions. [2025-01-09 20:30:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 20:30:04,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:04,755 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] [2025-01-09 20:30:04,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:30:04,756 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-01-09 20:30:04,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:04,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1186219151, now seen corresponding path program 1 times [2025-01-09 20:30:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314829113] [2025-01-09 20:30:04,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:05,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 20:30:05,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 20:30:05,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:05,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:30:05,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314829113] [2025-01-09 20:30:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314829113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:05,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:05,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126742233] [2025-01-09 20:30:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:05,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:05,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:05,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:05,523 INFO L87 Difference]: Start difference. First operand 1476 states and 1955 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-01-09 20:30:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:05,703 INFO L93 Difference]: Finished difference Result 1476 states and 1955 transitions. [2025-01-09 20:30:05,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:05,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 148 [2025-01-09 20:30:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:05,713 INFO L225 Difference]: With dead ends: 1476 [2025-01-09 20:30:05,716 INFO L226 Difference]: Without dead ends: 1474 [2025-01-09 20:30:05,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:30:05,723 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1555 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:05,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 3181 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2025-01-09 20:30:05,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2025-01-09 20:30:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1018 states have (on average 1.2573673870333988) internal successors, (1280), 1055 states have internal predecessors, (1280), 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-01-09 20:30:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1953 transitions. [2025-01-09 20:30:05,837 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1953 transitions. Word has length 148 [2025-01-09 20:30:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:05,837 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 1953 transitions. [2025-01-09 20:30:05,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-01-09 20:30:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1953 transitions. [2025-01-09 20:30:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 20:30:05,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:05,839 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] [2025-01-09 20:30:05,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:30:05,840 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-01-09 20:30:05,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1989339847, now seen corresponding path program 1 times [2025-01-09 20:30:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:05,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097316952] [2025-01-09 20:30:05,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:06,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 20:30:06,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 20:30:06,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:06,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 20:30:06,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:06,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097316952] [2025-01-09 20:30:06,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097316952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:06,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:06,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:30:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103623592] [2025-01-09 20:30:06,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:06,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:30:06,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:06,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:30:06,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:30:06,731 INFO L87 Difference]: Start difference. First operand 1474 states and 1953 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-01-09 20:30:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:06,873 INFO L93 Difference]: Finished difference Result 2877 states and 3830 transitions. [2025-01-09 20:30:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:30:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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 149 [2025-01-09 20:30:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:06,878 INFO L225 Difference]: With dead ends: 2877 [2025-01-09 20:30:06,878 INFO L226 Difference]: Without dead ends: 1480 [2025-01-09 20:30:06,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:30:06,882 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 0 mSDsluCounter, 4765 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6356 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:06,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6356 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:30:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-01-09 20:30:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1478. [2025-01-09 20:30:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1021 states have (on average 1.256611165523996) internal successors, (1283), 1058 states have internal predecessors, (1283), 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-01-09 20:30:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1961 transitions. [2025-01-09 20:30:06,965 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1961 transitions. Word has length 149 [2025-01-09 20:30:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:06,965 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1961 transitions. [2025-01-09 20:30:06,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-01-09 20:30:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1961 transitions. [2025-01-09 20:30:06,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 20:30:06,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:06,968 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] [2025-01-09 20:30:06,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 20:30:06,968 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-01-09 20:30:06,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:06,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1987271879, now seen corresponding path program 1 times [2025-01-09 20:30:06,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:06,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032593297] [2025-01-09 20:30:06,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:06,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:07,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 20:30:07,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 20:30:07,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:07,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 20:30:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032593297] [2025-01-09 20:30:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032593297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:07,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722187602] [2025-01-09 20:30:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:07,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:07,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:07,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:07,636 INFO L87 Difference]: Start difference. First operand 1478 states and 1961 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:30:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:07,757 INFO L93 Difference]: Finished difference Result 2887 states and 3882 transitions. [2025-01-09 20:30:07,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:07,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 151 [2025-01-09 20:30:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:07,762 INFO L225 Difference]: With dead ends: 2887 [2025-01-09 20:30:07,762 INFO L226 Difference]: Without dead ends: 1486 [2025-01-09 20:30:07,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:07,766 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 4 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4761 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:07,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4761 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-01-09 20:30:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1482. [2025-01-09 20:30:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1025 states have (on average 1.255609756097561) internal successors, (1287), 1062 states have internal predecessors, (1287), 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-01-09 20:30:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1965 transitions. [2025-01-09 20:30:07,847 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1965 transitions. Word has length 151 [2025-01-09 20:30:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:07,848 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1965 transitions. [2025-01-09 20:30:07,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (22), 1 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:30:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1965 transitions. [2025-01-09 20:30:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 20:30:07,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:07,850 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, 1, 1, 1] [2025-01-09 20:30:07,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 20:30:07,850 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-01-09 20:30:07,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2040576502, now seen corresponding path program 1 times [2025-01-09 20:30:07,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:07,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332216659] [2025-01-09 20:30:07,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:08,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 20:30:08,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 20:30:08,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:08,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 20:30:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:08,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332216659] [2025-01-09 20:30:08,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332216659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:08,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:08,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463228383] [2025-01-09 20:30:08,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:08,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:08,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:08,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:08,628 INFO L87 Difference]: Start difference. First operand 1482 states and 1965 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-09 20:30:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:08,807 INFO L93 Difference]: Finished difference Result 2896 states and 3889 transitions. [2025-01-09 20:30:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:30:08,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 156 [2025-01-09 20:30:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:08,813 INFO L225 Difference]: With dead ends: 2896 [2025-01-09 20:30:08,813 INFO L226 Difference]: Without dead ends: 1489 [2025-01-09 20:30:08,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:30:08,817 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 4 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4759 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:08,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4759 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:30:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-01-09 20:30:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1488. [2025-01-09 20:30:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1030 states have (on average 1.2563106796116505) internal successors, (1294), 1067 states have internal predecessors, (1294), 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-01-09 20:30:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1973 transitions. [2025-01-09 20:30:08,943 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1973 transitions. Word has length 156 [2025-01-09 20:30:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:08,943 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1973 transitions. [2025-01-09 20:30:08,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-09 20:30:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1973 transitions. [2025-01-09 20:30:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:30:08,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:08,945 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, 1] [2025-01-09 20:30:08,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 20:30:08,946 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-01-09 20:30:08,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash -86497812, now seen corresponding path program 1 times [2025-01-09 20:30:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876720094] [2025-01-09 20:30:08,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:09,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:30:09,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:30:09,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:09,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 20:30:09,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:09,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876720094] [2025-01-09 20:30:09,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876720094] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:30:09,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792151518] [2025-01-09 20:30:09,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:09,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:30:09,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:30:09,808 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:30:09,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:30:11,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:30:11,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:30:11,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:11,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:11,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 20:30:11,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:30:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 20:30:12,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:30:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 20:30:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792151518] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:30:14,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:30:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 17 [2025-01-09 20:30:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585866287] [2025-01-09 20:30:14,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:30:14,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 20:30:14,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:14,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 20:30:14,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-01-09 20:30:14,060 INFO L87 Difference]: Start difference. First operand 1488 states and 1973 transitions. Second operand has 17 states, 16 states have (on average 9.0625) internal successors, (145), 15 states have internal predecessors, (145), 5 states have call successors, (48), 2 states have call predecessors, (48), 6 states have return successors, (50), 6 states have call predecessors, (50), 5 states have call successors, (50) [2025-01-09 20:30:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:15,561 INFO L93 Difference]: Finished difference Result 2911 states and 3909 transitions. [2025-01-09 20:30:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 20:30:15,561 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 9.0625) internal successors, (145), 15 states have internal predecessors, (145), 5 states have call successors, (48), 2 states have call predecessors, (48), 6 states have return successors, (50), 6 states have call predecessors, (50), 5 states have call successors, (50) Word has length 154 [2025-01-09 20:30:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:15,566 INFO L225 Difference]: With dead ends: 2911 [2025-01-09 20:30:15,567 INFO L226 Difference]: Without dead ends: 1496 [2025-01-09 20:30:15,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-01-09 20:30:15,570 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 272 mSDsluCounter, 19655 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 21224 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:15,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 21224 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 20:30:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2025-01-09 20:30:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1494. [2025-01-09 20:30:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1035 states have (on average 1.2560386473429952) internal successors, (1300), 1073 states have internal predecessors, (1300), 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-01-09 20:30:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1980 transitions. [2025-01-09 20:30:15,658 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1980 transitions. Word has length 154 [2025-01-09 20:30:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:15,658 INFO L471 AbstractCegarLoop]: Abstraction has 1494 states and 1980 transitions. [2025-01-09 20:30:15,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 9.0625) internal successors, (145), 15 states have internal predecessors, (145), 5 states have call successors, (48), 2 states have call predecessors, (48), 6 states have return successors, (50), 6 states have call predecessors, (50), 5 states have call successors, (50) [2025-01-09 20:30:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1980 transitions. [2025-01-09 20:30:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:30:15,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:15,660 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] [2025-01-09 20:30:15,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:30:15,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 20:30:15,865 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-01-09 20:30:15,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash -578233643, now seen corresponding path program 1 times [2025-01-09 20:30:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316627454] [2025-01-09 20:30:15,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:16,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:30:16,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:30:16,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:16,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:30:16,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:16,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316627454] [2025-01-09 20:30:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316627454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:16,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759697865] [2025-01-09 20:30:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:16,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:16,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:16,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:16,545 INFO L87 Difference]: Start difference. First operand 1494 states and 1980 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-01-09 20:30:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:16,681 INFO L93 Difference]: Finished difference Result 1494 states and 1980 transitions. [2025-01-09 20:30:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:16,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 154 [2025-01-09 20:30:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:16,687 INFO L225 Difference]: With dead ends: 1494 [2025-01-09 20:30:16,687 INFO L226 Difference]: Without dead ends: 1492 [2025-01-09 20:30:16,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-01-09 20:30:16,688 INFO L435 NwaCegarLoop]: 1588 mSDtfsCounter, 1551 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:16,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 3175 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-01-09 20:30:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2025-01-09 20:30:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1034 states have (on average 1.2553191489361701) internal successors, (1298), 1071 states have internal predecessors, (1298), 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-01-09 20:30:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1978 transitions. [2025-01-09 20:30:16,781 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1978 transitions. Word has length 154 [2025-01-09 20:30:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:16,782 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1978 transitions. [2025-01-09 20:30:16,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-01-09 20:30:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1978 transitions. [2025-01-09 20:30:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 20:30:16,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:16,784 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, 1] [2025-01-09 20:30:16,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 20:30:16,784 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-01-09 20:30:16,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash 961930067, now seen corresponding path program 1 times [2025-01-09 20:30:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359034198] [2025-01-09 20:30:16,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:17,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 20:30:17,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 20:30:17,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:17,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 20:30:17,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:17,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359034198] [2025-01-09 20:30:17,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359034198] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:30:17,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340539714] [2025-01-09 20:30:17,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:17,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:30:17,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:30:17,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:30:17,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:30:19,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 20:30:27,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 20:30:27,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:27,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:27,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 20:30:27,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:30:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 20:30:27,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:30:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 20:30:27,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340539714] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:30:27,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:30:27,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-09 20:30:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793385542] [2025-01-09 20:30:27,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:30:27,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 20:30:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:27,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 20:30:27,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:30:27,965 INFO L87 Difference]: Start difference. First operand 1492 states and 1978 transitions. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 20:30:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:28,669 INFO L93 Difference]: Finished difference Result 2926 states and 3934 transitions. [2025-01-09 20:30:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 20:30:28,669 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 159 [2025-01-09 20:30:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:28,675 INFO L225 Difference]: With dead ends: 2926 [2025-01-09 20:30:28,675 INFO L226 Difference]: Without dead ends: 1507 [2025-01-09 20:30:28,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2025-01-09 20:30:28,679 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 7 mSDsluCounter, 6329 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7915 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:28,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7915 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:30:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-01-09 20:30:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1501. [2025-01-09 20:30:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1043 states have (on average 1.2579098753595397) internal successors, (1312), 1080 states have internal predecessors, (1312), 337 states have call successors, (337), 113 states have call predecessors, (337), 115 states have return successors, (342), 333 states have call predecessors, (342), 335 states have call successors, (342) [2025-01-09 20:30:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1991 transitions. [2025-01-09 20:30:28,775 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1991 transitions. Word has length 159 [2025-01-09 20:30:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:28,775 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1991 transitions. [2025-01-09 20:30:28,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 20:30:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1991 transitions. [2025-01-09 20:30:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 20:30:28,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:28,777 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, 1, 1, 1, 1, 1] [2025-01-09 20:30:28,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 20:30:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 20:30:28,982 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-01-09 20:30:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1059675670, now seen corresponding path program 1 times [2025-01-09 20:30:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594239725] [2025-01-09 20:30:28,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:28,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:29,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 20:30:29,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 20:30:29,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:29,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:30:29,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:29,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594239725] [2025-01-09 20:30:29,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594239725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:29,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:29,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:29,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269983490] [2025-01-09 20:30:29,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:29,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:29,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:29,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:29,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:29,697 INFO L87 Difference]: Start difference. First operand 1501 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-01-09 20:30:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:29,839 INFO L93 Difference]: Finished difference Result 1501 states and 1991 transitions. [2025-01-09 20:30:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:29,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 160 [2025-01-09 20:30:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:29,846 INFO L225 Difference]: With dead ends: 1501 [2025-01-09 20:30:29,847 INFO L226 Difference]: Without dead ends: 1499 [2025-01-09 20:30:29,847 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-01-09 20:30:29,847 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 1548 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:29,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 3171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-01-09 20:30:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2025-01-09 20:30:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1042 states have (on average 1.2571976967370442) internal successors, (1310), 1078 states have internal predecessors, (1310), 337 states have call successors, (337), 113 states have call predecessors, (337), 115 states have return successors, (342), 333 states have call predecessors, (342), 335 states have call successors, (342) [2025-01-09 20:30:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1989 transitions. [2025-01-09 20:30:29,978 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1989 transitions. Word has length 160 [2025-01-09 20:30:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1989 transitions. [2025-01-09 20:30:29,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-01-09 20:30:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1989 transitions. [2025-01-09 20:30:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 20:30:29,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:29,980 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, 1, 1, 1, 1] [2025-01-09 20:30:29,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 20:30:29,980 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-01-09 20:30:29,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:29,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1609237933, now seen corresponding path program 2 times [2025-01-09 20:30:29,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:29,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715567650] [2025-01-09 20:30:29,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:30:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:30,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 163 statements into 2 equivalence classes. [2025-01-09 20:30:30,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 20:30:30,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 20:30:30,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 20:30:31,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:31,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715567650] [2025-01-09 20:30:31,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715567650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:30:31,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186944408] [2025-01-09 20:30:31,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:30:31,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:30:31,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:30:31,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:30:31,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:30:33,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 163 statements into 2 equivalence classes.