./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:55:32,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:55:32,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 05:55:32,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:55:32,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:55:32,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:55:32,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:55:32,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:55:32,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:55:32,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:55:32,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:55:32,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:55:32,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:55:32,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:55:32,490 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:55:32,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:55:32,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:55:32,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:55:32,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:55:32,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:55:32,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:55:32,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:55:32,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:55:32,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:55:32,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:55:32,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:55:32,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:55:32,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:55:32,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:55:32,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:55:32,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:55:32,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:55:32,492 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:55:32,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:55:32,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:55:32,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:55:32,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:55:32,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:55:32,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:55:32,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:55:32,493 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c [2025-03-04 05:55:32,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:55:32,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:55:32,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:55:32,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:55:32,724 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:55:32,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-03-04 05:55:33,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db76549d0/5c9ce19ceb96410fad5376fe3cda21b8/FLAG5b2bef115 [2025-03-04 05:55:34,432 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:55:34,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-03-04 05:55:34,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db76549d0/5c9ce19ceb96410fad5376fe3cda21b8/FLAG5b2bef115 [2025-03-04 05:55:34,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db76549d0/5c9ce19ceb96410fad5376fe3cda21b8 [2025-03-04 05:55:34,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:55:34,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:55:34,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:55:34,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:55:34,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:55:34,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:55:34" (1/1) ... [2025-03-04 05:55:34,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb12a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:34, skipping insertion in model container [2025-03-04 05:55:34,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:55:34" (1/1) ... [2025-03-04 05:55:35,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:55:37,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2025-03-04 05:55:37,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2025-03-04 05:55:37,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2025-03-04 05:55:37,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2025-03-04 05:55:37,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2025-03-04 05:55:37,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2025-03-04 05:55:37,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2025-03-04 05:55:37,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2025-03-04 05:55:37,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2025-03-04 05:55:37,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2025-03-04 05:55:37,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2025-03-04 05:55:37,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2025-03-04 05:55:37,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2025-03-04 05:55:37,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2025-03-04 05:55:37,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2025-03-04 05:55:37,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2025-03-04 05:55:37,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2025-03-04 05:55:37,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2025-03-04 05:55:37,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2025-03-04 05:55:37,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2025-03-04 05:55:37,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2025-03-04 05:55:37,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2025-03-04 05:55:37,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2025-03-04 05:55:37,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2025-03-04 05:55:37,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2025-03-04 05:55:37,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2025-03-04 05:55:37,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2025-03-04 05:55:37,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2025-03-04 05:55:37,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2025-03-04 05:55:37,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2025-03-04 05:55:37,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2025-03-04 05:55:37,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2025-03-04 05:55:37,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2025-03-04 05:55:37,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2025-03-04 05:55:37,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2025-03-04 05:55:37,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2025-03-04 05:55:37,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2025-03-04 05:55:37,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2025-03-04 05:55:37,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2025-03-04 05:55:37,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2025-03-04 05:55:37,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2025-03-04 05:55:37,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2025-03-04 05:55:37,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2025-03-04 05:55:37,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2025-03-04 05:55:37,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2025-03-04 05:55:37,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2025-03-04 05:55:37,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2025-03-04 05:55:37,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2025-03-04 05:55:37,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2025-03-04 05:55:37,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2025-03-04 05:55:37,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2025-03-04 05:55:37,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2025-03-04 05:55:37,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2025-03-04 05:55:37,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2025-03-04 05:55:37,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2025-03-04 05:55:37,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2025-03-04 05:55:37,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2025-03-04 05:55:37,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2025-03-04 05:55:37,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2025-03-04 05:55:37,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2025-03-04 05:55:37,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2025-03-04 05:55:37,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2025-03-04 05:55:37,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2025-03-04 05:55:37,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2025-03-04 05:55:37,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2025-03-04 05:55:37,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2025-03-04 05:55:37,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2025-03-04 05:55:37,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2025-03-04 05:55:37,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2025-03-04 05:55:37,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2025-03-04 05:55:37,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2025-03-04 05:55:37,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2025-03-04 05:55:37,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2025-03-04 05:55:37,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2025-03-04 05:55:37,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2025-03-04 05:55:37,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2025-03-04 05:55:37,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2025-03-04 05:55:37,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2025-03-04 05:55:37,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2025-03-04 05:55:37,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2025-03-04 05:55:37,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2025-03-04 05:55:37,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2025-03-04 05:55:37,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2025-03-04 05:55:37,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2025-03-04 05:55:37,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2025-03-04 05:55:37,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2025-03-04 05:55:37,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2025-03-04 05:55:37,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2025-03-04 05:55:37,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:55:37,696 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:55:37,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgb %2,%1": "=a" (__ret), "+m" (*__ptr): "q" (__new), "0" (__old): "memory"); [7080-7081] [2025-03-04 05:55:37,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgw %2,%1": "=a" (__ret), "+m" (*__ptr___0): "r" (__new), "0" (__old): "memory"); [7085-7086] [2025-03-04 05:55:37,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgl %2,%1": "=a" (__ret), "+m" (*__ptr___1): "r" (__new), "0" (__old): "memory"); [7090-7091] [2025-03-04 05:55:37,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgq %2,%1": "=a" (__ret), "+m" (*__ptr___2): "r" (__new), "0" (__old): "memory"); [7095-7096] [2025-03-04 05:55:37,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/net/netns/generic.h"), "i" (41), "i" (12UL)); [7547-7548] [2025-03-04 05:55:37,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/net/netns/generic.h"), "i" (41), "i" (12UL)); [7557-7558] [2025-03-04 05:55:37,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/net/netns/generic.h"), "i" (45), "i" (12UL)); [7571-7572] [2025-03-04 05:55:37,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"net/netfilter/nfnetlink_log.c"), "i" (581), "i" (12UL)); [8504-8505] [2025-03-04 05:55:37,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2025-03-04 05:55:37,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2025-03-04 05:55:37,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2025-03-04 05:55:37,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2025-03-04 05:55:37,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2025-03-04 05:55:37,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2025-03-04 05:55:37,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2025-03-04 05:55:37,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2025-03-04 05:55:37,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2025-03-04 05:55:37,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2025-03-04 05:55:37,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2025-03-04 05:55:37,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2025-03-04 05:55:37,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2025-03-04 05:55:37,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2025-03-04 05:55:37,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2025-03-04 05:55:37,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2025-03-04 05:55:37,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2025-03-04 05:55:37,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2025-03-04 05:55:37,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2025-03-04 05:55:37,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2025-03-04 05:55:37,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2025-03-04 05:55:37,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2025-03-04 05:55:37,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2025-03-04 05:55:37,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2025-03-04 05:55:37,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2025-03-04 05:55:37,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2025-03-04 05:55:37,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2025-03-04 05:55:37,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2025-03-04 05:55:37,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2025-03-04 05:55:37,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2025-03-04 05:55:37,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2025-03-04 05:55:37,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2025-03-04 05:55:37,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2025-03-04 05:55:37,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2025-03-04 05:55:37,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2025-03-04 05:55:37,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2025-03-04 05:55:37,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2025-03-04 05:55:37,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2025-03-04 05:55:37,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2025-03-04 05:55:37,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2025-03-04 05:55:37,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2025-03-04 05:55:37,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2025-03-04 05:55:37,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2025-03-04 05:55:37,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2025-03-04 05:55:37,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2025-03-04 05:55:37,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2025-03-04 05:55:37,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2025-03-04 05:55:37,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2025-03-04 05:55:37,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2025-03-04 05:55:37,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2025-03-04 05:55:37,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2025-03-04 05:55:37,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2025-03-04 05:55:37,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2025-03-04 05:55:37,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2025-03-04 05:55:37,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2025-03-04 05:55:37,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2025-03-04 05:55:37,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2025-03-04 05:55:37,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2025-03-04 05:55:37,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2025-03-04 05:55:37,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2025-03-04 05:55:37,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2025-03-04 05:55:37,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2025-03-04 05:55:37,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2025-03-04 05:55:37,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2025-03-04 05:55:37,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2025-03-04 05:55:37,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2025-03-04 05:55:37,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2025-03-04 05:55:37,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2025-03-04 05:55:37,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2025-03-04 05:55:37,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2025-03-04 05:55:37,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2025-03-04 05:55:37,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2025-03-04 05:55:38,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2025-03-04 05:55:38,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2025-03-04 05:55:38,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2025-03-04 05:55:38,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2025-03-04 05:55:38,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2025-03-04 05:55:38,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2025-03-04 05:55:38,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2025-03-04 05:55:38,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2025-03-04 05:55:38,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2025-03-04 05:55:38,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2025-03-04 05:55:38,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2025-03-04 05:55:38,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2025-03-04 05:55:38,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2025-03-04 05:55:38,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2025-03-04 05:55:38,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2025-03-04 05:55:38,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2025-03-04 05:55:38,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:55:38,129 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: __cmpxchg_wrong_size [2025-03-04 05:55:38,135 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:55:38,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38 WrapperNode [2025-03-04 05:55:38,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:55:38,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:55:38,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:55:38,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:55:38,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,309 INFO L138 Inliner]: procedures = 618, calls = 1465, calls flagged for inlining = 276, calls inlined = 181, statements flattened = 2717 [2025-03-04 05:55:38,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:55:38,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:55:38,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:55:38,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:55:38,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,658 INFO L175 MemorySlicer]: Split 248 memory accesses to 24 slices as follows [103, 16, 1, 6, 4, 31, 7, 4, 2, 12, 10, 3, 1, 1, 1, 4, 1, 2, 1, 4, 8, 19, 3, 4]. 42 percent of accesses are in the largest equivalence class. The 36 initializations are split as follows [4, 4, 0, 6, 4, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 4, 0, 0, 0, 4]. The 112 writes are split as follows [47, 12, 0, 0, 0, 31, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 0]. [2025-03-04 05:55:38,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:55:38,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:55:38,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:55:38,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:55:38,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (1/1) ... [2025-03-04 05:55:38,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:55:38,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:55:38,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:55:38,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:55:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2025-03-04 05:55:38,812 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2025-03-04 05:55:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:55:38,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-04 05:55:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2025-03-04 05:55:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2025-03-04 05:55:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 05:55:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 05:55:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2025-03-04 05:55:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2025-03-04 05:55:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 05:55:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 05:55:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:55:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-04 05:55:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:55:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:55:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2025-03-04 05:55:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2025-03-04 05:55:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2025-03-04 05:55:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2025-03-04 05:55:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2025-03-04 05:55:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2025-03-04 05:55:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:55:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-04 05:55:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2025-03-04 05:55:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2025-03-04 05:55:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:55:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-04 05:55:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 05:55:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 05:55:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-04 05:55:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-04 05:55:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-03-04 05:55:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-03-04 05:55:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 05:55:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:55:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2025-03-04 05:55:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:55:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-04 05:55:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-04 05:55:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-04 05:55:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-04 05:55:38,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-04 05:55:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2025-03-04 05:55:38,816 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:55:38,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:55:38,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:55:38,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2025-03-04 05:55:38,816 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2025-03-04 05:55:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2025-03-04 05:55:38,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2025-03-04 05:55:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:55:38,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-04 05:55:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 05:55:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 05:55:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 05:55:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:55:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2025-03-04 05:55:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2025-03-04 05:55:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2025-03-04 05:55:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2025-03-04 05:55:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2025-03-04 05:55:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-03-04 05:55:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2025-03-04 05:55:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:55:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2025-03-04 05:55:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2025-03-04 05:55:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:55:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:55:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 05:55:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2025-03-04 05:55:38,824 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 05:55:38,824 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2025-03-04 05:55:38,824 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2025-03-04 05:55:38,824 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2025-03-04 05:55:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-04 05:55:38,827 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-04 05:55:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:55:38,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-04 05:55:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 05:55:38,828 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 05:55:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2025-03-04 05:55:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 05:55:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 05:55:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-04 05:55:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2025-03-04 05:55:38,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2025-03-04 05:55:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2025-03-04 05:55:38,832 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2025-03-04 05:55:39,352 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:55:39,356 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:55:39,418 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15709: havoc #t~nondet826; [2025-03-04 05:55:39,420 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 05:55:39,444 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15697: havoc seq_open_net_#t~nondet823#1; [2025-03-04 05:55:39,449 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15589: havoc #t~nondet800; [2025-03-04 05:55:39,471 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15705: havoc #t~nondet825; [2025-03-04 05:55:39,477 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10006: #res#1 := ~arg0#1; [2025-03-04 05:55:39,495 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc #t~mem124; [2025-03-04 05:55:39,545 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15660: havoc nfnetlink_unicast_#t~nondet812#1; [2025-03-04 05:55:39,549 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7035: havoc #t~mem17; [2025-03-04 05:55:39,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7262: havoc skb_is_nonlinear_#t~mem56#1; [2025-03-04 05:55:39,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7273: havoc #t~ite62#1;havoc #t~mem60#1;havoc #t~mem61#1; [2025-03-04 05:55:39,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15671: havoc #t~nondet817; [2025-03-04 05:55:39,753 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6976: havoc #t~bitwise4; [2025-03-04 05:55:39,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15656: havoc #t~nondet811; [2025-03-04 05:55:39,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15628: havoc #t~nondet806; [2025-03-04 05:55:39,876 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15682: havoc #t~nondet820; [2025-03-04 05:55:39,879 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7311: havoc #t~mem84.base, #t~mem84.offset;havoc #t~mem85.base, #t~mem85.offset; [2025-03-04 05:55:39,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15564: havoc __nlmsg_put_#t~ret799#1.base, __nlmsg_put_#t~ret799#1.offset; [2025-03-04 05:55:39,977 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15678: havoc #t~nondet819; [2025-03-04 05:55:40,008 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15701: havoc seq_printf_#t~nondet824#1; [2025-03-04 05:55:40,051 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9505-1: ldv_del_timer_#res#1 := ldv_del_timer_~arg0#1; [2025-03-04 05:55:40,051 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10559-1: ldv_del_timer_148_#res#1 := ldv_del_timer_148_~ldv_func_res~0#1; [2025-03-04 05:55:40,051 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15593: havoc del_timer_#t~nondet801#1; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15693: havoc seq_lseek_#t~nondet822#1; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10574-1: ldv_netlink_register_notifier_155_#res#1 := ldv_netlink_register_notifier_155_~ldv_func_res~1#1; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15632: havoc nf_log_bind_pf_#t~nondet807#1; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7011: havoc hlist_empty_#t~mem8#1.base, hlist_empty_#t~mem8#1.offset; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7343: havoc read_pnet_#t~mem88#1.base, read_pnet_#t~mem88#1.offset; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15636: havoc nf_log_register_#t~nondet808#1; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9294: call ULTIMATE.dealloc(nfnl_log_net_init_~#__key~1#1.base, nfnl_log_net_init_~#__key~1#1.offset);havoc nfnl_log_net_init_~#__key~1#1.base, nfnl_log_net_init_~#__key~1#1.offset; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7479: havoc nla_get_be16_#t~mem126#1; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15674: havoc proc_create_data_#t~ret818#1.base, proc_create_data_#t~ret818#1.offset; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9994-1: ldv_netlink_register_notifier_#res#1 := ldv_netlink_register_notifier_~arg0#1; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10589-1: ldv_netlink_unregister_notifier_156_#res#1 := ldv_netlink_unregister_notifier_156_~ldv_func_res~2#1; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7485: havoc sk_user_ns_#t~mem127#1.base, sk_user_ns_#t~mem127#1.offset;havoc sk_user_ns_#t~mem128#1.base, sk_user_ns_#t~mem128#1.offset;havoc sk_user_ns_#t~mem129#1.base, sk_user_ns_#t~mem129#1.offset;havoc sk_user_ns_#t~mem130#1.base, sk_user_ns_#t~mem130#1.offset; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7789: call ULTIMATE.dealloc(instance_create_~#__key~0#1.base, instance_create_~#__key~0#1.offset);havoc instance_create_~#__key~0#1.base, instance_create_~#__key~0#1.offset;call ULTIMATE.dealloc(instance_create_~#__key___0~0#1.base, instance_create_~#__key___0~0#1.offset);havoc instance_create_~#__key___0~0#1.base, instance_create_~#__key___0~0#1.offset; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15652: havoc nfnetlink_subsys_register_#t~nondet810#1; [2025-03-04 05:55:44,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15686: havoc register_pernet_subsys_#t~nondet821#1; [2025-03-04 05:55:44,810 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15624: havoc netlink_register_notifier_#t~nondet805#1; [2025-03-04 05:55:44,810 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10604-1: ldv_netlink_unregister_notifier_157_#res#1 := ldv_netlink_unregister_notifier_157_~ldv_func_res~3#1; [2025-03-04 05:55:45,137 INFO L? ?]: Removed 1552 outVars from TransFormulas that were not future-live. [2025-03-04 05:55:45,137 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:55:45,173 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:55:45,175 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 05:55:45,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:55:45 BoogieIcfgContainer [2025-03-04 05:55:45,176 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:55:45,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:55:45,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:55:45,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:55:45,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:55:34" (1/3) ... [2025-03-04 05:55:45,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0ed3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:55:45, skipping insertion in model container [2025-03-04 05:55:45,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:55:38" (2/3) ... [2025-03-04 05:55:45,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0ed3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:55:45, skipping insertion in model container [2025-03-04 05:55:45,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:55:45" (3/3) ... [2025-03-04 05:55:45,183 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-03-04 05:55:45,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:55:45,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i that has 86 procedures, 1133 locations, 1 initial locations, 1 loop locations, and 32 error locations. [2025-03-04 05:55:45,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:55:45,281 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;@5f66b0de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:55:45,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-03-04 05:55:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 1132 states, 752 states have (on average 1.2486702127659575) internal successors, (939), 809 states have internal predecessors, (939), 263 states have call successors, (263), 85 states have call predecessors, (263), 84 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-04 05:55:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 05:55:45,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:45,298 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:45,299 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_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:45,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:45,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1936976021, now seen corresponding path program 1 times [2025-03-04 05:55:45,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:45,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914397353] [2025-03-04 05:55:45,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:45,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 05:55:46,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 05:55:46,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:46,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:46,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:46,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914397353] [2025-03-04 05:55:46,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914397353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:46,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:46,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728667311] [2025-03-04 05:55:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:46,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:46,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:46,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:46,636 INFO L87 Difference]: Start difference. First operand has 1132 states, 752 states have (on average 1.2486702127659575) internal successors, (939), 809 states have internal predecessors, (939), 263 states have call successors, (263), 85 states have call predecessors, (263), 84 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 05:55:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:46,847 INFO L93 Difference]: Finished difference Result 2229 states and 2965 transitions. [2025-03-04 05:55:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:46,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 70 [2025-03-04 05:55:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:46,869 INFO L225 Difference]: With dead ends: 2229 [2025-03-04 05:55:46,869 INFO L226 Difference]: Without dead ends: 1106 [2025-03-04 05:55:46,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:46,883 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 1374 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:46,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2809 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:55:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-04 05:55:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2025-03-04 05:55:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 735 states have (on average 1.1918367346938776) internal successors, (876), 786 states have internal predecessors, (876), 258 states have call successors, (258), 84 states have call predecessors, (258), 83 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 05:55:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1390 transitions. [2025-03-04 05:55:47,008 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1390 transitions. Word has length 70 [2025-03-04 05:55:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:47,010 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1390 transitions. [2025-03-04 05:55:47,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 05:55:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1390 transitions. [2025-03-04 05:55:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 05:55:47,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:47,012 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:47,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:55:47,012 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_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash -795744948, now seen corresponding path program 1 times [2025-03-04 05:55:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459180084] [2025-03-04 05:55:47,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:47,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:47,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 05:55:47,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 05:55:47,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:47,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:47,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459180084] [2025-03-04 05:55:47,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459180084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:47,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399643260] [2025-03-04 05:55:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:47,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:47,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:47,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:47,817 INFO L87 Difference]: Start difference. First operand 1106 states and 1390 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 05:55:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:47,927 INFO L93 Difference]: Finished difference Result 1106 states and 1390 transitions. [2025-03-04 05:55:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:47,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 76 [2025-03-04 05:55:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:47,939 INFO L225 Difference]: With dead ends: 1106 [2025-03-04 05:55:47,939 INFO L226 Difference]: Without dead ends: 1104 [2025-03-04 05:55:47,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:47,942 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 1353 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:47,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 2769 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:55:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2025-03-04 05:55:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2025-03-04 05:55:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 734 states have (on average 1.1907356948228882) internal successors, (874), 784 states have internal predecessors, (874), 258 states have call successors, (258), 84 states have call predecessors, (258), 83 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 05:55:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1388 transitions. [2025-03-04 05:55:48,011 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1388 transitions. Word has length 76 [2025-03-04 05:55:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:48,014 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1388 transitions. [2025-03-04 05:55:48,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 05:55:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1388 transitions. [2025-03-04 05:55:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 05:55:48,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:48,019 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:48,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:55:48,019 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_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:48,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 181132603, now seen corresponding path program 1 times [2025-03-04 05:55:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:48,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934477622] [2025-03-04 05:55:48,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:48,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 05:55:48,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 05:55:48,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:48,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:48,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:48,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934477622] [2025-03-04 05:55:48,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934477622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:48,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470291166] [2025-03-04 05:55:48,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:48,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:48,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:48,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:48,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:48,831 INFO L87 Difference]: Start difference. First operand 1104 states and 1388 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 05:55:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:48,910 INFO L93 Difference]: Finished difference Result 1104 states and 1388 transitions. [2025-03-04 05:55:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 82 [2025-03-04 05:55:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:48,915 INFO L225 Difference]: With dead ends: 1104 [2025-03-04 05:55:48,916 INFO L226 Difference]: Without dead ends: 1102 [2025-03-04 05:55:48,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:48,917 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 1350 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:48,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2765 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:55:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-03-04 05:55:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2025-03-04 05:55:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 733 states have (on average 1.189631650750341) internal successors, (872), 782 states have internal predecessors, (872), 258 states have call successors, (258), 84 states have call predecessors, (258), 83 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 05:55:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1386 transitions. [2025-03-04 05:55:48,959 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1386 transitions. Word has length 82 [2025-03-04 05:55:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:48,959 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1386 transitions. [2025-03-04 05:55:48,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 05:55:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1386 transitions. [2025-03-04 05:55:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 05:55:48,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:48,962 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 05:55:48,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:55:48,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting nfnl_log_pernetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:48,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash 756773291, now seen corresponding path program 1 times [2025-03-04 05:55:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:48,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101172334] [2025-03-04 05:55:48,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:49,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 05:55:49,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 05:55:49,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:49,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 05:55:49,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:49,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101172334] [2025-03-04 05:55:49,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101172334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:49,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:49,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:55:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109597949] [2025-03-04 05:55:49,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:49,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:55:49,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:49,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:55:49,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:49,776 INFO L87 Difference]: Start difference. First operand 1102 states and 1386 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 05:55:53,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:55:54,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:54,904 INFO L93 Difference]: Finished difference Result 1821 states and 2249 transitions. [2025-03-04 05:55:54,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:55:54,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2025-03-04 05:55:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:54,913 INFO L225 Difference]: With dead ends: 1821 [2025-03-04 05:55:54,913 INFO L226 Difference]: Without dead ends: 1819 [2025-03-04 05:55:54,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:55:54,915 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 845 mSDsluCounter, 4070 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 5598 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:54,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 5598 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-04 05:55:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-03-04 05:55:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1624. [2025-03-04 05:55:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1079 states have (on average 1.1779425393883225) internal successors, (1271), 1144 states have internal predecessors, (1271), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-04 05:55:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2041 transitions. [2025-03-04 05:55:54,985 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2041 transitions. Word has length 97 [2025-03-04 05:55:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:54,986 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2041 transitions. [2025-03-04 05:55:54,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 05:55:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2041 transitions. [2025-03-04 05:55:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 05:55:54,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:54,989 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:54,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:55:54,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1980409754, now seen corresponding path program 1 times [2025-03-04 05:55:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719866078] [2025-03-04 05:55:54,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:55,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 05:55:55,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 05:55:55,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:55,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:55,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:55,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719866078] [2025-03-04 05:55:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719866078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:55,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:55,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:55,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565596750] [2025-03-04 05:55:55,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:55,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:55,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:55,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:55,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:55,681 INFO L87 Difference]: Start difference. First operand 1624 states and 2041 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 05:55:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:55,783 INFO L93 Difference]: Finished difference Result 1624 states and 2041 transitions. [2025-03-04 05:55:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:55,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 88 [2025-03-04 05:55:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:55,793 INFO L225 Difference]: With dead ends: 1624 [2025-03-04 05:55:55,794 INFO L226 Difference]: Without dead ends: 1622 [2025-03-04 05:55:55,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:55,796 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 1347 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:55,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 2761 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:55:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-04 05:55:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2025-03-04 05:55:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1078 states have (on average 1.1771799628942485) internal successors, (1269), 1142 states have internal predecessors, (1269), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-04 05:55:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2039 transitions. [2025-03-04 05:55:55,884 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2039 transitions. Word has length 88 [2025-03-04 05:55:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:55,885 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2039 transitions. [2025-03-04 05:55:55,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 05:55:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2039 transitions. [2025-03-04 05:55:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 05:55:55,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:55,887 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:55,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:55:55,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:55,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash 367553455, now seen corresponding path program 1 times [2025-03-04 05:55:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432448152] [2025-03-04 05:55:55,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:55,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:56,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 05:55:56,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 05:55:56,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:56,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:56,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:56,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432448152] [2025-03-04 05:55:56,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432448152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:56,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:56,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:56,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461768566] [2025-03-04 05:55:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:56,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:56,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:56,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:56,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:56,680 INFO L87 Difference]: Start difference. First operand 1622 states and 2039 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:55:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:56,765 INFO L93 Difference]: Finished difference Result 1622 states and 2039 transitions. [2025-03-04 05:55:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 94 [2025-03-04 05:55:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:56,773 INFO L225 Difference]: With dead ends: 1622 [2025-03-04 05:55:56,773 INFO L226 Difference]: Without dead ends: 1620 [2025-03-04 05:55:56,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:56,775 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 1344 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 2757 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:56,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 2757 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:55:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-03-04 05:55:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2025-03-04 05:55:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1077 states have (on average 1.1764159702878365) internal successors, (1267), 1140 states have internal predecessors, (1267), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-04 05:55:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2037 transitions. [2025-03-04 05:55:56,860 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2037 transitions. Word has length 94 [2025-03-04 05:55:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:56,860 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2037 transitions. [2025-03-04 05:55:56,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 05:55:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2037 transitions. [2025-03-04 05:55:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 05:55:56,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:56,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:56,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 05:55:56,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:56,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1797485288, now seen corresponding path program 1 times [2025-03-04 05:55:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049817558] [2025-03-04 05:55:56,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:57,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 05:55:57,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 05:55:57,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:57,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:57,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049817558] [2025-03-04 05:55:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049817558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:57,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:57,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:57,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857906622] [2025-03-04 05:55:57,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:57,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:57,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:57,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:57,436 INFO L87 Difference]: Start difference. First operand 1620 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:55:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:57,545 INFO L93 Difference]: Finished difference Result 1620 states and 2037 transitions. [2025-03-04 05:55:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:57,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (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 100 [2025-03-04 05:55:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:57,560 INFO L225 Difference]: With dead ends: 1620 [2025-03-04 05:55:57,560 INFO L226 Difference]: Without dead ends: 1618 [2025-03-04 05:55:57,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:57,564 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 1341 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:57,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 2753 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:55:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-03-04 05:55:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2025-03-04 05:55:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1076 states have (on average 1.1756505576208178) internal successors, (1265), 1138 states have internal predecessors, (1265), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-04 05:55:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2035 transitions. [2025-03-04 05:55:57,679 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2035 transitions. Word has length 100 [2025-03-04 05:55:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:57,679 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2035 transitions. [2025-03-04 05:55:57,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:55:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2035 transitions. [2025-03-04 05:55:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 05:55:57,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:57,683 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:55:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:55:57,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:57,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash -580253685, now seen corresponding path program 1 times [2025-03-04 05:55:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586900517] [2025-03-04 05:55:57,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:58,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 05:55:58,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 05:55:58,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:58,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:55:58,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586900517] [2025-03-04 05:55:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586900517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:55:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138949020] [2025-03-04 05:55:58,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:55:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:58,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:55:58,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:55:58,255 INFO L87 Difference]: Start difference. First operand 1618 states and 2035 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:55:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:58,351 INFO L93 Difference]: Finished difference Result 1618 states and 2035 transitions. [2025-03-04 05:55:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:55:58,351 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, (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 106 [2025-03-04 05:55:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:58,359 INFO L225 Difference]: With dead ends: 1618 [2025-03-04 05:55:58,359 INFO L226 Difference]: Without dead ends: 1616 [2025-03-04 05:55:58,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:58,360 INFO L435 NwaCegarLoop]: 1375 mSDtfsCounter, 1338 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:58,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 2749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:55:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-03-04 05:55:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1616. [2025-03-04 05:55:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1075 states have (on average 1.1748837209302325) internal successors, (1263), 1136 states have internal predecessors, (1263), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-04 05:55:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2033 transitions. [2025-03-04 05:55:58,470 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2033 transitions. Word has length 106 [2025-03-04 05:55:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:58,471 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2033 transitions. [2025-03-04 05:55:58,471 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 05:55:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2033 transitions. [2025-03-04 05:55:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 05:55:58,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:58,473 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-04 05:55:58,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:55:58,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:58,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1525927495, now seen corresponding path program 1 times [2025-03-04 05:55:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807256417] [2025-03-04 05:55:58,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:58,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 05:55:58,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 05:55:58,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:58,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:55:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-04 05:55:59,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:55:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807256417] [2025-03-04 05:55:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807256417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:55:59,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:55:59,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:55:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304259804] [2025-03-04 05:55:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:55:59,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:55:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:55:59,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:55:59,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:55:59,218 INFO L87 Difference]: Start difference. First operand 1616 states and 2033 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:55:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:55:59,432 INFO L93 Difference]: Finished difference Result 1796 states and 2231 transitions. [2025-03-04 05:55:59,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:55:59,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-03-04 05:55:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:55:59,442 INFO L225 Difference]: With dead ends: 1796 [2025-03-04 05:55:59,442 INFO L226 Difference]: Without dead ends: 1794 [2025-03-04 05:55:59,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:55:59,445 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 1186 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 4886 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:55:59,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 4886 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:55:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2025-03-04 05:55:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1782. [2025-03-04 05:55:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1192 states have (on average 1.1770134228187918) internal successors, (1403), 1253 states have internal predecessors, (1403), 410 states have call successors, (410), 158 states have call predecessors, (410), 156 states have return successors, (410), 395 states have call predecessors, (410), 408 states have call successors, (410) [2025-03-04 05:55:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2223 transitions. [2025-03-04 05:55:59,579 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2223 transitions. Word has length 118 [2025-03-04 05:55:59,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:55:59,579 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2223 transitions. [2025-03-04 05:55:59,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 05:55:59,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2223 transitions. [2025-03-04 05:55:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 05:55:59,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:55:59,582 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] [2025-03-04 05:55:59,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 05:55:59,582 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:55:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:55:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash -251956025, now seen corresponding path program 1 times [2025-03-04 05:55:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:55:59,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71031444] [2025-03-04 05:55:59,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:55:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:55:59,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 05:55:59,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 05:55:59,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:55:59,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71031444] [2025-03-04 05:56:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71031444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:00,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807756058] [2025-03-04 05:56:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:00,153 INFO L87 Difference]: Start difference. First operand 1782 states and 2223 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:56:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:00,258 INFO L93 Difference]: Finished difference Result 1782 states and 2223 transitions. [2025-03-04 05:56:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:00,259 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, (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 112 [2025-03-04 05:56:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:00,267 INFO L225 Difference]: With dead ends: 1782 [2025-03-04 05:56:00,267 INFO L226 Difference]: Without dead ends: 1780 [2025-03-04 05:56:00,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:00,269 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 1335 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:00,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 2745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-03-04 05:56:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2025-03-04 05:56:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1191 states have (on average 1.1763224181360201) internal successors, (1401), 1251 states have internal predecessors, (1401), 410 states have call successors, (410), 158 states have call predecessors, (410), 156 states have return successors, (410), 395 states have call predecessors, (410), 408 states have call successors, (410) [2025-03-04 05:56:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2221 transitions. [2025-03-04 05:56:00,391 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2221 transitions. Word has length 112 [2025-03-04 05:56:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:00,391 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2221 transitions. [2025-03-04 05:56:00,391 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:56:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2221 transitions. [2025-03-04 05:56:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 05:56:00,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:00,393 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:00,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:56:00,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rcu_read_unlock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:00,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash -969121805, now seen corresponding path program 1 times [2025-03-04 05:56:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792387615] [2025-03-04 05:56:00,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:00,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 05:56:00,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 05:56:00,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:00,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-04 05:56:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:01,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792387615] [2025-03-04 05:56:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792387615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:56:01,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018847489] [2025-03-04 05:56:01,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:01,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:56:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:56:01,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:56:01,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:56:02,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 05:56:02,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 05:56:02,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:02,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:02,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 05:56:02,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:56:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 05:56:02,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:56:02,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018847489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:02,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:56:02,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-04 05:56:02,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528386644] [2025-03-04 05:56:02,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:02,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:56:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:02,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:56:02,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:56:02,380 INFO L87 Difference]: Start difference. First operand 1780 states and 2221 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 05:56:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:02,734 INFO L93 Difference]: Finished difference Result 3393 states and 4203 transitions. [2025-03-04 05:56:02,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:56:02,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 134 [2025-03-04 05:56:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:02,743 INFO L225 Difference]: With dead ends: 3393 [2025-03-04 05:56:02,744 INFO L226 Difference]: Without dead ends: 1788 [2025-03-04 05:56:02,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:56:02,748 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 36 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:02,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 5318 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:56:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2025-03-04 05:56:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1786. [2025-03-04 05:56:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1195 states have (on average 1.1757322175732217) internal successors, (1405), 1255 states have internal predecessors, (1405), 412 states have call successors, (412), 158 states have call predecessors, (412), 156 states have return successors, (412), 397 states have call predecessors, (412), 410 states have call successors, (412) [2025-03-04 05:56:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2229 transitions. [2025-03-04 05:56:02,879 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2229 transitions. Word has length 134 [2025-03-04 05:56:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:02,881 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 2229 transitions. [2025-03-04 05:56:02,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 05:56:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2229 transitions. [2025-03-04 05:56:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 05:56:02,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:02,884 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:02,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 05:56:03,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 05:56:03,088 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:03,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:03,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1611529790, now seen corresponding path program 1 times [2025-03-04 05:56:03,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:03,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752504846] [2025-03-04 05:56:03,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:03,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 05:56:03,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 05:56:03,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:03,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:03,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:03,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752504846] [2025-03-04 05:56:03,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752504846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:03,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:03,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:03,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255796662] [2025-03-04 05:56:03,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:03,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:03,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:03,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:03,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:03,742 INFO L87 Difference]: Start difference. First operand 1786 states and 2229 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:56:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:03,850 INFO L93 Difference]: Finished difference Result 1786 states and 2229 transitions. [2025-03-04 05:56:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:03,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 114 [2025-03-04 05:56:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:03,858 INFO L225 Difference]: With dead ends: 1786 [2025-03-04 05:56:03,858 INFO L226 Difference]: Without dead ends: 1784 [2025-03-04 05:56:03,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:03,859 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1331 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:03,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 2741 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-03-04 05:56:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2025-03-04 05:56:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1194 states have (on average 1.1750418760469012) internal successors, (1403), 1253 states have internal predecessors, (1403), 412 states have call successors, (412), 158 states have call predecessors, (412), 156 states have return successors, (412), 397 states have call predecessors, (412), 410 states have call successors, (412) [2025-03-04 05:56:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2227 transitions. [2025-03-04 05:56:03,959 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2227 transitions. Word has length 114 [2025-03-04 05:56:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:03,959 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2227 transitions. [2025-03-04 05:56:03,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 05:56:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2227 transitions. [2025-03-04 05:56:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 05:56:03,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:03,961 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:03,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 05:56:03,961 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:03,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1361072232, now seen corresponding path program 1 times [2025-03-04 05:56:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:03,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665230775] [2025-03-04 05:56:03,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:04,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 05:56:04,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 05:56:04,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:04,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:04,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:04,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665230775] [2025-03-04 05:56:04,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665230775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:04,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:04,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:04,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309575565] [2025-03-04 05:56:04,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:04,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:04,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:04,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:04,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:04,541 INFO L87 Difference]: Start difference. First operand 1784 states and 2227 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 05:56:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:04,702 INFO L93 Difference]: Finished difference Result 2694 states and 3300 transitions. [2025-03-04 05:56:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 120 [2025-03-04 05:56:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:04,714 INFO L225 Difference]: With dead ends: 2694 [2025-03-04 05:56:04,714 INFO L226 Difference]: Without dead ends: 2692 [2025-03-04 05:56:04,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:04,715 INFO L435 NwaCegarLoop]: 1391 mSDtfsCounter, 1329 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 3664 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:04,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 3664 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2025-03-04 05:56:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2647. [2025-03-04 05:56:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 1799 states have (on average 1.1784324624791551) internal successors, (2120), 1866 states have internal predecessors, (2120), 577 states have call successors, (577), 251 states have call predecessors, (577), 249 states have return successors, (577), 561 states have call predecessors, (577), 575 states have call successors, (577) [2025-03-04 05:56:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3274 transitions. [2025-03-04 05:56:04,867 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3274 transitions. Word has length 120 [2025-03-04 05:56:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:04,867 INFO L471 AbstractCegarLoop]: Abstraction has 2647 states and 3274 transitions. [2025-03-04 05:56:04,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 05:56:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3274 transitions. [2025-03-04 05:56:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 05:56:04,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:04,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:56:04,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:04,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1200389913, now seen corresponding path program 1 times [2025-03-04 05:56:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:04,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167935634] [2025-03-04 05:56:04,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:04,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:05,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 05:56:05,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 05:56:05,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:05,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167935634] [2025-03-04 05:56:05,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167935634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:05,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:05,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:05,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28163790] [2025-03-04 05:56:05,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:05,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:05,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:05,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:05,527 INFO L87 Difference]: Start difference. First operand 2647 states and 3274 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:05,764 INFO L93 Difference]: Finished difference Result 3765 states and 4593 transitions. [2025-03-04 05:56:05,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:05,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 126 [2025-03-04 05:56:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:05,780 INFO L225 Difference]: With dead ends: 3765 [2025-03-04 05:56:05,780 INFO L226 Difference]: Without dead ends: 3763 [2025-03-04 05:56:05,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:05,782 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 847 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:05,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 3927 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:56:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-03-04 05:56:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3622. [2025-03-04 05:56:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 2457 states have (on average 1.1693121693121693) internal successors, (2873), 2546 states have internal predecessors, (2873), 790 states have call successors, (790), 356 states have call predecessors, (790), 353 states have return successors, (790), 764 states have call predecessors, (790), 788 states have call successors, (790) [2025-03-04 05:56:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4453 transitions. [2025-03-04 05:56:05,968 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4453 transitions. Word has length 126 [2025-03-04 05:56:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:05,969 INFO L471 AbstractCegarLoop]: Abstraction has 3622 states and 4453 transitions. [2025-03-04 05:56:05,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4453 transitions. [2025-03-04 05:56:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 05:56:05,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:05,971 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:05,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:56:05,971 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:05,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash 764242988, now seen corresponding path program 1 times [2025-03-04 05:56:05,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738206869] [2025-03-04 05:56:05,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:05,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:06,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 05:56:06,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 05:56:06,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:06,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:56:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738206869] [2025-03-04 05:56:06,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738206869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:06,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:06,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:56:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149823600] [2025-03-04 05:56:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:06,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:56:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:06,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:56:06,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:56:06,442 INFO L87 Difference]: Start difference. First operand 3622 states and 4453 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 05:56:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:06,657 INFO L93 Difference]: Finished difference Result 6381 states and 7824 transitions. [2025-03-04 05:56:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:56:06,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-04 05:56:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:06,676 INFO L225 Difference]: With dead ends: 6381 [2025-03-04 05:56:06,676 INFO L226 Difference]: Without dead ends: 3633 [2025-03-04 05:56:06,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:56:06,682 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 13 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:06,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2737 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2025-03-04 05:56:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3623. [2025-03-04 05:56:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 2458 states have (on average 1.1692432872253864) internal successors, (2874), 2547 states have internal predecessors, (2874), 790 states have call successors, (790), 356 states have call predecessors, (790), 353 states have return successors, (790), 764 states have call predecessors, (790), 788 states have call successors, (790) [2025-03-04 05:56:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4454 transitions. [2025-03-04 05:56:06,855 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4454 transitions. Word has length 141 [2025-03-04 05:56:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:06,856 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 4454 transitions. [2025-03-04 05:56:06,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 05:56:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4454 transitions. [2025-03-04 05:56:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 05:56:06,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:06,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:06,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:56:06,858 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash 615069842, now seen corresponding path program 1 times [2025-03-04 05:56:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:06,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672067674] [2025-03-04 05:56:06,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:07,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 05:56:07,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 05:56:07,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:07,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:07,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:07,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672067674] [2025-03-04 05:56:07,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672067674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:07,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:07,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:07,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898109338] [2025-03-04 05:56:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:07,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:07,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:07,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:07,466 INFO L87 Difference]: Start difference. First operand 3623 states and 4454 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:56:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:07,757 INFO L93 Difference]: Finished difference Result 3623 states and 4454 transitions. [2025-03-04 05:56:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 132 [2025-03-04 05:56:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:07,779 INFO L225 Difference]: With dead ends: 3623 [2025-03-04 05:56:07,782 INFO L226 Difference]: Without dead ends: 3621 [2025-03-04 05:56:07,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:07,786 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 1328 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:07,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 2735 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2025-03-04 05:56:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3621. [2025-03-04 05:56:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2457 states have (on average 1.1684981684981686) internal successors, (2871), 2545 states have internal predecessors, (2871), 790 states have call successors, (790), 356 states have call predecessors, (790), 353 states have return successors, (790), 764 states have call predecessors, (790), 788 states have call successors, (790) [2025-03-04 05:56:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4451 transitions. [2025-03-04 05:56:07,959 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4451 transitions. Word has length 132 [2025-03-04 05:56:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:07,960 INFO L471 AbstractCegarLoop]: Abstraction has 3621 states and 4451 transitions. [2025-03-04 05:56:07,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:56:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4451 transitions. [2025-03-04 05:56:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 05:56:07,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:07,962 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:07,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 05:56:07,963 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:07,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2010365465, now seen corresponding path program 1 times [2025-03-04 05:56:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:07,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947486402] [2025-03-04 05:56:07,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:08,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 05:56:08,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 05:56:08,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:08,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:56:08,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:08,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947486402] [2025-03-04 05:56:08,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947486402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:56:08,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065776519] [2025-03-04 05:56:08,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:08,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:56:08,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:56:08,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:56:08,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 05:56:09,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 05:56:09,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 05:56:09,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:09,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:09,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1736 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 05:56:09,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:56:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:56:09,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:56:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:56:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065776519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 05:56:09,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 05:56:09,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 05:56:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336292178] [2025-03-04 05:56:09,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 05:56:09,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:56:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:09,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:56:09,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:56:09,817 INFO L87 Difference]: Start difference. First operand 3621 states and 4451 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 05:56:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:10,071 INFO L93 Difference]: Finished difference Result 6401 states and 7854 transitions. [2025-03-04 05:56:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:56:10,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-03-04 05:56:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:10,084 INFO L225 Difference]: With dead ends: 6401 [2025-03-04 05:56:10,085 INFO L226 Difference]: Without dead ends: 3654 [2025-03-04 05:56:10,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:56:10,093 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 80 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:10,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 2765 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:56:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2025-03-04 05:56:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2025-03-04 05:56:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 2487 states have (on average 1.1712907117008444) internal successors, (2913), 2578 states have internal predecessors, (2913), 793 states have call successors, (793), 356 states have call predecessors, (793), 353 states have return successors, (793), 767 states have call predecessors, (793), 791 states have call successors, (793) [2025-03-04 05:56:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4499 transitions. [2025-03-04 05:56:10,268 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4499 transitions. Word has length 146 [2025-03-04 05:56:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:10,268 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 4499 transitions. [2025-03-04 05:56:10,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 05:56:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4499 transitions. [2025-03-04 05:56:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 05:56:10,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:10,271 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:10,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 05:56:10,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 05:56:10,473 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_for_read_sectionErr3ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:10,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1614527992, now seen corresponding path program 1 times [2025-03-04 05:56:10,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:10,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068145913] [2025-03-04 05:56:10,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:10,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 05:56:10,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 05:56:10,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:10,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:56:11,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:11,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068145913] [2025-03-04 05:56:11,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068145913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:11,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:11,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:11,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579364846] [2025-03-04 05:56:11,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:11,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:11,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:11,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:11,020 INFO L87 Difference]: Start difference. First operand 3654 states and 4499 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:11,225 INFO L93 Difference]: Finished difference Result 3698 states and 4531 transitions. [2025-03-04 05:56:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:11,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-04 05:56:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:11,236 INFO L225 Difference]: With dead ends: 3698 [2025-03-04 05:56:11,236 INFO L226 Difference]: Without dead ends: 3696 [2025-03-04 05:56:11,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:11,238 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 851 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 3921 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:11,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 3921 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2025-03-04 05:56:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3654. [2025-03-04 05:56:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 2487 states have (on average 1.1700844390832328) internal successors, (2910), 2578 states have internal predecessors, (2910), 793 states have call successors, (793), 356 states have call predecessors, (793), 353 states have return successors, (793), 767 states have call predecessors, (793), 791 states have call successors, (793) [2025-03-04 05:56:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4496 transitions. [2025-03-04 05:56:11,505 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4496 transitions. Word has length 147 [2025-03-04 05:56:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:11,506 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 4496 transitions. [2025-03-04 05:56:11,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4496 transitions. [2025-03-04 05:56:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 05:56:11,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:11,508 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:11,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 05:56:11,509 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1430509017, now seen corresponding path program 1 times [2025-03-04 05:56:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333199756] [2025-03-04 05:56:11,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:11,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 05:56:11,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 05:56:11,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:11,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333199756] [2025-03-04 05:56:12,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333199756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:12,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:12,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:12,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127072919] [2025-03-04 05:56:12,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:12,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:12,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:12,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:12,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:12,112 INFO L87 Difference]: Start difference. First operand 3654 states and 4496 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 05:56:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:12,313 INFO L93 Difference]: Finished difference Result 3987 states and 4848 transitions. [2025-03-04 05:56:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:12,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 138 [2025-03-04 05:56:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:12,326 INFO L225 Difference]: With dead ends: 3987 [2025-03-04 05:56:12,326 INFO L226 Difference]: Without dead ends: 3985 [2025-03-04 05:56:12,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:12,327 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 781 mSDsluCounter, 2859 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 4376 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:12,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 4376 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2025-03-04 05:56:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3858. [2025-03-04 05:56:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 2623 states have (on average 1.161646969119329) internal successors, (3047), 2714 states have internal predecessors, (3047), 833 states have call successors, (833), 384 states have call predecessors, (833), 381 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-03-04 05:56:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 4713 transitions. [2025-03-04 05:56:12,538 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 4713 transitions. Word has length 138 [2025-03-04 05:56:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:12,538 INFO L471 AbstractCegarLoop]: Abstraction has 3858 states and 4713 transitions. [2025-03-04 05:56:12,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 05:56:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 4713 transitions. [2025-03-04 05:56:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 05:56:12,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:12,541 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:12,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 05:56:12,541 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_check_for_read_sectionErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash -934285689, now seen corresponding path program 1 times [2025-03-04 05:56:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942499990] [2025-03-04 05:56:12,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:12,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 05:56:12,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 05:56:12,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:12,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:56:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:13,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942499990] [2025-03-04 05:56:13,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942499990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:13,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301097800] [2025-03-04 05:56:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:13,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:13,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:13,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:13,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:13,155 INFO L87 Difference]: Start difference. First operand 3858 states and 4713 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, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:13,375 INFO L93 Difference]: Finished difference Result 3858 states and 4713 transitions. [2025-03-04 05:56:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:13,375 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, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 150 [2025-03-04 05:56:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:13,385 INFO L225 Difference]: With dead ends: 3858 [2025-03-04 05:56:13,385 INFO L226 Difference]: Without dead ends: 3856 [2025-03-04 05:56:13,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:13,388 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 1332 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:13,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 2731 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2025-03-04 05:56:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3856. [2025-03-04 05:56:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3856 states, 2622 states have (on average 1.1586575133485888) internal successors, (3038), 2712 states have internal predecessors, (3038), 833 states have call successors, (833), 384 states have call predecessors, (833), 381 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-03-04 05:56:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 4704 transitions. [2025-03-04 05:56:13,581 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 4704 transitions. Word has length 150 [2025-03-04 05:56:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:13,581 INFO L471 AbstractCegarLoop]: Abstraction has 3856 states and 4704 transitions. [2025-03-04 05:56:13,582 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, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 4704 transitions. [2025-03-04 05:56:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 05:56:13,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:13,584 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:13,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 05:56:13,584 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_check_for_read_sectionErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1915838320, now seen corresponding path program 1 times [2025-03-04 05:56:13,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:13,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960728127] [2025-03-04 05:56:13,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:13,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:13,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 05:56:13,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 05:56:13,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:13,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-04 05:56:14,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:14,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960728127] [2025-03-04 05:56:14,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960728127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:56:14,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508676180] [2025-03-04 05:56:14,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:14,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:56:14,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:56:14,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:56:14,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 05:56:15,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 05:56:16,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 05:56:16,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:16,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:16,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 05:56:16,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:56:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:56:16,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:56:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508676180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:16,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:56:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 20 [2025-03-04 05:56:16,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936715577] [2025-03-04 05:56:16,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:16,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 05:56:16,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:16,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 05:56:16,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-03-04 05:56:16,856 INFO L87 Difference]: Start difference. First operand 3856 states and 4704 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 05:56:20,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:56:24,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:56:28,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:56:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:32,992 INFO L93 Difference]: Finished difference Result 4816 states and 5848 transitions. [2025-03-04 05:56:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 05:56:32,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2025-03-04 05:56:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:33,007 INFO L225 Difference]: With dead ends: 4816 [2025-03-04 05:56:33,007 INFO L226 Difference]: Without dead ends: 4814 [2025-03-04 05:56:33,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-03-04 05:56:33,009 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 2761 mSDsluCounter, 4122 mSDsCounter, 0 mSdLazyCounter, 2587 mSolverCounterSat, 893 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2875 SdHoareTripleChecker+Valid, 4983 SdHoareTripleChecker+Invalid, 3483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 893 IncrementalHoareTripleChecker+Valid, 2587 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:33,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2875 Valid, 4983 Invalid, 3483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [893 Valid, 2587 Invalid, 3 Unknown, 0 Unchecked, 15.5s Time] [2025-03-04 05:56:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2025-03-04 05:56:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 4580. [2025-03-04 05:56:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4580 states, 3111 states have (on average 1.1626486660237865) internal successors, (3617), 3216 states have internal predecessors, (3617), 1000 states have call successors, (1000), 452 states have call predecessors, (1000), 449 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-03-04 05:56:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4580 states to 4580 states and 5619 transitions. [2025-03-04 05:56:33,273 INFO L78 Accepts]: Start accepts. Automaton has 4580 states and 5619 transitions. Word has length 153 [2025-03-04 05:56:33,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:33,274 INFO L471 AbstractCegarLoop]: Abstraction has 4580 states and 5619 transitions. [2025-03-04 05:56:33,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 05:56:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 5619 transitions. [2025-03-04 05:56:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 05:56:33,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:33,276 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:33,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 05:56:33,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:56:33,476 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:33,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:33,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1688972044, now seen corresponding path program 1 times [2025-03-04 05:56:33,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:33,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278660266] [2025-03-04 05:56:33,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:33,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:33,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 05:56:33,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 05:56:33,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:33,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:33,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:33,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278660266] [2025-03-04 05:56:33,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278660266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:33,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:33,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:33,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575876799] [2025-03-04 05:56:33,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:33,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:33,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:33,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:33,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:33,953 INFO L87 Difference]: Start difference. First operand 4580 states and 5619 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:56:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:34,222 INFO L93 Difference]: Finished difference Result 4580 states and 5619 transitions. [2025-03-04 05:56:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:34,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 144 [2025-03-04 05:56:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:34,238 INFO L225 Difference]: With dead ends: 4580 [2025-03-04 05:56:34,238 INFO L226 Difference]: Without dead ends: 4578 [2025-03-04 05:56:34,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:34,242 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 1322 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 2727 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:34,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 2727 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2025-03-04 05:56:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 4578. [2025-03-04 05:56:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4578 states, 3110 states have (on average 1.162057877813505) internal successors, (3614), 3214 states have internal predecessors, (3614), 1000 states have call successors, (1000), 452 states have call predecessors, (1000), 449 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-03-04 05:56:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4578 states to 4578 states and 5616 transitions. [2025-03-04 05:56:34,502 INFO L78 Accepts]: Start accepts. Automaton has 4578 states and 5616 transitions. Word has length 144 [2025-03-04 05:56:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:34,503 INFO L471 AbstractCegarLoop]: Abstraction has 4578 states and 5616 transitions. [2025-03-04 05:56:34,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 05:56:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4578 states and 5616 transitions. [2025-03-04 05:56:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 05:56:34,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:34,505 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:34,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 05:56:34,505 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_check_for_read_sectionErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:34,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1082042079, now seen corresponding path program 1 times [2025-03-04 05:56:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680967443] [2025-03-04 05:56:34,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:34,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 05:56:34,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 05:56:34,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:34,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:56:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680967443] [2025-03-04 05:56:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680967443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:35,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583229197] [2025-03-04 05:56:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:35,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:35,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:35,028 INFO L87 Difference]: Start difference. First operand 4578 states and 5616 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:35,284 INFO L93 Difference]: Finished difference Result 4578 states and 5616 transitions. [2025-03-04 05:56:35,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:35,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-03-04 05:56:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:35,301 INFO L225 Difference]: With dead ends: 4578 [2025-03-04 05:56:35,301 INFO L226 Difference]: Without dead ends: 4576 [2025-03-04 05:56:35,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:35,304 INFO L435 NwaCegarLoop]: 1362 mSDtfsCounter, 1322 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:35,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 2723 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2025-03-04 05:56:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 4576. [2025-03-04 05:56:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4576 states, 3109 states have (on average 1.1588935348986813) internal successors, (3603), 3212 states have internal predecessors, (3603), 1000 states have call successors, (1000), 452 states have call predecessors, (1000), 449 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-03-04 05:56:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 5605 transitions. [2025-03-04 05:56:35,531 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 5605 transitions. Word has length 156 [2025-03-04 05:56:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:35,531 INFO L471 AbstractCegarLoop]: Abstraction has 4576 states and 5605 transitions. [2025-03-04 05:56:35,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 5605 transitions. [2025-03-04 05:56:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 05:56:35,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:35,534 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:35,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 05:56:35,535 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:35,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:35,535 INFO L85 PathProgramCache]: Analyzing trace with hash -314853310, now seen corresponding path program 1 times [2025-03-04 05:56:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:35,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436858060] [2025-03-04 05:56:35,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:35,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 05:56:35,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 05:56:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:36,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:36,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436858060] [2025-03-04 05:56:36,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436858060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:36,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:36,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:36,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532771289] [2025-03-04 05:56:36,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:36,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:36,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:36,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:36,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:36,098 INFO L87 Difference]: Start difference. First operand 4576 states and 5605 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 05:56:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:36,331 INFO L93 Difference]: Finished difference Result 4576 states and 5605 transitions. [2025-03-04 05:56:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 150 [2025-03-04 05:56:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:36,344 INFO L225 Difference]: With dead ends: 4576 [2025-03-04 05:56:36,344 INFO L226 Difference]: Without dead ends: 4574 [2025-03-04 05:56:36,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:36,346 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 1317 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:36,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2721 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2025-03-04 05:56:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2025-03-04 05:56:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 3108 states have (on average 1.1583011583011582) internal successors, (3600), 3210 states have internal predecessors, (3600), 1000 states have call successors, (1000), 452 states have call predecessors, (1000), 449 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-03-04 05:56:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 5602 transitions. [2025-03-04 05:56:36,605 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 5602 transitions. Word has length 150 [2025-03-04 05:56:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:36,606 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 5602 transitions. [2025-03-04 05:56:36,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 05:56:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 5602 transitions. [2025-03-04 05:56:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 05:56:36,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:36,608 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:36,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 05:56:36,609 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:36,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:36,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1990881812, now seen corresponding path program 2 times [2025-03-04 05:56:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:36,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641797271] [2025-03-04 05:56:36,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 05:56:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:36,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 161 statements into 2 equivalence classes. [2025-03-04 05:56:36,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 161 statements. [2025-03-04 05:56:36,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 05:56:36,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-04 05:56:37,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:37,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641797271] [2025-03-04 05:56:37,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641797271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:37,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:37,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:56:37,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90762486] [2025-03-04 05:56:37,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:37,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:56:37,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:37,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:56:37,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:37,157 INFO L87 Difference]: Start difference. First operand 4574 states and 5602 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:41,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:56:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:41,475 INFO L93 Difference]: Finished difference Result 4600 states and 5623 transitions. [2025-03-04 05:56:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:56:41,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2025-03-04 05:56:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:41,488 INFO L225 Difference]: With dead ends: 4600 [2025-03-04 05:56:41,488 INFO L226 Difference]: Without dead ends: 4598 [2025-03-04 05:56:41,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:56:41,491 INFO L435 NwaCegarLoop]: 1419 mSDtfsCounter, 351 mSDsluCounter, 4021 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 5440 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:41,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 5440 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 05:56:41,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. [2025-03-04 05:56:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 4590. [2025-03-04 05:56:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4590 states, 3120 states have (on average 1.1576923076923078) internal successors, (3612), 3222 states have internal predecessors, (3612), 1000 states have call successors, (1000), 456 states have call predecessors, (1000), 453 states have return successors, (1002), 969 states have call predecessors, (1002), 998 states have call successors, (1002) [2025-03-04 05:56:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 5614 transitions. [2025-03-04 05:56:41,737 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 5614 transitions. Word has length 161 [2025-03-04 05:56:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:41,738 INFO L471 AbstractCegarLoop]: Abstraction has 4590 states and 5614 transitions. [2025-03-04 05:56:41,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 05:56:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 5614 transitions. [2025-03-04 05:56:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 05:56:41,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:41,740 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:41,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 05:56:41,741 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:41,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1645334077, now seen corresponding path program 1 times [2025-03-04 05:56:41,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:41,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078331896] [2025-03-04 05:56:41,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:41,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:42,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 05:56:42,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 05:56:42,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:42,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-04 05:56:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078331896] [2025-03-04 05:56:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078331896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:42,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:42,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:56:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90911232] [2025-03-04 05:56:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:42,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:56:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:42,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:56:42,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:42,543 INFO L87 Difference]: Start difference. First operand 4590 states and 5614 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:56:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:42,912 INFO L93 Difference]: Finished difference Result 4829 states and 5843 transitions. [2025-03-04 05:56:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:56:42,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 165 [2025-03-04 05:56:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:42,925 INFO L225 Difference]: With dead ends: 4829 [2025-03-04 05:56:42,925 INFO L226 Difference]: Without dead ends: 4827 [2025-03-04 05:56:42,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:56:42,927 INFO L435 NwaCegarLoop]: 1392 mSDtfsCounter, 1189 mSDsluCounter, 2974 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 4366 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:42,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 4366 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2025-03-04 05:56:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4823. [2025-03-04 05:56:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 3295 states have (on average 1.1520485584218514) internal successors, (3796), 3396 states have internal predecessors, (3796), 1016 states have call successors, (1016), 499 states have call predecessors, (1016), 496 states have return successors, (1018), 985 states have call predecessors, (1018), 1014 states have call successors, (1018) [2025-03-04 05:56:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 5830 transitions. [2025-03-04 05:56:43,186 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 5830 transitions. Word has length 165 [2025-03-04 05:56:43,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:43,187 INFO L471 AbstractCegarLoop]: Abstraction has 4823 states and 5830 transitions. [2025-03-04 05:56:43,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 05:56:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 5830 transitions. [2025-03-04 05:56:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 05:56:43,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:43,190 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:43,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 05:56:43,190 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:43,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1622014101, now seen corresponding path program 1 times [2025-03-04 05:56:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621835049] [2025-03-04 05:56:43,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:43,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 05:56:43,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 05:56:43,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:43,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 05:56:43,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:43,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621835049] [2025-03-04 05:56:43,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621835049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:56:43,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:56:43,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:56:43,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177222643] [2025-03-04 05:56:43,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:56:43,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:56:43,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:43,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:56:43,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:56:43,770 INFO L87 Difference]: Start difference. First operand 4823 states and 5830 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 05:56:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:56:44,026 INFO L93 Difference]: Finished difference Result 4823 states and 5830 transitions. [2025-03-04 05:56:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:56:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 156 [2025-03-04 05:56:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:56:44,041 INFO L225 Difference]: With dead ends: 4823 [2025-03-04 05:56:44,041 INFO L226 Difference]: Without dead ends: 4821 [2025-03-04 05:56:44,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:56:44,044 INFO L435 NwaCegarLoop]: 1357 mSDtfsCounter, 1312 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:56:44,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 2713 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:56:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4821 states. [2025-03-04 05:56:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4821 to 4821. [2025-03-04 05:56:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4821 states, 3294 states have (on average 1.1514875531268973) internal successors, (3793), 3394 states have internal predecessors, (3793), 1016 states have call successors, (1016), 499 states have call predecessors, (1016), 496 states have return successors, (1018), 985 states have call predecessors, (1018), 1014 states have call successors, (1018) [2025-03-04 05:56:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 5827 transitions. [2025-03-04 05:56:44,313 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 5827 transitions. Word has length 156 [2025-03-04 05:56:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:56:44,313 INFO L471 AbstractCegarLoop]: Abstraction has 4821 states and 5827 transitions. [2025-03-04 05:56:44,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 05:56:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 5827 transitions. [2025-03-04 05:56:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 05:56:44,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:56:44,316 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:56:44,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 05:56:44,316 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting nfnl_log_pernetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-04 05:56:44,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:56:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1925797616, now seen corresponding path program 1 times [2025-03-04 05:56:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:56:44,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453782255] [2025-03-04 05:56:44,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:44,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:56:44,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 05:56:44,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 05:56:44,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:44,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-04 05:56:45,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:56:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453782255] [2025-03-04 05:56:45,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453782255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:56:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326786981] [2025-03-04 05:56:45,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:56:45,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:56:45,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:56:45,088 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:56:45,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 05:56:46,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 05:56:46,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 05:56:46,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:56:46,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:56:46,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1908 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 05:56:46,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:56:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 05:56:46,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 05:56:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-03-04 05:56:47,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326786981] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 05:56:47,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 05:56:47,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2025-03-04 05:56:47,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681040919] [2025-03-04 05:56:47,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 05:56:47,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 05:56:47,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:56:47,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 05:56:47,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-04 05:56:47,261 INFO L87 Difference]: Start difference. First operand 4821 states and 5827 transitions. Second operand has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 13 states have internal predecessors, (141), 10 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (47), 10 states have call predecessors, (47), 10 states have call successors, (47)