./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--input--touchscreen--elants_i2c.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--input--touchscreen--elants_i2c.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 c80eb64b2f9217863d1cee53bd309527a1698bb6d7dac474881d4795c24080c8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:28:08,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:28:08,193 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:28:08,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:28:08,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:28:08,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:28:08,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:28:08,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:28:08,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:28:08,225 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:28:08,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:28:08,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:28:08,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:28:08,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:28:08,226 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:28:08,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:28:08,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:28:08,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:28:08,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:28:08,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:28:08,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:28:08,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:28:08,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:28:08,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:28:08,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:28:08,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:28:08,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:28:08,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:28:08,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:28:08,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:28:08,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:28:08,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:28:08,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:28:08,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:28:08,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:28:08,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:28:08,229 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 -> c80eb64b2f9217863d1cee53bd309527a1698bb6d7dac474881d4795c24080c8 [2025-01-09 20:28:08,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:28:08,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:28:08,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:28:08,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:28:08,462 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:28:08,463 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--input--touchscreen--elants_i2c.ko.cil.i [2025-01-09 20:28:09,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1680cfbb3/405270ff0b8e446cb0ee622de6b849e9/FLAGc495e2c0a [2025-01-09 20:28:10,045 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:28:10,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i [2025-01-09 20:28:10,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1680cfbb3/405270ff0b8e446cb0ee622de6b849e9/FLAGc495e2c0a [2025-01-09 20:28:10,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1680cfbb3/405270ff0b8e446cb0ee622de6b849e9 [2025-01-09 20:28:10,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:28:10,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:28:10,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:28:10,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:28:10,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:28:10,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:10" (1/1) ... [2025-01-09 20:28:10,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300c44e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:10, skipping insertion in model container [2025-01-09 20:28:10,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:10" (1/1) ... [2025-01-09 20:28:10,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:28:12,069 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--input--touchscreen--elants_i2c.ko.cil.i[301233,301246] [2025-01-09 20:28:12,074 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--input--touchscreen--elants_i2c.ko.cil.i[301378,301391] [2025-01-09 20:28:12,075 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--input--touchscreen--elants_i2c.ko.cil.i[301524,301537] [2025-01-09 20:28:12,075 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--input--touchscreen--elants_i2c.ko.cil.i[301689,301702] [2025-01-09 20:28:12,076 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--input--touchscreen--elants_i2c.ko.cil.i[301847,301860] [2025-01-09 20:28:12,076 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--input--touchscreen--elants_i2c.ko.cil.i[302005,302018] [2025-01-09 20:28:12,077 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--input--touchscreen--elants_i2c.ko.cil.i[302163,302176] [2025-01-09 20:28:12,077 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--input--touchscreen--elants_i2c.ko.cil.i[302323,302336] [2025-01-09 20:28:12,077 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--input--touchscreen--elants_i2c.ko.cil.i[302482,302495] [2025-01-09 20:28:12,081 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--input--touchscreen--elants_i2c.ko.cil.i[302621,302634] [2025-01-09 20:28:12,081 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--input--touchscreen--elants_i2c.ko.cil.i[302763,302776] [2025-01-09 20:28:12,081 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--input--touchscreen--elants_i2c.ko.cil.i[302912,302925] [2025-01-09 20:28:12,081 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--input--touchscreen--elants_i2c.ko.cil.i[303051,303064] [2025-01-09 20:28:12,082 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--input--touchscreen--elants_i2c.ko.cil.i[303206,303219] [2025-01-09 20:28:12,082 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--input--touchscreen--elants_i2c.ko.cil.i[303366,303379] [2025-01-09 20:28:12,082 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--input--touchscreen--elants_i2c.ko.cil.i[303517,303530] [2025-01-09 20:28:12,082 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--input--touchscreen--elants_i2c.ko.cil.i[303668,303681] [2025-01-09 20:28:12,082 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--input--touchscreen--elants_i2c.ko.cil.i[303820,303833] [2025-01-09 20:28:12,082 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--input--touchscreen--elants_i2c.ko.cil.i[303969,303982] [2025-01-09 20:28:12,083 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--input--touchscreen--elants_i2c.ko.cil.i[304117,304130] [2025-01-09 20:28:12,083 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--input--touchscreen--elants_i2c.ko.cil.i[304274,304287] [2025-01-09 20:28:12,083 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--input--touchscreen--elants_i2c.ko.cil.i[304423,304436] [2025-01-09 20:28:12,083 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--input--touchscreen--elants_i2c.ko.cil.i[304579,304592] [2025-01-09 20:28:12,083 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--input--touchscreen--elants_i2c.ko.cil.i[304732,304745] [2025-01-09 20:28:12,088 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--input--touchscreen--elants_i2c.ko.cil.i[304878,304891] [2025-01-09 20:28:12,089 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--input--touchscreen--elants_i2c.ko.cil.i[305021,305034] [2025-01-09 20:28:12,089 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--input--touchscreen--elants_i2c.ko.cil.i[305173,305186] [2025-01-09 20:28:12,089 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--input--touchscreen--elants_i2c.ko.cil.i[305319,305332] [2025-01-09 20:28:12,090 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--input--touchscreen--elants_i2c.ko.cil.i[305464,305477] [2025-01-09 20:28:12,090 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--input--touchscreen--elants_i2c.ko.cil.i[305618,305631] [2025-01-09 20:28:12,090 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--input--touchscreen--elants_i2c.ko.cil.i[305769,305782] [2025-01-09 20:28:12,090 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--input--touchscreen--elants_i2c.ko.cil.i[305924,305937] [2025-01-09 20:28:12,093 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--input--touchscreen--elants_i2c.ko.cil.i[306076,306089] [2025-01-09 20:28:12,094 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--input--touchscreen--elants_i2c.ko.cil.i[306231,306244] [2025-01-09 20:28:12,094 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--input--touchscreen--elants_i2c.ko.cil.i[306395,306408] [2025-01-09 20:28:12,094 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--input--touchscreen--elants_i2c.ko.cil.i[306551,306564] [2025-01-09 20:28:12,094 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--input--touchscreen--elants_i2c.ko.cil.i[306715,306728] [2025-01-09 20:28:12,095 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--input--touchscreen--elants_i2c.ko.cil.i[306857,306870] [2025-01-09 20:28:12,095 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--input--touchscreen--elants_i2c.ko.cil.i[307015,307028] [2025-01-09 20:28:12,095 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--input--touchscreen--elants_i2c.ko.cil.i[307182,307195] [2025-01-09 20:28:12,095 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--input--touchscreen--elants_i2c.ko.cil.i[307341,307354] [2025-01-09 20:28:12,095 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--input--touchscreen--elants_i2c.ko.cil.i[307500,307513] [2025-01-09 20:28:12,096 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--input--touchscreen--elants_i2c.ko.cil.i[307649,307662] [2025-01-09 20:28:12,096 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--input--touchscreen--elants_i2c.ko.cil.i[307796,307809] [2025-01-09 20:28:12,096 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--input--touchscreen--elants_i2c.ko.cil.i[307935,307948] [2025-01-09 20:28:12,096 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--input--touchscreen--elants_i2c.ko.cil.i[308098,308111] [2025-01-09 20:28:12,096 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--input--touchscreen--elants_i2c.ko.cil.i[308264,308277] [2025-01-09 20:28:12,096 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--input--touchscreen--elants_i2c.ko.cil.i[308428,308441] [2025-01-09 20:28:12,096 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--input--touchscreen--elants_i2c.ko.cil.i[308593,308606] [2025-01-09 20:28:12,097 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--input--touchscreen--elants_i2c.ko.cil.i[308758,308771] [2025-01-09 20:28:12,097 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--input--touchscreen--elants_i2c.ko.cil.i[308924,308937] [2025-01-09 20:28:12,097 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--input--touchscreen--elants_i2c.ko.cil.i[309089,309102] [2025-01-09 20:28:12,097 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--input--touchscreen--elants_i2c.ko.cil.i[309256,309269] [2025-01-09 20:28:12,097 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--input--touchscreen--elants_i2c.ko.cil.i[309416,309429] [2025-01-09 20:28:12,097 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--input--touchscreen--elants_i2c.ko.cil.i[309578,309591] [2025-01-09 20:28:12,098 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--input--touchscreen--elants_i2c.ko.cil.i[309737,309750] [2025-01-09 20:28:12,098 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--input--touchscreen--elants_i2c.ko.cil.i[309883,309896] [2025-01-09 20:28:12,098 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--input--touchscreen--elants_i2c.ko.cil.i[310026,310039] [2025-01-09 20:28:12,098 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--input--touchscreen--elants_i2c.ko.cil.i[310170,310183] [2025-01-09 20:28:12,098 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--input--touchscreen--elants_i2c.ko.cil.i[310313,310326] [2025-01-09 20:28:12,098 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--input--touchscreen--elants_i2c.ko.cil.i[310457,310470] [2025-01-09 20:28:12,100 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--input--touchscreen--elants_i2c.ko.cil.i[310598,310611] [2025-01-09 20:28:12,101 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--input--touchscreen--elants_i2c.ko.cil.i[310736,310749] [2025-01-09 20:28:12,101 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--input--touchscreen--elants_i2c.ko.cil.i[310894,310907] [2025-01-09 20:28:12,101 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--input--touchscreen--elants_i2c.ko.cil.i[311053,311066] [2025-01-09 20:28:12,101 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--input--touchscreen--elants_i2c.ko.cil.i[311209,311222] [2025-01-09 20:28:12,102 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--input--touchscreen--elants_i2c.ko.cil.i[311358,311371] [2025-01-09 20:28:12,103 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--input--touchscreen--elants_i2c.ko.cil.i[311510,311523] [2025-01-09 20:28:12,103 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--input--touchscreen--elants_i2c.ko.cil.i[311661,311674] [2025-01-09 20:28:12,104 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--input--touchscreen--elants_i2c.ko.cil.i[311810,311823] [2025-01-09 20:28:12,104 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--input--touchscreen--elants_i2c.ko.cil.i[311962,311975] [2025-01-09 20:28:12,104 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--input--touchscreen--elants_i2c.ko.cil.i[312110,312123] [2025-01-09 20:28:12,104 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--input--touchscreen--elants_i2c.ko.cil.i[312263,312276] [2025-01-09 20:28:12,104 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--input--touchscreen--elants_i2c.ko.cil.i[312414,312427] [2025-01-09 20:28:12,105 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--input--touchscreen--elants_i2c.ko.cil.i[312564,312577] [2025-01-09 20:28:12,105 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--input--touchscreen--elants_i2c.ko.cil.i[312711,312724] [2025-01-09 20:28:12,105 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--input--touchscreen--elants_i2c.ko.cil.i[312862,312875] [2025-01-09 20:28:12,105 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--input--touchscreen--elants_i2c.ko.cil.i[313013,313026] [2025-01-09 20:28:12,105 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--input--touchscreen--elants_i2c.ko.cil.i[313161,313174] [2025-01-09 20:28:12,106 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--input--touchscreen--elants_i2c.ko.cil.i[313327,313340] [2025-01-09 20:28:12,106 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--input--touchscreen--elants_i2c.ko.cil.i[313496,313509] [2025-01-09 20:28:12,106 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--input--touchscreen--elants_i2c.ko.cil.i[313663,313676] [2025-01-09 20:28:12,108 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--input--touchscreen--elants_i2c.ko.cil.i[313831,313844] [2025-01-09 20:28:12,109 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--input--touchscreen--elants_i2c.ko.cil.i[313981,313994] [2025-01-09 20:28:12,109 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--input--touchscreen--elants_i2c.ko.cil.i[314128,314141] [2025-01-09 20:28:12,109 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--input--touchscreen--elants_i2c.ko.cil.i[314289,314302] [2025-01-09 20:28:12,109 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--input--touchscreen--elants_i2c.ko.cil.i[314459,314472] [2025-01-09 20:28:12,110 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--input--touchscreen--elants_i2c.ko.cil.i[314621,314634] [2025-01-09 20:28:12,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:28:12,153 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:28:12,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4392] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[301233,301246] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[301378,301391] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[301524,301537] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[301689,301702] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[301847,301860] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[302005,302018] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[302163,302176] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[302323,302336] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[302482,302495] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[302621,302634] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[302763,302776] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[302912,302925] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[303051,303064] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[303206,303219] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[303366,303379] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[303517,303530] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[303668,303681] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[303820,303833] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[303969,303982] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[304117,304130] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[304274,304287] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[304423,304436] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[304579,304592] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[304732,304745] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[304878,304891] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[305021,305034] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[305173,305186] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[305319,305332] [2025-01-09 20:28:12,412 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--input--touchscreen--elants_i2c.ko.cil.i[305464,305477] [2025-01-09 20:28:12,412 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--input--touchscreen--elants_i2c.ko.cil.i[305618,305631] [2025-01-09 20:28:12,412 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--input--touchscreen--elants_i2c.ko.cil.i[305769,305782] [2025-01-09 20:28:12,412 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--input--touchscreen--elants_i2c.ko.cil.i[305924,305937] [2025-01-09 20:28:12,412 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--input--touchscreen--elants_i2c.ko.cil.i[306076,306089] [2025-01-09 20:28:12,413 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--input--touchscreen--elants_i2c.ko.cil.i[306231,306244] [2025-01-09 20:28:12,413 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--input--touchscreen--elants_i2c.ko.cil.i[306395,306408] [2025-01-09 20:28:12,413 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--input--touchscreen--elants_i2c.ko.cil.i[306551,306564] [2025-01-09 20:28:12,413 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--input--touchscreen--elants_i2c.ko.cil.i[306715,306728] [2025-01-09 20:28:12,413 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--input--touchscreen--elants_i2c.ko.cil.i[306857,306870] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[307015,307028] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[307182,307195] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[307341,307354] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[307500,307513] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[307649,307662] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[307796,307809] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[307935,307948] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[308098,308111] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[308264,308277] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[308428,308441] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[308593,308606] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[308758,308771] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[308924,308937] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[309089,309102] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[309256,309269] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[309416,309429] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[309578,309591] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[309737,309750] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[309883,309896] [2025-01-09 20:28:12,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--input--touchscreen--elants_i2c.ko.cil.i[310026,310039] [2025-01-09 20:28:12,418 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--input--touchscreen--elants_i2c.ko.cil.i[310170,310183] [2025-01-09 20:28:12,418 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--input--touchscreen--elants_i2c.ko.cil.i[310313,310326] [2025-01-09 20:28:12,418 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--input--touchscreen--elants_i2c.ko.cil.i[310457,310470] [2025-01-09 20:28:12,418 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--input--touchscreen--elants_i2c.ko.cil.i[310598,310611] [2025-01-09 20:28:12,418 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--input--touchscreen--elants_i2c.ko.cil.i[310736,310749] [2025-01-09 20:28:12,418 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--input--touchscreen--elants_i2c.ko.cil.i[310894,310907] [2025-01-09 20:28:12,419 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--input--touchscreen--elants_i2c.ko.cil.i[311053,311066] [2025-01-09 20:28:12,419 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--input--touchscreen--elants_i2c.ko.cil.i[311209,311222] [2025-01-09 20:28:12,419 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--input--touchscreen--elants_i2c.ko.cil.i[311358,311371] [2025-01-09 20:28:12,419 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--input--touchscreen--elants_i2c.ko.cil.i[311510,311523] [2025-01-09 20:28:12,419 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--input--touchscreen--elants_i2c.ko.cil.i[311661,311674] [2025-01-09 20:28:12,420 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--input--touchscreen--elants_i2c.ko.cil.i[311810,311823] [2025-01-09 20:28:12,420 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--input--touchscreen--elants_i2c.ko.cil.i[311962,311975] [2025-01-09 20:28:12,420 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--input--touchscreen--elants_i2c.ko.cil.i[312110,312123] [2025-01-09 20:28:12,420 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--input--touchscreen--elants_i2c.ko.cil.i[312263,312276] [2025-01-09 20:28:12,420 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--input--touchscreen--elants_i2c.ko.cil.i[312414,312427] [2025-01-09 20:28:12,421 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--input--touchscreen--elants_i2c.ko.cil.i[312564,312577] [2025-01-09 20:28:12,421 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--input--touchscreen--elants_i2c.ko.cil.i[312711,312724] [2025-01-09 20:28:12,421 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--input--touchscreen--elants_i2c.ko.cil.i[312862,312875] [2025-01-09 20:28:12,421 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--input--touchscreen--elants_i2c.ko.cil.i[313013,313026] [2025-01-09 20:28:12,421 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--input--touchscreen--elants_i2c.ko.cil.i[313161,313174] [2025-01-09 20:28:12,421 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--input--touchscreen--elants_i2c.ko.cil.i[313327,313340] [2025-01-09 20:28:12,421 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--input--touchscreen--elants_i2c.ko.cil.i[313496,313509] [2025-01-09 20:28:12,422 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--input--touchscreen--elants_i2c.ko.cil.i[313663,313676] [2025-01-09 20:28:12,422 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--input--touchscreen--elants_i2c.ko.cil.i[313831,313844] [2025-01-09 20:28:12,422 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--input--touchscreen--elants_i2c.ko.cil.i[313981,313994] [2025-01-09 20:28:12,422 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--input--touchscreen--elants_i2c.ko.cil.i[314128,314141] [2025-01-09 20:28:12,422 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--input--touchscreen--elants_i2c.ko.cil.i[314289,314302] [2025-01-09 20:28:12,422 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--input--touchscreen--elants_i2c.ko.cil.i[314459,314472] [2025-01-09 20:28:12,423 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--input--touchscreen--elants_i2c.ko.cil.i[314621,314634] [2025-01-09 20:28:12,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:28:12,546 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:28:12,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12 WrapperNode [2025-01-09 20:28:12,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:28:12,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:28:12,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:28:12,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:28:12,555 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:28:12" (1/1) ... [2025-01-09 20:28:12,627 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:28:12" (1/1) ... [2025-01-09 20:28:12,772 INFO L138 Inliner]: procedures = 537, calls = 1979, calls flagged for inlining = 255, calls inlined = 172, statements flattened = 4321 [2025-01-09 20:28:12,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:28:12,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:28:12,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:28:12,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:28:12,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:12,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:12,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:13,182 INFO L175 MemorySlicer]: Split 720 memory accesses to 22 slices as follows [40, 11, 46, 1, 2, 156, 5, 4, 10, 4, 7, 4, 4, 4, 4, 84, 4, 2, 2, 289, 4, 33]. 40 percent of accesses are in the largest equivalence class. The 76 initializations are split as follows [0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 7, 0, 0, 4, 0, 0, 0, 0, 0, 62, 0, 0]. The 436 writes are split as follows [0, 11, 34, 0, 0, 156, 0, 4, 9, 4, 0, 0, 4, 0, 0, 72, 4, 0, 2, 99, 4, 33]. [2025-01-09 20:28:13,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:13,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:13,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:13,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:13,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:13,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:13,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:13,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:28:13,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:28:13,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:28:13,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:28:13,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (1/1) ... [2025-01-09 20:28:13,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:28:13,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:28:13,387 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:28:13,389 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:28:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2025-01-09 20:28:13,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2025-01-09 20:28:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:28:13,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:28:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 20:28:13,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 20:28:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:28:13,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:28:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:28:13,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:28:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:28:13,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:28:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_parse_version [2025-01-09 20:28:13,409 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_parse_version [2025-01-09 20:28:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-01-09 20:28:13,410 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-01-09 20:28:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-01-09 20:28:13,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-01-09 20:28:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_remove_sysfs_group [2025-01-09 20:28:13,410 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_remove_sysfs_group [2025-01-09 20:28:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 20:28:13,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 20:28:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:28:13,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:28:13,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_set_res [2025-01-09 20:28:13,411 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_set_res [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure write_update_fw [2025-01-09 20:28:13,411 INFO L138 BoogieDeclarations]: Found implementation of procedure write_update_fw [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 20:28:13,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-01-09 20:28:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-01-09 20:28:13,413 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-01-09 20:28:13,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:28:13,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 20:28:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:28:13,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2025-01-09 20:28:13,414 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:28:13,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_suspend [2025-01-09 20:28:13,414 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_suspend [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:28:13,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-01-09 20:28:13,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:28:13,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 20:28:13,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 20:28:13,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 20:28:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 20:28:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 20:28:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 20:28:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 20:28:13,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 20:28:13,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-01-09 20:28:13,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_master_recv [2025-01-09 20:28:13,416 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_master_recv [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:28:13,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-01-09 20:28:13,416 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-01-09 20:28:13,416 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_send [2025-01-09 20:28:13,417 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_send [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:28:13,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-01-09 20:28:13,417 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 20:28:13,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure elants_version_attribute_show [2025-01-09 20:28:13,417 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_version_attribute_show [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure disable_irq [2025-01-09 20:28:13,417 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_irq [2025-01-09 20:28:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_sw_reset [2025-01-09 20:28:13,417 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_sw_reset [2025-01-09 20:28:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:28:13,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:28:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_calibrate [2025-01-09 20:28:13,418 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_calibrate [2025-01-09 20:28:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:28:13,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:28:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:28:13,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 20:28:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_resume [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_resume [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure calibrate_store [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure calibrate_store [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:28:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 20:28:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 20:28:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 20:28:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 20:28:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:28:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_initialize [2025-01-09 20:28:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_initialize [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 20:28:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2025-01-09 20:28:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure enable_irq [2025-01-09 20:28:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_irq [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:28:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-01-09 20:28:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_read [2025-01-09 20:28:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_read [2025-01-09 20:28:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2025-01-09 20:28:13,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2025-01-09 20:28:13,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2025-01-09 20:28:13,423 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_execute_command [2025-01-09 20:28:13,423 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_execute_command [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-01-09 20:28:13,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:28:13,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 20:28:13,423 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_event [2025-01-09 20:28:13,423 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_event [2025-01-09 20:28:14,001 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:28:14,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:28:14,044 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 20:28:25,369 INFO L? ?]: Removed 1583 outVars from TransFormulas that were not future-live. [2025-01-09 20:28:25,370 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:28:25,392 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:28:25,392 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 20:28:25,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:25 BoogieIcfgContainer [2025-01-09 20:28:25,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:28:25,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:28:25,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:28:25,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:28:25,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:28:10" (1/3) ... [2025-01-09 20:28:25,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69759089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:28:25, skipping insertion in model container [2025-01-09 20:28:25,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:12" (2/3) ... [2025-01-09 20:28:25,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69759089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:28:25, skipping insertion in model container [2025-01-09 20:28:25,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:28:25" (3/3) ... [2025-01-09 20:28:25,402 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i [2025-01-09 20:28:25,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:28:25,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i that has 70 procedures, 1309 locations, 1 initial locations, 4 loop locations, and 27 error locations. [2025-01-09 20:28:25,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:28:25,493 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;@5961f51d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:28:25,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-09 20:28:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 1308 states, 878 states have (on average 1.2892938496583144) internal successors, (1132), 941 states have internal predecessors, (1132), 334 states have call successors, (334), 69 states have call predecessors, (334), 68 states have return successors, (329), 323 states have call predecessors, (329), 329 states have call successors, (329) [2025-01-09 20:28:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 20:28:25,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:25,511 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:25,511 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:28:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 836848322, now seen corresponding path program 1 times [2025-01-09 20:28:25,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:25,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736714347] [2025-01-09 20:28:25,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:25,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:27,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 20:28:28,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 20:28:28,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:28,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:29,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736714347] [2025-01-09 20:28:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736714347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506982200] [2025-01-09 20:28:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:29,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:29,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:29,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:29,314 INFO L87 Difference]: Start difference. First operand has 1308 states, 878 states have (on average 1.2892938496583144) internal successors, (1132), 941 states have internal predecessors, (1132), 334 states have call successors, (334), 69 states have call predecessors, (334), 68 states have return successors, (329), 323 states have call predecessors, (329), 329 states have call successors, (329) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 20:28:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:29,599 INFO L93 Difference]: Finished difference Result 2585 states and 3606 transitions. [2025-01-09 20:28:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:29,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-01-09 20:28:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:29,629 INFO L225 Difference]: With dead ends: 2585 [2025-01-09 20:28:29,630 INFO L226 Difference]: Without dead ends: 1290 [2025-01-09 20:28:29,643 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:28:29,647 INFO L435 NwaCegarLoop]: 1759 mSDtfsCounter, 1733 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 3517 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:28:29,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 3517 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:28:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-01-09 20:28:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2025-01-09 20:28:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 868 states have (on average 1.2523041474654377) internal successors, (1087), 926 states have internal predecessors, (1087), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-01-09 20:28:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1743 transitions. [2025-01-09 20:28:29,789 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1743 transitions. Word has length 64 [2025-01-09 20:28:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:29,790 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1743 transitions. [2025-01-09 20:28:29,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 20:28:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1743 transitions. [2025-01-09 20:28:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 20:28:29,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:29,794 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:29,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:28:29,794 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:28:29,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash 810417264, now seen corresponding path program 1 times [2025-01-09 20:28:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:29,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466408273] [2025-01-09 20:28:29,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:32,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 20:28:32,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 20:28:32,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:32,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:32,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:32,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466408273] [2025-01-09 20:28:32,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466408273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:32,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176216529] [2025-01-09 20:28:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:32,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:32,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:32,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:32,663 INFO L87 Difference]: Start difference. First operand 1290 states and 1743 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:28:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:32,798 INFO L93 Difference]: Finished difference Result 1290 states and 1743 transitions. [2025-01-09 20:28:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:32,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2025-01-09 20:28:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:32,805 INFO L225 Difference]: With dead ends: 1290 [2025-01-09 20:28:32,805 INFO L226 Difference]: Without dead ends: 1288 [2025-01-09 20:28:32,806 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:28:32,806 INFO L435 NwaCegarLoop]: 1739 mSDtfsCounter, 1712 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 3477 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:28:32,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 3477 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:28:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-01-09 20:28:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1288. [2025-01-09 20:28:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 867 states have (on average 1.251441753171857) internal successors, (1085), 924 states have internal predecessors, (1085), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-01-09 20:28:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1741 transitions. [2025-01-09 20:28:32,863 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1741 transitions. Word has length 70 [2025-01-09 20:28:32,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:32,865 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1741 transitions. [2025-01-09 20:28:32,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:28:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1741 transitions. [2025-01-09 20:28:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 20:28:32,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:32,869 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:32,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:28:32,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-01-09 20:28:32,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1647717927, now seen corresponding path program 1 times [2025-01-09 20:28:32,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:32,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418526745] [2025-01-09 20:28:32,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:34,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 20:28:35,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 20:28:35,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:35,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418526745] [2025-01-09 20:28:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418526745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:35,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899425855] [2025-01-09 20:28:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:35,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:35,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:35,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:35,552 INFO L87 Difference]: Start difference. First operand 1288 states and 1741 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 20:28:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:35,676 INFO L93 Difference]: Finished difference Result 1288 states and 1741 transitions. [2025-01-09 20:28:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:35,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-01-09 20:28:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:35,684 INFO L225 Difference]: With dead ends: 1288 [2025-01-09 20:28:35,684 INFO L226 Difference]: Without dead ends: 1286 [2025-01-09 20:28:35,685 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:28:35,686 INFO L435 NwaCegarLoop]: 1737 mSDtfsCounter, 1709 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 3473 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:28:35,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 3473 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:28:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-01-09 20:28:35,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1286. [2025-01-09 20:28:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 866 states have (on average 1.2505773672055427) internal successors, (1083), 922 states have internal predecessors, (1083), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-01-09 20:28:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1739 transitions. [2025-01-09 20:28:35,742 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1739 transitions. Word has length 76 [2025-01-09 20:28:35,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:35,743 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1739 transitions. [2025-01-09 20:28:35,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 20:28:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1739 transitions. [2025-01-09 20:28:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 20:28:35,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:35,746 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:35,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:28:35,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-01-09 20:28:35,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash -656180938, now seen corresponding path program 1 times [2025-01-09 20:28:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:35,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531248947] [2025-01-09 20:28:35,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:37,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 20:28:37,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 20:28:37,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:37,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:38,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:38,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531248947] [2025-01-09 20:28:38,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531248947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:38,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:38,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:38,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676482497] [2025-01-09 20:28:38,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:38,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:38,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:38,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:38,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:38,319 INFO L87 Difference]: Start difference. First operand 1286 states and 1739 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:28:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:38,444 INFO L93 Difference]: Finished difference Result 1286 states and 1739 transitions. [2025-01-09 20:28:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:38,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2025-01-09 20:28:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:38,453 INFO L225 Difference]: With dead ends: 1286 [2025-01-09 20:28:38,453 INFO L226 Difference]: Without dead ends: 1284 [2025-01-09 20:28:38,453 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:28:38,455 INFO L435 NwaCegarLoop]: 1735 mSDtfsCounter, 1706 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 3469 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:28:38,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 3469 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:28:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2025-01-09 20:28:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2025-01-09 20:28:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 865 states have (on average 1.2497109826589596) internal successors, (1081), 920 states have internal predecessors, (1081), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-01-09 20:28:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1737 transitions. [2025-01-09 20:28:38,507 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1737 transitions. Word has length 82 [2025-01-09 20:28:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:38,508 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1737 transitions. [2025-01-09 20:28:38,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:28:38,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1737 transitions. [2025-01-09 20:28:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 20:28:38,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:38,509 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:38,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:28:38,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-01-09 20:28:38,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:38,510 INFO L85 PathProgramCache]: Analyzing trace with hash -50538217, now seen corresponding path program 1 times [2025-01-09 20:28:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738922893] [2025-01-09 20:28:38,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:40,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 20:28:40,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 20:28:40,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:40,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738922893] [2025-01-09 20:28:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738922893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:41,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104268351] [2025-01-09 20:28:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:41,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:41,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:41,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:41,110 INFO L87 Difference]: Start difference. First operand 1284 states and 1737 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:28:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:41,231 INFO L93 Difference]: Finished difference Result 1284 states and 1737 transitions. [2025-01-09 20:28:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:41,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2025-01-09 20:28:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:41,238 INFO L225 Difference]: With dead ends: 1284 [2025-01-09 20:28:41,238 INFO L226 Difference]: Without dead ends: 1282 [2025-01-09 20:28:41,238 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:28:41,239 INFO L435 NwaCegarLoop]: 1733 mSDtfsCounter, 1703 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 3465 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:28:41,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 3465 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:28:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2025-01-09 20:28:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2025-01-09 20:28:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 864 states have (on average 1.2488425925925926) internal successors, (1079), 918 states have internal predecessors, (1079), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-01-09 20:28:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1735 transitions. [2025-01-09 20:28:41,286 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1735 transitions. Word has length 88 [2025-01-09 20:28:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:41,286 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1735 transitions. [2025-01-09 20:28:41,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:28:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1735 transitions. [2025-01-09 20:28:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 20:28:41,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:41,288 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:41,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:28:41,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-01-09 20:28:41,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash -775639817, now seen corresponding path program 1 times [2025-01-09 20:28:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:41,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444089972] [2025-01-09 20:28:41,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:43,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 20:28:43,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 20:28:43,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:43,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:43,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:43,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444089972] [2025-01-09 20:28:43,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444089972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:43,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:43,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:43,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494529844] [2025-01-09 20:28:43,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:43,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:43,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:43,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:43,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:43,757 INFO L87 Difference]: Start difference. First operand 1282 states and 1735 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:28:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:43,891 INFO L93 Difference]: Finished difference Result 1282 states and 1735 transitions. [2025-01-09 20:28:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:43,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2025-01-09 20:28:43,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:43,897 INFO L225 Difference]: With dead ends: 1282 [2025-01-09 20:28:43,897 INFO L226 Difference]: Without dead ends: 1280 [2025-01-09 20:28:43,898 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:28:43,898 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 1700 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 3461 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:28:43,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 3461 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:28:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-01-09 20:28:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2025-01-09 20:28:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 863 states have (on average 1.2479721900347625) internal successors, (1077), 916 states have internal predecessors, (1077), 329 states have call successors, (329), 68 states have call predecessors, (329), 67 states have return successors, (327), 321 states have call predecessors, (327), 327 states have call successors, (327) [2025-01-09 20:28:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1733 transitions. [2025-01-09 20:28:43,951 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1733 transitions. Word has length 94 [2025-01-09 20:28:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:43,951 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1733 transitions. [2025-01-09 20:28:43,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:28:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1733 transitions. [2025-01-09 20:28:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 20:28:43,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:43,954 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:43,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:28:43,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:28:43,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1359508674, now seen corresponding path program 1 times [2025-01-09 20:28:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:43,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064975249] [2025-01-09 20:28:43,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:45,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 20:28:45,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 20:28:45,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:45,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:46,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:46,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064975249] [2025-01-09 20:28:46,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064975249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:46,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:46,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:46,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907849617] [2025-01-09 20:28:46,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:46,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:46,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:46,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:46,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:46,347 INFO L87 Difference]: Start difference. First operand 1280 states and 1733 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:28:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:46,640 INFO L93 Difference]: Finished difference Result 2530 states and 3427 transitions. [2025-01-09 20:28:46,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:46,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-01-09 20:28:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:46,653 INFO L225 Difference]: With dead ends: 2530 [2025-01-09 20:28:46,653 INFO L226 Difference]: Without dead ends: 2528 [2025-01-09 20:28:46,654 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:28:46,655 INFO L435 NwaCegarLoop]: 1744 mSDtfsCounter, 1684 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 5184 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:28:46,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 5184 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:28:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-01-09 20:28:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2391. [2025-01-09 20:28:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 1630 states have (on average 1.2521472392638038) internal successors, (2041), 1716 states have internal predecessors, (2041), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:28:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3279 transitions. [2025-01-09 20:28:46,827 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3279 transitions. Word has length 100 [2025-01-09 20:28:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:46,831 INFO L471 AbstractCegarLoop]: Abstraction has 2391 states and 3279 transitions. [2025-01-09 20:28:46,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:28:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3279 transitions. [2025-01-09 20:28:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 20:28:46,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:46,832 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:46,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:28:46,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:28:46,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash -160342537, now seen corresponding path program 1 times [2025-01-09 20:28:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269277424] [2025-01-09 20:28:46,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:49,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 20:28:49,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 20:28:49,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:49,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:49,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269277424] [2025-01-09 20:28:49,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269277424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:49,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:49,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:49,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894923707] [2025-01-09 20:28:49,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:49,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:49,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:49,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:49,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:49,545 INFO L87 Difference]: Start difference. First operand 2391 states and 3279 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:28:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:49,695 INFO L93 Difference]: Finished difference Result 2391 states and 3279 transitions. [2025-01-09 20:28:49,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:49,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-01-09 20:28:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:49,707 INFO L225 Difference]: With dead ends: 2391 [2025-01-09 20:28:49,708 INFO L226 Difference]: Without dead ends: 2389 [2025-01-09 20:28:49,709 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:28:49,710 INFO L435 NwaCegarLoop]: 1729 mSDtfsCounter, 1696 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 3457 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:28:49,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 3457 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:28:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2025-01-09 20:28:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2389. [2025-01-09 20:28:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 1629 states have (on average 1.2516881522406385) internal successors, (2039), 1714 states have internal predecessors, (2039), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:28:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3277 transitions. [2025-01-09 20:28:49,814 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3277 transitions. Word has length 106 [2025-01-09 20:28:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:49,814 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 3277 transitions. [2025-01-09 20:28:49,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:28:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3277 transitions. [2025-01-09 20:28:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 20:28:49,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:49,818 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:49,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:28:49,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:28:49,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash 529792186, now seen corresponding path program 1 times [2025-01-09 20:28:49,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:49,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694514617] [2025-01-09 20:28:49,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:49,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:51,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 20:28:51,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 20:28:51,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:51,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694514617] [2025-01-09 20:28:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694514617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972523598] [2025-01-09 20:28:52,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:52,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:52,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:52,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:52,380 INFO L87 Difference]: Start difference. First operand 2389 states and 3277 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:28:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:52,621 INFO L93 Difference]: Finished difference Result 2389 states and 3277 transitions. [2025-01-09 20:28:52,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:52,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2025-01-09 20:28:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:52,636 INFO L225 Difference]: With dead ends: 2389 [2025-01-09 20:28:52,636 INFO L226 Difference]: Without dead ends: 2387 [2025-01-09 20:28:52,638 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:28:52,638 INFO L435 NwaCegarLoop]: 1727 mSDtfsCounter, 1692 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 3453 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:28:52,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 3453 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:28:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2025-01-09 20:28:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2387. [2025-01-09 20:28:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2387 states, 1628 states have (on average 1.2512285012285012) internal successors, (2037), 1712 states have internal predecessors, (2037), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:28:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 3275 transitions. [2025-01-09 20:28:52,789 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 3275 transitions. Word has length 108 [2025-01-09 20:28:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:52,790 INFO L471 AbstractCegarLoop]: Abstraction has 2387 states and 3275 transitions. [2025-01-09 20:28:52,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:28:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 3275 transitions. [2025-01-09 20:28:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 20:28:52,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:52,793 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:52,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:28:52,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-01-09 20:28:52,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1095257764, now seen corresponding path program 1 times [2025-01-09 20:28:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:52,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70642325] [2025-01-09 20:28:52,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:54,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 20:28:54,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 20:28:54,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:54,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 20:28:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70642325] [2025-01-09 20:28:55,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70642325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:55,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:55,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:28:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623635677] [2025-01-09 20:28:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:55,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:28:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:55,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:28:55,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:28:55,236 INFO L87 Difference]: Start difference. First operand 2387 states and 3275 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, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:28:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:55,371 INFO L93 Difference]: Finished difference Result 4087 states and 5546 transitions. [2025-01-09 20:28:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:28:55,371 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, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-01-09 20:28:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:55,383 INFO L225 Difference]: With dead ends: 4087 [2025-01-09 20:28:55,383 INFO L226 Difference]: Without dead ends: 2381 [2025-01-09 20:28:55,388 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:28:55,389 INFO L435 NwaCegarLoop]: 1723 mSDtfsCounter, 1714 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:28:55,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 1723 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:28:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2025-01-09 20:28:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2381. [2025-01-09 20:28:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1623 states have (on average 1.2495378927911276) internal successors, (2028), 1706 states have internal predecessors, (2028), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:28:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3266 transitions. [2025-01-09 20:28:55,498 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3266 transitions. Word has length 129 [2025-01-09 20:28:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:55,498 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 3266 transitions. [2025-01-09 20:28:55,498 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, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:28:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3266 transitions. [2025-01-09 20:28:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 20:28:55,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:55,502 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:55,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:28:55,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:28:55,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1073289419, now seen corresponding path program 1 times [2025-01-09 20:28:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10758194] [2025-01-09 20:28:55,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:28:57,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 20:28:57,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 20:28:57,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:28:57,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:28:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:28:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:28:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10758194] [2025-01-09 20:28:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10758194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:28:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:28:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:28:58,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470039414] [2025-01-09 20:28:58,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:28:58,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:28:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:28:58,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:28:58,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:28:58,062 INFO L87 Difference]: Start difference. First operand 2381 states and 3266 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:28:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:28:58,227 INFO L93 Difference]: Finished difference Result 2381 states and 3266 transitions. [2025-01-09 20:28:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:28:58,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2025-01-09 20:28:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:28:58,240 INFO L225 Difference]: With dead ends: 2381 [2025-01-09 20:28:58,240 INFO L226 Difference]: Without dead ends: 2379 [2025-01-09 20:28:58,242 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:28:58,242 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 1686 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 3439 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:28:58,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 3439 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:28:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-01-09 20:28:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2379. [2025-01-09 20:28:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 1622 states have (on average 1.2490752157829839) internal successors, (2026), 1704 states have internal predecessors, (2026), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:28:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3264 transitions. [2025-01-09 20:28:58,376 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3264 transitions. Word has length 114 [2025-01-09 20:28:58,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:28:58,378 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3264 transitions. [2025-01-09 20:28:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:28:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3264 transitions. [2025-01-09 20:28:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 20:28:58,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:28:58,381 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:28:58,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:28:58,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2025-01-09 20:28:58,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:28:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 176488491, now seen corresponding path program 1 times [2025-01-09 20:28:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:28:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429028837] [2025-01-09 20:28:58,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:28:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:00,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 20:29:00,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 20:29:00,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:00,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-09 20:29:00,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429028837] [2025-01-09 20:29:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429028837] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:29:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238006660] [2025-01-09 20:29:00,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:00,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:29:00,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:29:00,855 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:29:00,856 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:29:03,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 20:29:04,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 20:29:04,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:04,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:04,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 3384 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 20:29:04,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:29:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 20:29:04,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:29:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238006660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:29:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 20:29:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296105664] [2025-01-09 20:29:04,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:04,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:29:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:04,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:29:04,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:29:04,473 INFO L87 Difference]: Start difference. First operand 2379 states and 3264 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:29:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:04,612 INFO L93 Difference]: Finished difference Result 4071 states and 5524 transitions. [2025-01-09 20:29:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:29:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 135 [2025-01-09 20:29:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:04,624 INFO L225 Difference]: With dead ends: 4071 [2025-01-09 20:29:04,625 INFO L226 Difference]: Without dead ends: 2373 [2025-01-09 20:29:04,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:29:04,632 INFO L435 NwaCegarLoop]: 1716 mSDtfsCounter, 1702 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:04,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 1716 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-01-09 20:29:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2025-01-09 20:29:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 1617 states have (on average 1.2473716759431046) internal successors, (2017), 1698 states have internal predecessors, (2017), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:29:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3255 transitions. [2025-01-09 20:29:04,743 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3255 transitions. Word has length 135 [2025-01-09 20:29:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:04,744 INFO L471 AbstractCegarLoop]: Abstraction has 2373 states and 3255 transitions. [2025-01-09 20:29:04,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:29:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3255 transitions. [2025-01-09 20:29:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 20:29:04,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:04,745 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:29:04,763 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:29:04,946 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,SelfDestructingSolverStorable11 [2025-01-09 20:29:04,947 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:04,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1523062603, now seen corresponding path program 1 times [2025-01-09 20:29:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:04,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879951558] [2025-01-09 20:29:04,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:04,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:06,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 20:29:06,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 20:29:06,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:06,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:29:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879951558] [2025-01-09 20:29:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879951558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:07,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330608004] [2025-01-09 20:29:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:07,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:07,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:07,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:07,374 INFO L87 Difference]: Start difference. First operand 2373 states and 3255 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:29:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:07,562 INFO L93 Difference]: Finished difference Result 2373 states and 3255 transitions. [2025-01-09 20:29:07,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:07,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2025-01-09 20:29:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:07,574 INFO L225 Difference]: With dead ends: 2373 [2025-01-09 20:29:07,574 INFO L226 Difference]: Without dead ends: 2371 [2025-01-09 20:29:07,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:07,576 INFO L435 NwaCegarLoop]: 1713 mSDtfsCounter, 1678 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 3425 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:07,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 3425 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:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2025-01-09 20:29:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2371. [2025-01-09 20:29:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1616 states have (on average 1.2469059405940595) internal successors, (2015), 1696 states have internal predecessors, (2015), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:29:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3253 transitions. [2025-01-09 20:29:07,700 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3253 transitions. Word has length 120 [2025-01-09 20:29:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:07,700 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3253 transitions. [2025-01-09 20:29:07,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:29:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3253 transitions. [2025-01-09 20:29:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 20:29:07,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:07,702 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:29:07,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:29:07,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:29:07,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash -946460487, now seen corresponding path program 1 times [2025-01-09 20:29:07,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:07,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389264316] [2025-01-09 20:29:07,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:07,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:09,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 20:29:09,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 20:29:09,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:09,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:29:10,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:10,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389264316] [2025-01-09 20:29:10,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389264316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:10,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:10,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:10,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387333167] [2025-01-09 20:29:10,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:10,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:10,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:10,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:10,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:10,147 INFO L87 Difference]: Start difference. First operand 2371 states and 3253 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:29:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:10,317 INFO L93 Difference]: Finished difference Result 2371 states and 3253 transitions. [2025-01-09 20:29:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:10,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2025-01-09 20:29:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:10,338 INFO L225 Difference]: With dead ends: 2371 [2025-01-09 20:29:10,338 INFO L226 Difference]: Without dead ends: 2369 [2025-01-09 20:29:10,346 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:10,346 INFO L435 NwaCegarLoop]: 1711 mSDtfsCounter, 1675 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 3421 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:10,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 3421 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:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-01-09 20:29:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2025-01-09 20:29:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 1615 states have (on average 1.2464396284829722) internal successors, (2013), 1694 states have internal predecessors, (2013), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:29:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 3251 transitions. [2025-01-09 20:29:10,462 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 3251 transitions. Word has length 126 [2025-01-09 20:29:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:10,463 INFO L471 AbstractCegarLoop]: Abstraction has 2369 states and 3251 transitions. [2025-01-09 20:29:10,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:29:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 3251 transitions. [2025-01-09 20:29:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 20:29:10,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:10,465 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:29:10,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:29:10,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:29:10,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash -453271187, now seen corresponding path program 1 times [2025-01-09 20:29:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:10,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158896874] [2025-01-09 20:29:10,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:12,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 20:29:12,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 20:29:12,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:12,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:29:12,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158896874] [2025-01-09 20:29:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158896874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:12,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:12,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:12,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338003281] [2025-01-09 20:29:12,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:12,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:12,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:12,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:12,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:12,981 INFO L87 Difference]: Start difference. First operand 2369 states and 3251 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:29:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:13,157 INFO L93 Difference]: Finished difference Result 2369 states and 3251 transitions. [2025-01-09 20:29:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2025-01-09 20:29:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:13,172 INFO L225 Difference]: With dead ends: 2369 [2025-01-09 20:29:13,172 INFO L226 Difference]: Without dead ends: 2367 [2025-01-09 20:29:13,173 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:13,174 INFO L435 NwaCegarLoop]: 1709 mSDtfsCounter, 1672 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 3417 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:13,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 3417 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:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2025-01-09 20:29:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2025-01-09 20:29:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 1614 states have (on average 1.2459727385377943) internal successors, (2011), 1692 states have internal predecessors, (2011), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:29:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3249 transitions. [2025-01-09 20:29:13,292 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3249 transitions. Word has length 132 [2025-01-09 20:29:13,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:13,292 INFO L471 AbstractCegarLoop]: Abstraction has 2367 states and 3249 transitions. [2025-01-09 20:29:13,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:29:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3249 transitions. [2025-01-09 20:29:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 20:29:13,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:13,295 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:29:13,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:29:13,295 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:29:13,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1379142022, now seen corresponding path program 1 times [2025-01-09 20:29:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797876336] [2025-01-09 20:29:13,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:15,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 20:29:15,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 20:29:15,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:15,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:29:15,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797876336] [2025-01-09 20:29:15,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797876336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:15,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:15,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752553979] [2025-01-09 20:29:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:15,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:15,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:15,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:15,672 INFO L87 Difference]: Start difference. First operand 2367 states and 3249 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:29:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:15,848 INFO L93 Difference]: Finished difference Result 2367 states and 3249 transitions. [2025-01-09 20:29:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:15,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2025-01-09 20:29:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:15,857 INFO L225 Difference]: With dead ends: 2367 [2025-01-09 20:29:15,857 INFO L226 Difference]: Without dead ends: 2365 [2025-01-09 20:29:15,859 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:15,860 INFO L435 NwaCegarLoop]: 1707 mSDtfsCounter, 1669 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 3413 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:15,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 3413 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:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-01-09 20:29:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2365. [2025-01-09 20:29:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 1613 states have (on average 1.245505269683819) internal successors, (2009), 1690 states have internal predecessors, (2009), 620 states have call successors, (620), 121 states have call predecessors, (620), 120 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-01-09 20:29:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3247 transitions. [2025-01-09 20:29:16,004 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3247 transitions. Word has length 138 [2025-01-09 20:29:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:16,005 INFO L471 AbstractCegarLoop]: Abstraction has 2365 states and 3247 transitions. [2025-01-09 20:29:16,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:29:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3247 transitions. [2025-01-09 20:29:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 20:29:16,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:16,008 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:29:16,008 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:16,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash 795126269, now seen corresponding path program 1 times [2025-01-09 20:29:16,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:16,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786442332] [2025-01-09 20:29:16,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:17,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 20:29:18,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 20:29:18,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:18,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-01-09 20:29:19,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:19,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786442332] [2025-01-09 20:29:19,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786442332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:19,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:19,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:29:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217414300] [2025-01-09 20:29:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:29:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:19,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:29:19,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:19,064 INFO L87 Difference]: Start difference. First operand 2365 states and 3247 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:29:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:19,505 INFO L93 Difference]: Finished difference Result 3536 states and 4820 transitions. [2025-01-09 20:29:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:29:19,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2025-01-09 20:29:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:19,517 INFO L225 Difference]: With dead ends: 3536 [2025-01-09 20:29:19,518 INFO L226 Difference]: Without dead ends: 3534 [2025-01-09 20:29:19,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:29:19,520 INFO L435 NwaCegarLoop]: 1960 mSDtfsCounter, 1657 mSDsluCounter, 4734 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 6694 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:19,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 6694 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:29:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3534 states. [2025-01-09 20:29:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3534 to 3489. [2025-01-09 20:29:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 2367 states have (on average 1.2429235318969158) internal successors, (2942), 2482 states have internal predecessors, (2942), 908 states have call successors, (908), 203 states have call predecessors, (908), 202 states have return successors, (926), 884 states have call predecessors, (926), 906 states have call successors, (926) [2025-01-09 20:29:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 4776 transitions. [2025-01-09 20:29:19,739 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 4776 transitions. Word has length 183 [2025-01-09 20:29:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:19,739 INFO L471 AbstractCegarLoop]: Abstraction has 3489 states and 4776 transitions. [2025-01-09 20:29:19,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:29:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4776 transitions. [2025-01-09 20:29:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 20:29:19,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:19,742 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:29:19,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:29:19,742 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:29:19,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:19,743 INFO L85 PathProgramCache]: Analyzing trace with hash -568876262, now seen corresponding path program 1 times [2025-01-09 20:29:19,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:19,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006097100] [2025-01-09 20:29:19,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:21,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 20:29:21,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 20:29:21,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:21,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:29:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:22,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006097100] [2025-01-09 20:29:22,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006097100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:22,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:22,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573506851] [2025-01-09 20:29:22,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:22,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:22,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:22,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:22,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:22,358 INFO L87 Difference]: Start difference. First operand 3489 states and 4776 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 20:29:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:22,655 INFO L93 Difference]: Finished difference Result 3489 states and 4776 transitions. [2025-01-09 20:29:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:22,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-01-09 20:29:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:22,669 INFO L225 Difference]: With dead ends: 3489 [2025-01-09 20:29:22,669 INFO L226 Difference]: Without dead ends: 3487 [2025-01-09 20:29:22,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:22,671 INFO L435 NwaCegarLoop]: 1705 mSDtfsCounter, 1666 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 3409 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:22,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1666 Valid, 3409 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:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2025-01-09 20:29:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3487. [2025-01-09 20:29:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3487 states, 2366 states have (on average 1.24218089602705) internal successors, (2939), 2480 states have internal predecessors, (2939), 908 states have call successors, (908), 203 states have call predecessors, (908), 202 states have return successors, (926), 884 states have call predecessors, (926), 906 states have call successors, (926) [2025-01-09 20:29:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 3487 states and 4773 transitions. [2025-01-09 20:29:22,877 INFO L78 Accepts]: Start accepts. Automaton has 3487 states and 4773 transitions. Word has length 144 [2025-01-09 20:29:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:22,877 INFO L471 AbstractCegarLoop]: Abstraction has 3487 states and 4773 transitions. [2025-01-09 20:29:22,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 20:29:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3487 states and 4773 transitions. [2025-01-09 20:29:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 20:29:22,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:22,880 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:29:22,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:29:22,881 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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:29:22,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 389486513, now seen corresponding path program 1 times [2025-01-09 20:29:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:22,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048005960] [2025-01-09 20:29:22,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:24,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 20:29:24,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 20:29:24,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:24,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:29:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048005960] [2025-01-09 20:29:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048005960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:25,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:25,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:25,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454803530] [2025-01-09 20:29:25,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:25,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:25,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:25,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:25,567 INFO L87 Difference]: Start difference. First operand 3487 states and 4773 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:29:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:25,815 INFO L93 Difference]: Finished difference Result 3487 states and 4773 transitions. [2025-01-09 20:29:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:25,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2025-01-09 20:29:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:25,829 INFO L225 Difference]: With dead ends: 3487 [2025-01-09 20:29:25,829 INFO L226 Difference]: Without dead ends: 3485 [2025-01-09 20:29:25,832 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:25,832 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 1663 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1663 SdHoareTripleChecker+Valid, 3405 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:25,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1663 Valid, 3405 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:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2025-01-09 20:29:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3485. [2025-01-09 20:29:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 2365 states have (on average 1.2414376321353064) internal successors, (2936), 2478 states have internal predecessors, (2936), 908 states have call successors, (908), 203 states have call predecessors, (908), 202 states have return successors, (926), 884 states have call predecessors, (926), 906 states have call successors, (926) [2025-01-09 20:29:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 4770 transitions. [2025-01-09 20:29:26,042 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 4770 transitions. Word has length 150 [2025-01-09 20:29:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:26,043 INFO L471 AbstractCegarLoop]: Abstraction has 3485 states and 4770 transitions. [2025-01-09 20:29:26,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:29:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 4770 transitions. [2025-01-09 20:29:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 20:29:26,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:26,047 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:29:26,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:29:26,047 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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:29:26,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -920349577, now seen corresponding path program 1 times [2025-01-09 20:29:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:26,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323448743] [2025-01-09 20:29:26,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:28,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 20:29:28,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 20:29:28,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:28,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 20:29:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323448743] [2025-01-09 20:29:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323448743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:28,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:28,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:28,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501737731] [2025-01-09 20:29:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:28,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:28,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:28,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:28,547 INFO L87 Difference]: Start difference. First operand 3485 states and 4770 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:29:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:28,813 INFO L93 Difference]: Finished difference Result 3485 states and 4770 transitions. [2025-01-09 20:29:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:28,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2025-01-09 20:29:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:28,827 INFO L225 Difference]: With dead ends: 3485 [2025-01-09 20:29:28,828 INFO L226 Difference]: Without dead ends: 3483 [2025-01-09 20:29:28,830 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:28,832 INFO L435 NwaCegarLoop]: 1701 mSDtfsCounter, 1660 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 3401 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:28,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 3401 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:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2025-01-09 20:29:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 3483. [2025-01-09 20:29:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3483 states, 2364 states have (on average 1.240693739424704) internal successors, (2933), 2476 states have internal predecessors, (2933), 908 states have call successors, (908), 203 states have call predecessors, (908), 202 states have return successors, (926), 884 states have call predecessors, (926), 906 states have call successors, (926) [2025-01-09 20:29:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 4767 transitions. [2025-01-09 20:29:29,066 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 4767 transitions. Word has length 156 [2025-01-09 20:29:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:29,067 INFO L471 AbstractCegarLoop]: Abstraction has 3483 states and 4767 transitions. [2025-01-09 20:29:29,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:29:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 4767 transitions. [2025-01-09 20:29:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 20:29:29,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:29,071 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:29:29,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:29:29,071 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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:29:29,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1677241329, now seen corresponding path program 1 times [2025-01-09 20:29:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:29,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017916756] [2025-01-09 20:29:29,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:31,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 20:29:31,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 20:29:31,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:31,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat