./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /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 --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /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 -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.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:01:58,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:01:58,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-13 09:01:58,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:01:58,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:01:58,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:01:58,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:01:58,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:01:58,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:01:58,833 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:01:58,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:01:58,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:01:58,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:01:58,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:01:58,836 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:01:58,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:01:58,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:01:58,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:01:58,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:01:58,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:01:58,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:01:58,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:01:58,839 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:01:58,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:01:58,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:01:58,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:01:58,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:01:58,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:01:58,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:01:58,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:01:58,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:01:58,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:01:58,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:01:58,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:01:58,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:01:58,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:01:58,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:01:58,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:01:58,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:01:58,843 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-13 09:01:59,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:01:59,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:01:59,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:01:59,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:01:59,232 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:01:59,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /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 [2024-10-13 09:02:00,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:02:01,208 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:02:01,209 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 [2024-10-13 09:02:01,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0700bb1de/997c5778fa5a4e44b267804c2b9e7c51/FLAG9b3f1535f [2024-10-13 09:02:01,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0700bb1de/997c5778fa5a4e44b267804c2b9e7c51 [2024-10-13 09:02:01,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:02:01,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:02:01,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:02:01,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:02:01,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:02:01,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:02:01" (1/1) ... [2024-10-13 09:02:01,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c5856a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:01, skipping insertion in model container [2024-10-13 09:02:01,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:02:01" (1/1) ... [2024-10-13 09:02:01,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:02:04,734 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,741 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,741 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,741 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,742 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,742 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,742 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,743 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,743 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,747 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,748 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,752 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,752 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,754 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,754 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,754 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,754 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,755 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,755 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,759 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,760 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,764 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,764 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,764 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,765 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,766 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,766 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,774 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,775 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,775 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,776 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,776 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,776 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,777 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,781 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,782 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,782 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,782 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,783 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,783 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,784 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,784 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,785 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,789 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,789 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,790 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,790 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,790 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,790 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,791 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,791 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,793 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,794 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,794 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,795 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,795 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,799 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,799 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,800 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,800 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,800 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,800 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,801 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,801 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,802 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,802 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,803 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,803 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,807 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,807 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,811 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:04,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:02:04,883 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:02:05,153 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] [2024-10-13 09:02:05,159 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] [2024-10-13 09:02:05,159 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] [2024-10-13 09:02:05,159 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] [2024-10-13 09:02:05,179 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] [2024-10-13 09:02:05,179 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] [2024-10-13 09:02:05,180 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] [2024-10-13 09:02:05,200 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] [2024-10-13 09:02:05,304 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,305 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,305 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,308 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,309 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,309 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,309 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,309 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,310 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,310 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,311 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,311 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,312 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,312 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,312 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,312 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,313 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,313 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,313 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,313 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,314 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,314 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,314 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,314 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,315 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,315 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,315 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,316 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,316 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,316 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,316 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,317 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,317 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,317 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,317 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,318 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,318 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,318 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,318 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,319 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,319 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,319 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,319 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,320 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,320 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,320 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,320 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,322 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,322 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,322 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,322 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,323 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,323 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,323 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,323 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,324 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,324 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,324 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,324 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,326 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,326 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,326 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,326 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,327 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,327 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,327 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,327 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,328 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,328 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,328 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,328 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,329 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,330 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,330 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,330 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,330 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override 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] [2024-10-13 09:02:05,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:02:05,417 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:02:05,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05 WrapperNode [2024-10-13 09:02:05,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:02:05,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:02:05,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:02:05,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:02:05,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,595 INFO L138 Inliner]: procedures = 616, calls = 1464, calls flagged for inlining = 275, calls inlined = 180, statements flattened = 2741 [2024-10-13 09:02:05,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:02:05,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:02:05,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:02:05,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:02:05,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,898 INFO L175 MemorySlicer]: Split 243 memory accesses to 24 slices as follows [14, 6, 102, 4, 30, 1, 7, 1, 8, 12, 10, 3, 1, 2, 4, 4, 1, 3, 2, 1, 1, 4, 18, 4]. 42 percent of accesses are in the largest equivalence class. The 108 initializations are split as follows [14, 6, 18, 4, 30, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 4, 18, 4]. The 35 writes are split as follows [0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-13 09:02:05,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:05,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:02:05,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:02:05,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:02:05,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:02:05,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (1/1) ... [2024-10-13 09:02:06,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:02:06,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:02:06,033 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) [2024-10-13 09:02:06,040 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 [2024-10-13 09:02:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2024-10-13 09:02:06,093 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2024-10-13 09:02:06,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2024-10-13 09:02:06,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2024-10-13 09:02:06,094 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2024-10-13 09:02:06,094 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2024-10-13 09:02:06,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-13 09:02:06,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-13 09:02:06,094 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2024-10-13 09:02:06,094 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2024-10-13 09:02:06,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 09:02:06,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 09:02:06,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-13 09:02:06,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2024-10-13 09:02:06,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-10-13 09:02:06,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2024-10-13 09:02:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2024-10-13 09:02:06,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2024-10-13 09:02:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2024-10-13 09:02:06,095 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2024-10-13 09:02:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2024-10-13 09:02:06,096 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2024-10-13 09:02:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2024-10-13 09:02:06,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2024-10-13 09:02:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2024-10-13 09:02:06,096 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2024-10-13 09:02:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2024-10-13 09:02:06,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2024-10-13 09:02:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2024-10-13 09:02:06,096 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2024-10-13 09:02:06,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2024-10-13 09:02:06,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2024-10-13 09:02:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2024-10-13 09:02:06,097 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2024-10-13 09:02:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-13 09:02:06,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-13 09:02:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2024-10-13 09:02:06,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2024-10-13 09:02:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:02:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2024-10-13 09:02:06,097 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2024-10-13 09:02:06,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2024-10-13 09:02:06,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2024-10-13 09:02:06,099 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2024-10-13 09:02:06,099 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2024-10-13 09:02:06,099 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2024-10-13 09:02:06,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2024-10-13 09:02:06,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2024-10-13 09:02:06,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2024-10-13 09:02:06,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2024-10-13 09:02:06,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2024-10-13 09:02:06,099 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2024-10-13 09:02:06,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2024-10-13 09:02:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-13 09:02:06,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2024-10-13 09:02:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:02:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:02:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:02:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 09:02:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 09:02:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-13 09:02:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-13 09:02:06,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-13 09:02:06,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2024-10-13 09:02:06,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2024-10-13 09:02:06,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2024-10-13 09:02:06,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2024-10-13 09:02:06,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2024-10-13 09:02:06,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2024-10-13 09:02:06,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2024-10-13 09:02:06,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2024-10-13 09:02:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2024-10-13 09:02:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2024-10-13 09:02:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2024-10-13 09:02:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2024-10-13 09:02:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2024-10-13 09:02:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2024-10-13 09:02:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2024-10-13 09:02:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2024-10-13 09:02:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2024-10-13 09:02:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2024-10-13 09:02:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-13 09:02:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2024-10-13 09:02:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2024-10-13 09:02:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-13 09:02:06,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-13 09:02:06,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-13 09:02:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-13 09:02:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2024-10-13 09:02:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2024-10-13 09:02:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2024-10-13 09:02:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2024-10-13 09:02:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2024-10-13 09:02:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2024-10-13 09:02:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2024-10-13 09:02:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2024-10-13 09:02:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:02:06,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:02:06,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2024-10-13 09:02:06,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2024-10-13 09:02:06,107 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2024-10-13 09:02:06,107 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2024-10-13 09:02:06,107 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2024-10-13 09:02:06,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2024-10-13 09:02:06,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-13 09:02:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-13 09:02:06,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-10-13 09:02:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2024-10-13 09:02:06,108 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2024-10-13 09:02:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2024-10-13 09:02:06,108 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2024-10-13 09:02:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2024-10-13 09:02:06,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2024-10-13 09:02:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2024-10-13 09:02:06,108 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2024-10-13 09:02:06,108 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2024-10-13 09:02:06,108 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2024-10-13 09:02:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2024-10-13 09:02:06,109 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2024-10-13 09:02:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2024-10-13 09:02:06,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2024-10-13 09:02:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2024-10-13 09:02:06,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2024-10-13 09:02:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2024-10-13 09:02:06,109 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2024-10-13 09:02:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2024-10-13 09:02:06,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2024-10-13 09:02:06,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-13 09:02:06,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-13 09:02:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2024-10-13 09:02:06,111 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-13 09:02:06,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-13 09:02:06,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-13 09:02:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2024-10-13 09:02:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2024-10-13 09:02:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2024-10-13 09:02:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2024-10-13 09:02:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-13 09:02:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-13 09:02:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2024-10-13 09:02:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2024-10-13 09:02:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2024-10-13 09:02:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2024-10-13 09:02:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2024-10-13 09:02:06,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2024-10-13 09:02:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-13 09:02:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2024-10-13 09:02:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2024-10-13 09:02:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2024-10-13 09:02:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2024-10-13 09:02:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2024-10-13 09:02:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-13 09:02:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-13 09:02:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-13 09:02:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2024-10-13 09:02:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2024-10-13 09:02:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2024-10-13 09:02:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2024-10-13 09:02:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2024-10-13 09:02:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2024-10-13 09:02:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-13 09:02:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-13 09:02:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 09:02:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2024-10-13 09:02:06,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2024-10-13 09:02:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-13 09:02:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2024-10-13 09:02:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-13 09:02:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-13 09:02:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-13 09:02:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2024-10-13 09:02:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2024-10-13 09:02:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2024-10-13 09:02:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2024-10-13 09:02:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2024-10-13 09:02:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2024-10-13 09:02:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2024-10-13 09:02:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2024-10-13 09:02:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-13 09:02:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2024-10-13 09:02:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-13 09:02:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2024-10-13 09:02:06,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2024-10-13 09:02:06,122 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2024-10-13 09:02:06,122 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2024-10-13 09:02:06,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:02:06,647 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:02:06,707 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-13 09:02:08,128 INFO L? ?]: Removed 1564 outVars from TransFormulas that were not future-live. [2024-10-13 09:02:08,128 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:02:08,408 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:02:08,412 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 09:02:08,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:02:08 BoogieIcfgContainer [2024-10-13 09:02:08,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:02:08,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:02:08,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:02:08,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:02:08,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:02:01" (1/3) ... [2024-10-13 09:02:08,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3234cd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:02:08, skipping insertion in model container [2024-10-13 09:02:08,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:02:05" (2/3) ... [2024-10-13 09:02:08,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3234cd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:02:08, skipping insertion in model container [2024-10-13 09:02:08,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:02:08" (3/3) ... [2024-10-13 09:02:08,422 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2024-10-13 09:02:08,447 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:02:08,450 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-10-13 09:02:08,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:02:08,579 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;@ac3650f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:02:08,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-10-13 09:02:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 916 states, 536 states have (on average 1.3488805970149254) internal successors, (723), 589 states have internal predecessors, (723), 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) [2024-10-13 09:02:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 09:02:08,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:08,600 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:08,600 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)] === [2024-10-13 09:02:08,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:08,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1449371498, now seen corresponding path program 1 times [2024-10-13 09:02:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277244032] [2024-10-13 09:02:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277244032] [2024-10-13 09:02:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277244032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:09,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:09,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938524702] [2024-10-13 09:02:09,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:09,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:09,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:09,405 INFO L87 Difference]: Start difference. First operand has 916 states, 536 states have (on average 1.3488805970149254) internal successors, (723), 589 states have internal predecessors, (723), 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 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 09:02:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:12,222 INFO L93 Difference]: Finished difference Result 1809 states and 2545 transitions. [2024-10-13 09:02:12,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:12,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (10), 4 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 51 [2024-10-13 09:02:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:12,249 INFO L225 Difference]: With dead ends: 1809 [2024-10-13 09:02:12,249 INFO L226 Difference]: Without dead ends: 898 [2024-10-13 09:02:12,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:12,263 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 1573 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:12,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 1576 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 09:02:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-13 09:02:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 898. [2024-10-13 09:02:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 527 states have (on average 1.2675521821631879) internal successors, (668), 574 states have internal predecessors, (668), 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) [2024-10-13 09:02:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1182 transitions. [2024-10-13 09:02:12,410 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1182 transitions. Word has length 51 [2024-10-13 09:02:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:12,411 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1182 transitions. [2024-10-13 09:02:12,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 09:02:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1182 transitions. [2024-10-13 09:02:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 09:02:12,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:12,413 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:12,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:02:12,414 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)] === [2024-10-13 09:02:12,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:12,414 INFO L85 PathProgramCache]: Analyzing trace with hash 8981866, now seen corresponding path program 1 times [2024-10-13 09:02:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:12,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348561403] [2024-10-13 09:02:12,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:12,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:12,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348561403] [2024-10-13 09:02:12,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348561403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:12,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:12,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:12,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145092245] [2024-10-13 09:02:12,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:12,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:12,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:12,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:12,678 INFO L87 Difference]: Start difference. First operand 898 states and 1182 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 09:02:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:14,418 INFO L93 Difference]: Finished difference Result 898 states and 1182 transitions. [2024-10-13 09:02:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (11), 4 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 56 [2024-10-13 09:02:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:14,427 INFO L225 Difference]: With dead ends: 898 [2024-10-13 09:02:14,428 INFO L226 Difference]: Without dead ends: 896 [2024-10-13 09:02:14,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:14,429 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1542 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:14,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 1544 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 09:02:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-13 09:02:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2024-10-13 09:02:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 526 states have (on average 1.2661596958174905) internal successors, (666), 572 states have internal predecessors, (666), 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) [2024-10-13 09:02:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1180 transitions. [2024-10-13 09:02:14,514 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1180 transitions. Word has length 56 [2024-10-13 09:02:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:14,518 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1180 transitions. [2024-10-13 09:02:14,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 09:02:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1180 transitions. [2024-10-13 09:02:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 09:02:14,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:14,520 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:14,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:02:14,520 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)] === [2024-10-13 09:02:14,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1833202606, now seen corresponding path program 1 times [2024-10-13 09:02:14,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:14,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515777316] [2024-10-13 09:02:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515777316] [2024-10-13 09:02:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515777316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:14,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:14,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:14,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014496456] [2024-10-13 09:02:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:14,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:14,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:14,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:14,823 INFO L87 Difference]: Start difference. First operand 896 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 09:02:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:17,107 INFO L93 Difference]: Finished difference Result 896 states and 1180 transitions. [2024-10-13 09:02:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:17,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (12), 4 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 61 [2024-10-13 09:02:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:17,114 INFO L225 Difference]: With dead ends: 896 [2024-10-13 09:02:17,114 INFO L226 Difference]: Without dead ends: 894 [2024-10-13 09:02:17,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:17,116 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1536 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:17,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 1544 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 09:02:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-13 09:02:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2024-10-13 09:02:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 525 states have (on average 1.2647619047619048) internal successors, (664), 570 states have internal predecessors, (664), 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) [2024-10-13 09:02:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1178 transitions. [2024-10-13 09:02:17,170 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1178 transitions. Word has length 61 [2024-10-13 09:02:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:17,171 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1178 transitions. [2024-10-13 09:02:17,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 09:02:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1178 transitions. [2024-10-13 09:02:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 09:02:17,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:17,173 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:17,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:02:17,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2024-10-13 09:02:17,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:17,174 INFO L85 PathProgramCache]: Analyzing trace with hash 996372127, now seen corresponding path program 1 times [2024-10-13 09:02:17,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:17,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703998184] [2024-10-13 09:02:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:17,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:17,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703998184] [2024-10-13 09:02:17,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703998184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:17,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:17,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:17,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029781090] [2024-10-13 09:02:17,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:17,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:17,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:17,598 INFO L87 Difference]: Start difference. First operand 894 states and 1178 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 09:02:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:19,737 INFO L93 Difference]: Finished difference Result 894 states and 1178 transitions. [2024-10-13 09:02:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:19,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 4 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 66 [2024-10-13 09:02:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:19,744 INFO L225 Difference]: With dead ends: 894 [2024-10-13 09:02:19,745 INFO L226 Difference]: Without dead ends: 892 [2024-10-13 09:02:19,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:19,746 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1530 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:19,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 1544 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 09:02:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-10-13 09:02:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2024-10-13 09:02:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 524 states have (on average 1.2633587786259541) internal successors, (662), 568 states have internal predecessors, (662), 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) [2024-10-13 09:02:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1176 transitions. [2024-10-13 09:02:19,801 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1176 transitions. Word has length 66 [2024-10-13 09:02:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:19,802 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1176 transitions. [2024-10-13 09:02:19,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 09:02:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1176 transitions. [2024-10-13 09:02:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 09:02:19,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:19,803 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 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] [2024-10-13 09:02:19,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:02:19,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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)] === [2024-10-13 09:02:19,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash -635645305, now seen corresponding path program 1 times [2024-10-13 09:02:19,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:19,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447450817] [2024-10-13 09:02:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:02:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:02:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 09:02:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:02:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:02:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 09:02:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-13 09:02:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447450817] [2024-10-13 09:02:20,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447450817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:20,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:20,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185248094] [2024-10-13 09:02:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:20,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:20,228 INFO L87 Difference]: Start difference. First operand 892 states and 1176 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 09:02:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:22,736 INFO L93 Difference]: Finished difference Result 1529 states and 1980 transitions. [2024-10-13 09:02:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:22,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (13), 3 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 77 [2024-10-13 09:02:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:22,743 INFO L225 Difference]: With dead ends: 1529 [2024-10-13 09:02:22,744 INFO L226 Difference]: Without dead ends: 1527 [2024-10-13 09:02:22,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:02:22,745 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 1127 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:22,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 2595 Invalid, 3496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 09:02:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-10-13 09:02:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1300. [2024-10-13 09:02:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 756 states have (on average 1.2526455026455026) internal successors, (947), 814 states have internal predecessors, (947), 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) [2024-10-13 09:02:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1717 transitions. [2024-10-13 09:02:22,819 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1717 transitions. Word has length 77 [2024-10-13 09:02:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:22,819 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1717 transitions. [2024-10-13 09:02:22,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 09:02:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1717 transitions. [2024-10-13 09:02:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 09:02:22,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:22,821 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:22,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:02:22,821 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)] === [2024-10-13 09:02:22,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:22,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1198657637, now seen corresponding path program 1 times [2024-10-13 09:02:22,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:22,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592905522] [2024-10-13 09:02:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:22,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:02:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592905522] [2024-10-13 09:02:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592905522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:23,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769706472] [2024-10-13 09:02:23,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:23,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:23,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:23,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:23,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:23,038 INFO L87 Difference]: Start difference. First operand 1300 states and 1717 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 09:02:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:25,140 INFO L93 Difference]: Finished difference Result 1300 states and 1717 transitions. [2024-10-13 09:02:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 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 71 [2024-10-13 09:02:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:25,148 INFO L225 Difference]: With dead ends: 1300 [2024-10-13 09:02:25,148 INFO L226 Difference]: Without dead ends: 1298 [2024-10-13 09:02:25,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:25,151 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1524 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:25,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 1544 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 09:02:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2024-10-13 09:02:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2024-10-13 09:02:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 755 states have (on average 1.2516556291390728) internal successors, (945), 812 states have internal predecessors, (945), 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) [2024-10-13 09:02:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1715 transitions. [2024-10-13 09:02:25,250 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1715 transitions. Word has length 71 [2024-10-13 09:02:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:25,251 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1715 transitions. [2024-10-13 09:02:25,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 09:02:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1715 transitions. [2024-10-13 09:02:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 09:02:25,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:25,254 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:25,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:02:25,254 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)] === [2024-10-13 09:02:25,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash -255155898, now seen corresponding path program 1 times [2024-10-13 09:02:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:25,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107090463] [2024-10-13 09:02:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:25,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:02:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:02:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:25,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:25,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107090463] [2024-10-13 09:02:25,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107090463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:25,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:25,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103559768] [2024-10-13 09:02:25,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:25,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:25,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:25,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:25,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:25,580 INFO L87 Difference]: Start difference. First operand 1298 states and 1715 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 09:02:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:27,827 INFO L93 Difference]: Finished difference Result 1298 states and 1715 transitions. [2024-10-13 09:02:27,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:27,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (15), 4 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 76 [2024-10-13 09:02:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:27,835 INFO L225 Difference]: With dead ends: 1298 [2024-10-13 09:02:27,835 INFO L226 Difference]: Without dead ends: 1296 [2024-10-13 09:02:27,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:27,837 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1518 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:27,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 1544 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 09:02:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-10-13 09:02:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2024-10-13 09:02:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 754 states have (on average 1.2506631299734747) internal successors, (943), 810 states have internal predecessors, (943), 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) [2024-10-13 09:02:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1713 transitions. [2024-10-13 09:02:27,966 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1713 transitions. Word has length 76 [2024-10-13 09:02:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:27,968 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1713 transitions. [2024-10-13 09:02:27,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 09:02:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1713 transitions. [2024-10-13 09:02:27,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 09:02:27,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:27,969 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:27,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:02:27,970 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)] === [2024-10-13 09:02:27,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1448992038, now seen corresponding path program 1 times [2024-10-13 09:02:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:27,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841048655] [2024-10-13 09:02:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:02:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:02:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 09:02:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841048655] [2024-10-13 09:02:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841048655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:28,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:28,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728560644] [2024-10-13 09:02:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:28,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:28,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:28,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:28,234 INFO L87 Difference]: Start difference. First operand 1296 states and 1713 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 09:02:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:30,373 INFO L93 Difference]: Finished difference Result 1296 states and 1713 transitions. [2024-10-13 09:02:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:30,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (16), 4 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 81 [2024-10-13 09:02:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:30,387 INFO L225 Difference]: With dead ends: 1296 [2024-10-13 09:02:30,390 INFO L226 Difference]: Without dead ends: 1294 [2024-10-13 09:02:30,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:30,392 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1512 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:30,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 1544 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 09:02:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-10-13 09:02:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2024-10-13 09:02:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 753 states have (on average 1.249667994687915) internal successors, (941), 808 states have internal predecessors, (941), 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) [2024-10-13 09:02:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1711 transitions. [2024-10-13 09:02:30,534 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1711 transitions. Word has length 81 [2024-10-13 09:02:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:30,535 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1711 transitions. [2024-10-13 09:02:30,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 09:02:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1711 transitions. [2024-10-13 09:02:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 09:02:30,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:30,536 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:30,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:02:30,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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)] === [2024-10-13 09:02:30,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1681545230, now seen corresponding path program 1 times [2024-10-13 09:02:30,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:30,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410286156] [2024-10-13 09:02:30,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:30,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:02:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:02:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 09:02:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 09:02:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410286156] [2024-10-13 09:02:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410286156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354157546] [2024-10-13 09:02:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:31,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:31,117 INFO L87 Difference]: Start difference. First operand 1294 states and 1711 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 09:02:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:33,072 INFO L93 Difference]: Finished difference Result 1294 states and 1711 transitions. [2024-10-13 09:02:33,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:33,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (17), 4 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 86 [2024-10-13 09:02:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:33,081 INFO L225 Difference]: With dead ends: 1294 [2024-10-13 09:02:33,081 INFO L226 Difference]: Without dead ends: 1292 [2024-10-13 09:02:33,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:33,084 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1506 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:33,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 1544 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 09:02:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2024-10-13 09:02:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2024-10-13 09:02:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 752 states have (on average 1.2486702127659575) internal successors, (939), 806 states have internal predecessors, (939), 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) [2024-10-13 09:02:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1709 transitions. [2024-10-13 09:02:33,172 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1709 transitions. Word has length 86 [2024-10-13 09:02:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:33,172 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1709 transitions. [2024-10-13 09:02:33,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 09:02:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1709 transitions. [2024-10-13 09:02:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 09:02:33,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:33,174 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 3, 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] [2024-10-13 09:02:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:02:33,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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)] === [2024-10-13 09:02:33,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1548066210, now seen corresponding path program 1 times [2024-10-13 09:02:33,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:33,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036503544] [2024-10-13 09:02:33,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:02:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:02:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 09:02:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 09:02:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 09:02:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 09:02:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-13 09:02:33,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:33,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036503544] [2024-10-13 09:02:33,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036503544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:33,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:02:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675703841] [2024-10-13 09:02:33,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:33,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:02:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:02:33,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:02:33,488 INFO L87 Difference]: Start difference. First operand 1292 states and 1709 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 09:02:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:36,513 INFO L93 Difference]: Finished difference Result 1527 states and 1997 transitions. [2024-10-13 09:02:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:02:36,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 5 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 93 [2024-10-13 09:02:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:36,519 INFO L225 Difference]: With dead ends: 1527 [2024-10-13 09:02:36,519 INFO L226 Difference]: Without dead ends: 1525 [2024-10-13 09:02:36,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-13 09:02:36,520 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1514 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 3261 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 4051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 3261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:36,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 2032 Invalid, 4051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 3261 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 09:02:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2024-10-13 09:02:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1433. [2024-10-13 09:02:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 843 states have (on average 1.2514827995255042) internal successors, (1055), 898 states have internal predecessors, (1055), 410 states have call successors, (410), 158 states have call predecessors, (410), 157 states have return successors, (412), 395 states have call predecessors, (412), 408 states have call successors, (412) [2024-10-13 09:02:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1877 transitions. [2024-10-13 09:02:36,612 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1877 transitions. Word has length 93 [2024-10-13 09:02:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:36,612 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1877 transitions. [2024-10-13 09:02:36,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 09:02:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1877 transitions. [2024-10-13 09:02:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 09:02:36,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:36,613 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:36,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:02:36,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2024-10-13 09:02:36,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:36,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1057117867, now seen corresponding path program 1 times [2024-10-13 09:02:36,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:36,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516306518] [2024-10-13 09:02:36,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:36,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:02:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:02:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 09:02:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 09:02:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516306518] [2024-10-13 09:02:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516306518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567980044] [2024-10-13 09:02:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:36,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:36,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:36,808 INFO L87 Difference]: Start difference. First operand 1433 states and 1877 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 09:02:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:38,952 INFO L93 Difference]: Finished difference Result 1433 states and 1877 transitions. [2024-10-13 09:02:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:38,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (17), 4 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 88 [2024-10-13 09:02:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:38,958 INFO L225 Difference]: With dead ends: 1433 [2024-10-13 09:02:38,958 INFO L226 Difference]: Without dead ends: 1431 [2024-10-13 09:02:38,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:38,959 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1498 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:38,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 1544 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 09:02:38,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-10-13 09:02:39,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2024-10-13 09:02:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 842 states have (on average 1.2505938242280286) internal successors, (1053), 896 states have internal predecessors, (1053), 410 states have call successors, (410), 158 states have call predecessors, (410), 157 states have return successors, (412), 395 states have call predecessors, (412), 408 states have call successors, (412) [2024-10-13 09:02:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1875 transitions. [2024-10-13 09:02:39,052 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1875 transitions. Word has length 88 [2024-10-13 09:02:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:39,053 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1875 transitions. [2024-10-13 09:02:39,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 09:02:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1875 transitions. [2024-10-13 09:02:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 09:02:39,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:39,054 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 5, 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] [2024-10-13 09:02:39,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:02:39,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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)] === [2024-10-13 09:02:39,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:39,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1462592126, now seen corresponding path program 1 times [2024-10-13 09:02:39,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:39,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669430843] [2024-10-13 09:02:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 09:02:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 09:02:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 09:02:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 09:02:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 09:02:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 09:02:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-13 09:02:39,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669430843] [2024-10-13 09:02:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669430843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:02:39,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261150289] [2024-10-13 09:02:39,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:39,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:02:39,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:02:39,341 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) [2024-10-13 09:02:39,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 09:02:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:39,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 09:02:39,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:02:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 09:02:39,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:02:39,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261150289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:39,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:02:39,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-10-13 09:02:39,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680762900] [2024-10-13 09:02:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:39,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:02:39,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:39,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:02:39,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:02:39,823 INFO L87 Difference]: Start difference. First operand 1431 states and 1875 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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) [2024-10-13 09:02:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:40,558 INFO L93 Difference]: Finished difference Result 2728 states and 3544 transitions. [2024-10-13 09:02:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:02:40,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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 103 [2024-10-13 09:02:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:40,566 INFO L225 Difference]: With dead ends: 2728 [2024-10-13 09:02:40,566 INFO L226 Difference]: Without dead ends: 1439 [2024-10-13 09:02:40,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:02:40,576 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 31 mSDsluCounter, 2889 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:40,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3880 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 09:02:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-10-13 09:02:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1437. [2024-10-13 09:02:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 846 states have (on average 1.2494089834515367) internal successors, (1057), 900 states have internal predecessors, (1057), 412 states have call successors, (412), 158 states have call predecessors, (412), 157 states have return successors, (414), 397 states have call predecessors, (414), 410 states have call successors, (414) [2024-10-13 09:02:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1883 transitions. [2024-10-13 09:02:40,681 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1883 transitions. Word has length 103 [2024-10-13 09:02:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:40,681 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1883 transitions. [2024-10-13 09:02:40,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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) [2024-10-13 09:02:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1883 transitions. [2024-10-13 09:02:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 09:02:40,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:40,683 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:40,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 09:02:40,883 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,SelfDestructingSolverStorable11 [2024-10-13 09:02:40,885 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)] === [2024-10-13 09:02:40,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1150653234, now seen corresponding path program 1 times [2024-10-13 09:02:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602317512] [2024-10-13 09:02:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:02:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:02:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 09:02:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 09:02:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 09:02:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:41,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602317512] [2024-10-13 09:02:41,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602317512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:41,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:41,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729278103] [2024-10-13 09:02:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:41,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:41,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:41,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:41,089 INFO L87 Difference]: Start difference. First operand 1437 states and 1883 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 09:02:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:44,284 INFO L93 Difference]: Finished difference Result 2170 states and 2779 transitions. [2024-10-13 09:02:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 09:02:44,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 4 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 93 [2024-10-13 09:02:44,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:44,296 INFO L225 Difference]: With dead ends: 2170 [2024-10-13 09:02:44,296 INFO L226 Difference]: Without dead ends: 2168 [2024-10-13 09:02:44,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:02:44,298 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 2101 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 1204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 3557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1204 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:44,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2269 Valid, 1768 Invalid, 3557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1204 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 09:02:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2024-10-13 09:02:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2123. [2024-10-13 09:02:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 1274 states have (on average 1.2535321821036107) internal successors, (1597), 1335 states have internal predecessors, (1597), 577 states have call successors, (577), 251 states have call predecessors, (577), 250 states have return successors, (579), 561 states have call predecessors, (579), 575 states have call successors, (579) [2024-10-13 09:02:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2753 transitions. [2024-10-13 09:02:44,538 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2753 transitions. Word has length 93 [2024-10-13 09:02:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:44,538 INFO L471 AbstractCegarLoop]: Abstraction has 2123 states and 2753 transitions. [2024-10-13 09:02:44,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 09:02:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2753 transitions. [2024-10-13 09:02:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 09:02:44,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:44,540 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:44,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:02:44,540 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)] === [2024-10-13 09:02:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1861718394, now seen corresponding path program 1 times [2024-10-13 09:02:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384986716] [2024-10-13 09:02:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:02:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:02:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 09:02:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 09:02:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 09:02:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 09:02:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384986716] [2024-10-13 09:02:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384986716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953040589] [2024-10-13 09:02:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:44,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:44,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:44,808 INFO L87 Difference]: Start difference. First operand 2123 states and 2753 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 09:02:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:47,691 INFO L93 Difference]: Finished difference Result 3005 states and 3836 transitions. [2024-10-13 09:02:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 09:02:47,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 4 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 98 [2024-10-13 09:02:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:47,703 INFO L225 Difference]: With dead ends: 3005 [2024-10-13 09:02:47,704 INFO L226 Difference]: Without dead ends: 3003 [2024-10-13 09:02:47,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:02:47,707 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1670 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 1101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1101 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:47,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 1882 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1101 Valid, 2453 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 09:02:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2024-10-13 09:02:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2890. [2024-10-13 09:02:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 1724 states have (on average 1.24245939675174) internal successors, (2142), 1805 states have internal predecessors, (2142), 790 states have call successors, (790), 356 states have call predecessors, (790), 354 states have return successors, (792), 764 states have call predecessors, (792), 788 states have call successors, (792) [2024-10-13 09:02:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3724 transitions. [2024-10-13 09:02:47,942 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3724 transitions. Word has length 98 [2024-10-13 09:02:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:47,943 INFO L471 AbstractCegarLoop]: Abstraction has 2890 states and 3724 transitions. [2024-10-13 09:02:47,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 09:02:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3724 transitions. [2024-10-13 09:02:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 09:02:47,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:47,944 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:47,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:02:47,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2024-10-13 09:02:47,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1127062782, now seen corresponding path program 1 times [2024-10-13 09:02:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:47,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668738447] [2024-10-13 09:02:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:02:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:02:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 09:02:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 09:02:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 09:02:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 09:02:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 09:02:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:48,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:48,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668738447] [2024-10-13 09:02:48,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668738447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:48,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:48,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:48,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086216492] [2024-10-13 09:02:48,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:48,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:48,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:48,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:48,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:48,210 INFO L87 Difference]: Start difference. First operand 2890 states and 3724 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 09:02:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:50,795 INFO L93 Difference]: Finished difference Result 2890 states and 3724 transitions. [2024-10-13 09:02:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:50,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 4 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 103 [2024-10-13 09:02:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:50,811 INFO L225 Difference]: With dead ends: 2890 [2024-10-13 09:02:50,811 INFO L226 Difference]: Without dead ends: 2888 [2024-10-13 09:02:50,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:50,816 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1494 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:50,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 1544 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 09:02:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2024-10-13 09:02:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2888. [2024-10-13 09:02:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 1723 states have (on average 1.2414393499709808) internal successors, (2139), 1803 states have internal predecessors, (2139), 790 states have call successors, (790), 356 states have call predecessors, (790), 354 states have return successors, (792), 764 states have call predecessors, (792), 788 states have call successors, (792) [2024-10-13 09:02:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3721 transitions. [2024-10-13 09:02:51,166 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3721 transitions. Word has length 103 [2024-10-13 09:02:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 3721 transitions. [2024-10-13 09:02:51,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 09:02:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3721 transitions. [2024-10-13 09:02:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 09:02:51,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:51,243 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-13 09:02:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:02:51,244 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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)] === [2024-10-13 09:02:51,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1979569068, now seen corresponding path program 1 times [2024-10-13 09:02:51,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:51,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526151396] [2024-10-13 09:02:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:02:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:02:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 09:02:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 09:02:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 09:02:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 09:02:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 09:02:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 09:02:51,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:51,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526151396] [2024-10-13 09:02:51,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526151396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:51,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:51,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420445287] [2024-10-13 09:02:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:51,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:51,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:51,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:51,526 INFO L87 Difference]: Start difference. First operand 2888 states and 3721 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 09:02:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:54,261 INFO L93 Difference]: Finished difference Result 5305 states and 6834 transitions. [2024-10-13 09:02:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:02:54,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 5 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 112 [2024-10-13 09:02:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:54,278 INFO L225 Difference]: With dead ends: 5305 [2024-10-13 09:02:54,279 INFO L226 Difference]: Without dead ends: 3110 [2024-10-13 09:02:54,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:02:54,285 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 1037 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 1015 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:54,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1780 Invalid, 3158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 09:02:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2024-10-13 09:02:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2889. [2024-10-13 09:02:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 1724 states have (on average 1.2412993039443156) internal successors, (2140), 1804 states have internal predecessors, (2140), 790 states have call successors, (790), 356 states have call predecessors, (790), 354 states have return successors, (792), 764 states have call predecessors, (792), 788 states have call successors, (792) [2024-10-13 09:02:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 3722 transitions. [2024-10-13 09:02:54,791 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 3722 transitions. Word has length 112 [2024-10-13 09:02:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:54,792 INFO L471 AbstractCegarLoop]: Abstraction has 2889 states and 3722 transitions. [2024-10-13 09:02:54,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 09:02:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 3722 transitions. [2024-10-13 09:02:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 09:02:54,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:54,795 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:02:54,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:02:54,796 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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)] === [2024-10-13 09:02:54,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1079846413, now seen corresponding path program 1 times [2024-10-13 09:02:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:54,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544203853] [2024-10-13 09:02:54,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:54,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:54,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:02:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:02:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:02:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:02:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:02:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:02:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:02:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:02:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:02:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:02:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 09:02:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 09:02:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 09:02:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 09:02:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 09:02:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 09:02:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:02:55,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544203853] [2024-10-13 09:02:55,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544203853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:55,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:55,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:02:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813881457] [2024-10-13 09:02:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:55,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:02:55,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:55,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:02:55,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:02:55,127 INFO L87 Difference]: Start difference. First operand 2889 states and 3722 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 09:02:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:02:58,069 INFO L93 Difference]: Finished difference Result 3160 states and 4012 transitions. [2024-10-13 09:02:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:02:58,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (21), 4 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 108 [2024-10-13 09:02:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:02:58,079 INFO L225 Difference]: With dead ends: 3160 [2024-10-13 09:02:58,079 INFO L226 Difference]: Without dead ends: 3158 [2024-10-13 09:02:58,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:02:58,080 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1428 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 1033 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 3789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1033 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:02:58,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 1963 Invalid, 3789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1033 Valid, 2756 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 09:02:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2024-10-13 09:02:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 3045. [2024-10-13 09:02:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 1812 states have (on average 1.2301324503311257) internal successors, (2229), 1892 states have internal predecessors, (2229), 830 states have call successors, (830), 384 states have call predecessors, (830), 382 states have return successors, (832), 804 states have call predecessors, (832), 828 states have call successors, (832) [2024-10-13 09:02:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 3891 transitions. [2024-10-13 09:02:58,325 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 3891 transitions. Word has length 108 [2024-10-13 09:02:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:02:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 3045 states and 3891 transitions. [2024-10-13 09:02:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 09:02:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 3891 transitions. [2024-10-13 09:02:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 09:02:58,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:02:58,329 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-13 09:02:58,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:02:58,330 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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)] === [2024-10-13 09:02:58,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:02:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1425887978, now seen corresponding path program 1 times [2024-10-13 09:02:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:02:58,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66369211] [2024-10-13 09:02:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:02:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:02:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:02:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:02:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 09:02:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:02:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:02:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 09:02:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 09:02:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 09:02:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:02:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 09:02:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:02:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:02:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:02:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:02:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 09:02:58,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:02:58,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66369211] [2024-10-13 09:02:58,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66369211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:02:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:02:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:02:58,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960445674] [2024-10-13 09:02:58,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:02:58,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:02:58,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:02:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:02:58,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:02:58,681 INFO L87 Difference]: Start difference. First operand 3045 states and 3891 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 09:03:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:03:02,215 INFO L93 Difference]: Finished difference Result 3302 states and 4217 transitions. [2024-10-13 09:03:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 09:03:02,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 5 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 116 [2024-10-13 09:03:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:03:02,225 INFO L225 Difference]: With dead ends: 3302 [2024-10-13 09:03:02,225 INFO L226 Difference]: Without dead ends: 3300 [2024-10-13 09:03:02,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-10-13 09:03:02,226 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 2277 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 1675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 4480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1675 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:03:02,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 2126 Invalid, 4480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1675 Valid, 2805 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 09:03:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2024-10-13 09:03:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 3045. [2024-10-13 09:03:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 1812 states have (on average 1.228476821192053) internal successors, (2226), 1892 states have internal predecessors, (2226), 830 states have call successors, (830), 384 states have call predecessors, (830), 382 states have return successors, (832), 804 states have call predecessors, (832), 828 states have call successors, (832) [2024-10-13 09:03:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 3888 transitions. [2024-10-13 09:03:02,465 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 3888 transitions. Word has length 116 [2024-10-13 09:03:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:03:02,466 INFO L471 AbstractCegarLoop]: Abstraction has 3045 states and 3888 transitions. [2024-10-13 09:03:02,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 09:03:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 3888 transitions. [2024-10-13 09:03:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 09:03:02,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:03:02,467 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-13 09:03:02,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:03:02,468 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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)] === [2024-10-13 09:03:02,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:03:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1114850539, now seen corresponding path program 1 times [2024-10-13 09:03:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:03:02,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047028677] [2024-10-13 09:03:02,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:03:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:03:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:03:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:03:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:03:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:03:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 09:03:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:03:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:03:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 09:03:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 09:03:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 09:03:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:03:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 09:03:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 09:03:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:03:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047028677] [2024-10-13 09:03:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047028677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:03:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149902317] [2024-10-13 09:03:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:03:02,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:03:02,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:03:02,712 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) [2024-10-13 09:03:02,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 09:03:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:03,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 09:03:03,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:03:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 09:03:03,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:03:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 09:03:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149902317] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:03:03,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:03:03,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-13 09:03:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267327329] [2024-10-13 09:03:03,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:03:03,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:03:03,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:03:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:03:03,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:03:03,446 INFO L87 Difference]: Start difference. First operand 3045 states and 3888 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 09:03:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:03:06,562 INFO L93 Difference]: Finished difference Result 5481 states and 7032 transitions. [2024-10-13 09:03:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:03:06,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-10-13 09:03:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:03:06,580 INFO L225 Difference]: With dead ends: 5481 [2024-10-13 09:03:06,580 INFO L226 Difference]: Without dead ends: 3285 [2024-10-13 09:03:06,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-13 09:03:06,586 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 1080 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 1025 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1025 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:03:06,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 2229 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1025 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 09:03:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2024-10-13 09:03:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 3072. [2024-10-13 09:03:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 1836 states have (on average 1.2320261437908497) internal successors, (2262), 1919 states have internal predecessors, (2262), 833 states have call successors, (833), 384 states have call predecessors, (833), 382 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-13 09:03:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 3930 transitions. [2024-10-13 09:03:06,832 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 3930 transitions. Word has length 116 [2024-10-13 09:03:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:03:06,832 INFO L471 AbstractCegarLoop]: Abstraction has 3072 states and 3930 transitions. [2024-10-13 09:03:06,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 09:03:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 3930 transitions. [2024-10-13 09:03:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 09:03:06,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:03:06,834 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-13 09:03:06,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 09:03:07,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:03:07,035 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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)] === [2024-10-13 09:03:07,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:03:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash -181458179, now seen corresponding path program 1 times [2024-10-13 09:03:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:03:07,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702922325] [2024-10-13 09:03:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:03:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:03:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:03:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:03:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:03:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:03:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 09:03:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:03:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:03:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 09:03:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 09:03:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 09:03:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:03:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 09:03:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 09:03:07,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:03:07,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702922325] [2024-10-13 09:03:07,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702922325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:03:07,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:03:07,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:03:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848922989] [2024-10-13 09:03:07,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:03:07,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:03:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:03:07,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:03:07,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:03:07,301 INFO L87 Difference]: Start difference. First operand 3072 states and 3930 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 09:03:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:03:09,643 INFO L93 Difference]: Finished difference Result 3285 states and 4227 transitions. [2024-10-13 09:03:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 09:03:09,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 5 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 118 [2024-10-13 09:03:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:03:09,656 INFO L225 Difference]: With dead ends: 3285 [2024-10-13 09:03:09,657 INFO L226 Difference]: Without dead ends: 3283 [2024-10-13 09:03:09,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-13 09:03:09,658 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1860 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 1175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2043 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1175 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:03:09,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2043 Valid, 1788 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1175 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 09:03:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2024-10-13 09:03:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3070. [2024-10-13 09:03:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 1835 states have (on average 1.2277929155313352) internal successors, (2253), 1917 states have internal predecessors, (2253), 833 states have call successors, (833), 384 states have call predecessors, (833), 382 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-13 09:03:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3921 transitions. [2024-10-13 09:03:09,974 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3921 transitions. Word has length 118 [2024-10-13 09:03:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:03:09,975 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3921 transitions. [2024-10-13 09:03:09,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 09:03:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3921 transitions. [2024-10-13 09:03:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 09:03:09,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:03:09,976 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-10-13 09:03:09,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:03:09,977 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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)] === [2024-10-13 09:03:09,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:03:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2007273750, now seen corresponding path program 1 times [2024-10-13 09:03:09,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:03:09,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387863349] [2024-10-13 09:03:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:03:09,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:03:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 09:03:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 09:03:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 09:03:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 09:03:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 09:03:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 09:03:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 09:03:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 09:03:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 09:03:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 09:03:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 09:03:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 09:03:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 09:03:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 09:03:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 09:03:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 09:03:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 09:03:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 09:03:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:03:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387863349] [2024-10-13 09:03:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387863349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:03:10,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:03:10,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:03:10,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902852599] [2024-10-13 09:03:10,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:03:10,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:03:10,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:03:10,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:03:10,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:03:10,206 INFO L87 Difference]: Start difference. First operand 3070 states and 3921 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 09:03:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:03:12,486 INFO L93 Difference]: Finished difference Result 3070 states and 3921 transitions. [2024-10-13 09:03:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:03:12,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (22), 4 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 113 [2024-10-13 09:03:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:03:12,496 INFO L225 Difference]: With dead ends: 3070 [2024-10-13 09:03:12,496 INFO L226 Difference]: Without dead ends: 3068 [2024-10-13 09:03:12,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:03:12,497 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 1482 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 802 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 802 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 09:03:12,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 1544 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [802 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 09:03:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2024-10-13 09:03:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2024-10-13 09:03:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 1834 states have (on average 1.2268266085059978) internal successors, (2250), 1915 states have internal predecessors, (2250), 833 states have call successors, (833), 384 states have call predecessors, (833), 382 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-13 09:03:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 3918 transitions. [2024-10-13 09:03:12,808 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 3918 transitions. Word has length 113 [2024-10-13 09:03:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:03:12,809 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 3918 transitions. [2024-10-13 09:03:12,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 09:03:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 3918 transitions. [2024-10-13 09:03:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 09:03:12,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:03:12,810 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-13 09:03:12,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:03:12,811 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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)] === [2024-10-13 09:03:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:03:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1714656341, now seen corresponding path program 1 times [2024-10-13 09:03:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:03:12,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544886236] [2024-10-13 09:03:12,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:03:12,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:03:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:03:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:03:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:03:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:03:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 09:03:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:03:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:03:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 09:03:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 09:03:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 09:03:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:03:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 09:03:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 09:03:13,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:03:13,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544886236] [2024-10-13 09:03:13,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544886236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:03:13,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:03:13,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:03:13,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301411399] [2024-10-13 09:03:13,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:03:13,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:03:13,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:03:13,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:03:13,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:03:13,300 INFO L87 Difference]: Start difference. First operand 3068 states and 3918 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 09:03:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:03:16,519 INFO L93 Difference]: Finished difference Result 5508 states and 7061 transitions. [2024-10-13 09:03:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 09:03:16,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 5 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 120 [2024-10-13 09:03:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:03:16,532 INFO L225 Difference]: With dead ends: 5508 [2024-10-13 09:03:16,533 INFO L226 Difference]: Without dead ends: 3289 [2024-10-13 09:03:16,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:03:16,539 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 1014 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 1012 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 3883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:03:16,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 2204 Invalid, 3883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 09:03:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2024-10-13 09:03:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3076. [2024-10-13 09:03:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 1842 states have (on average 1.225841476655809) internal successors, (2258), 1923 states have internal predecessors, (2258), 833 states have call successors, (833), 384 states have call predecessors, (833), 382 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-13 09:03:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 3926 transitions. [2024-10-13 09:03:16,837 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 3926 transitions. Word has length 120 [2024-10-13 09:03:16,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:03:16,838 INFO L471 AbstractCegarLoop]: Abstraction has 3076 states and 3926 transitions. [2024-10-13 09:03:16,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 09:03:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 3926 transitions. [2024-10-13 09:03:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 09:03:16,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:03:16,840 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-13 09:03:16,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 09:03:16,841 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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)] === [2024-10-13 09:03:16,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:03:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1569193705, now seen corresponding path program 1 times [2024-10-13 09:03:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:03:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401264417] [2024-10-13 09:03:16,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:03:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:03:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-13 09:03:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:03:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:03:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 09:03:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 09:03:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 09:03:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-13 09:03:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 09:03:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 09:03:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 09:03:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 09:03:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 09:03:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 09:03:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-13 09:03:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 09:03:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-13 09:03:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:03:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401264417] [2024-10-13 09:03:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401264417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:03:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520196066] [2024-10-13 09:03:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:03:17,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:03:17,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:03:17,934 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) [2024-10-13 09:03:17,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 09:03:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:03:18,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 09:03:18,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:03:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 09:03:18,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:03:18,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520196066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:03:18,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:03:18,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2024-10-13 09:03:18,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644975284] [2024-10-13 09:03:18,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:03:18,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:03:18,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:03:18,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:03:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-13 09:03:18,719 INFO L87 Difference]: Start difference. First operand 3076 states and 3926 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-10-13 09:03:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:03:21,077 INFO L93 Difference]: Finished difference Result 3092 states and 3934 transitions. [2024-10-13 09:03:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:03:21,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 120 [2024-10-13 09:03:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:03:21,096 INFO L225 Difference]: With dead ends: 3092 [2024-10-13 09:03:21,099 INFO L226 Difference]: Without dead ends: 3090 [2024-10-13 09:03:21,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-10-13 09:03:21,109 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 1081 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:03:21,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 1520 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 09:03:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2024-10-13 09:03:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 3090. [2024-10-13 09:03:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 1849 states have (on average 1.2206598161168198) internal successors, (2257), 1929 states have internal predecessors, (2257), 833 states have call successors, (833), 392 states have call predecessors, (833), 390 states have return successors, (835), 807 states have call predecessors, (835), 831 states have call successors, (835) [2024-10-13 09:03:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 3925 transitions. [2024-10-13 09:03:21,821 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 3925 transitions. Word has length 120 [2024-10-13 09:03:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:03:21,821 INFO L471 AbstractCegarLoop]: Abstraction has 3090 states and 3925 transitions. [2024-10-13 09:03:21,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-10-13 09:03:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 3925 transitions. [2024-10-13 09:03:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 09:03:21,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:03:21,823 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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] [2024-10-13 09:03:21,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0