./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.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 838cbce098703eae9745d1ba54cc8860e1e4bdea5f00e637be7216785f1ba452 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:06:35,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:06:35,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 21:06:35,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:06:35,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:06:35,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:06:35,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:06:35,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:06:35,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:06:35,844 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:06:35,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:06:35,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:06:35,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:06:35,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:06:35,845 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:06:35,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:06:35,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:06:35,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:06:35,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:06:35,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:06:35,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:06:35,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:06:35,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:06:35,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:06:35,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:06:35,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:06:35,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:06:35,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:06:35,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:06:35,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:06:35,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:06:35,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:06:35,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:06:35,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:06:35,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:06:35,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:06:35,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:06:35,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:06:35,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:06:35,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:06:35,849 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 838cbce098703eae9745d1ba54cc8860e1e4bdea5f00e637be7216785f1ba452 [2025-03-08 21:06:36,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:06:36,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:06:36,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:06:36,083 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:06:36,083 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:06:36,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2025-03-08 21:06:37,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20451c20/aea1c0449cf54e889a215922d44ef839/FLAG222fa29a8 [2025-03-08 21:06:37,757 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:06:37,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2025-03-08 21:06:37,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20451c20/aea1c0449cf54e889a215922d44ef839/FLAG222fa29a8 [2025-03-08 21:06:38,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20451c20/aea1c0449cf54e889a215922d44ef839 [2025-03-08 21:06:38,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:06:38,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:06:38,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:06:38,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:06:38,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:06:38,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:06:38" (1/1) ... [2025-03-08 21:06:38,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:38, skipping insertion in model container [2025-03-08 21:06:38,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:06:38" (1/1) ... [2025-03-08 21:06:38,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:06:39,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259112,259125] [2025-03-08 21:06:39,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259257,259270] [2025-03-08 21:06:39,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259403,259416] [2025-03-08 21:06:39,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259568,259581] [2025-03-08 21:06:39,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259726,259739] [2025-03-08 21:06:39,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259884,259897] [2025-03-08 21:06:39,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260042,260055] [2025-03-08 21:06:39,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260202,260215] [2025-03-08 21:06:39,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260361,260374] [2025-03-08 21:06:39,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260500,260513] [2025-03-08 21:06:39,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260642,260655] [2025-03-08 21:06:39,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260791,260804] [2025-03-08 21:06:39,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260930,260943] [2025-03-08 21:06:39,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261085,261098] [2025-03-08 21:06:39,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261245,261258] [2025-03-08 21:06:39,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261396,261409] [2025-03-08 21:06:39,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261547,261560] [2025-03-08 21:06:39,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261699,261712] [2025-03-08 21:06:39,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261848,261861] [2025-03-08 21:06:39,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261996,262009] [2025-03-08 21:06:39,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262153,262166] [2025-03-08 21:06:39,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262302,262315] [2025-03-08 21:06:39,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262458,262471] [2025-03-08 21:06:39,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262611,262624] [2025-03-08 21:06:39,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262757,262770] [2025-03-08 21:06:39,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262900,262913] [2025-03-08 21:06:40,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263052,263065] [2025-03-08 21:06:40,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263198,263211] [2025-03-08 21:06:40,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263343,263356] [2025-03-08 21:06:40,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263497,263510] [2025-03-08 21:06:40,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263648,263661] [2025-03-08 21:06:40,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263803,263816] [2025-03-08 21:06:40,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263955,263968] [2025-03-08 21:06:40,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264110,264123] [2025-03-08 21:06:40,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264274,264287] [2025-03-08 21:06:40,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264430,264443] [2025-03-08 21:06:40,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264594,264607] [2025-03-08 21:06:40,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264736,264749] [2025-03-08 21:06:40,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264894,264907] [2025-03-08 21:06:40,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265061,265074] [2025-03-08 21:06:40,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265220,265233] [2025-03-08 21:06:40,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265379,265392] [2025-03-08 21:06:40,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265528,265541] [2025-03-08 21:06:40,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265675,265688] [2025-03-08 21:06:40,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265814,265827] [2025-03-08 21:06:40,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265977,265990] [2025-03-08 21:06:40,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266143,266156] [2025-03-08 21:06:40,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266307,266320] [2025-03-08 21:06:40,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266472,266485] [2025-03-08 21:06:40,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266637,266650] [2025-03-08 21:06:40,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266803,266816] [2025-03-08 21:06:40,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266968,266981] [2025-03-08 21:06:40,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267135,267148] [2025-03-08 21:06:40,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267295,267308] [2025-03-08 21:06:40,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267457,267470] [2025-03-08 21:06:40,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267616,267629] [2025-03-08 21:06:40,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267762,267775] [2025-03-08 21:06:40,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267905,267918] [2025-03-08 21:06:40,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268049,268062] [2025-03-08 21:06:40,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268192,268205] [2025-03-08 21:06:40,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268336,268349] [2025-03-08 21:06:40,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268477,268490] [2025-03-08 21:06:40,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268615,268628] [2025-03-08 21:06:40,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268773,268786] [2025-03-08 21:06:40,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268932,268945] [2025-03-08 21:06:40,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269088,269101] [2025-03-08 21:06:40,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269237,269250] [2025-03-08 21:06:40,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269389,269402] [2025-03-08 21:06:40,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269540,269553] [2025-03-08 21:06:40,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269689,269702] [2025-03-08 21:06:40,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269841,269854] [2025-03-08 21:06:40,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269989,270002] [2025-03-08 21:06:40,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270142,270155] [2025-03-08 21:06:40,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270293,270306] [2025-03-08 21:06:40,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270443,270456] [2025-03-08 21:06:40,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270590,270603] [2025-03-08 21:06:40,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270741,270754] [2025-03-08 21:06:40,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270892,270905] [2025-03-08 21:06:40,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271040,271053] [2025-03-08 21:06:40,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271206,271219] [2025-03-08 21:06:40,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271375,271388] [2025-03-08 21:06:40,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271542,271555] [2025-03-08 21:06:40,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271710,271723] [2025-03-08 21:06:40,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271860,271873] [2025-03-08 21:06:40,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272007,272020] [2025-03-08 21:06:40,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272168,272181] [2025-03-08 21:06:40,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272338,272351] [2025-03-08 21:06:40,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272500,272513] [2025-03-08 21:06:40,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:06:40,042 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:06:40,102 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4155] [2025-03-08 21:06:40,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4158] [2025-03-08 21:06:40,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4161] [2025-03-08 21:06:40,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4164] [2025-03-08 21:06:40,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259112,259125] [2025-03-08 21:06:40,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259257,259270] [2025-03-08 21:06:40,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259403,259416] [2025-03-08 21:06:40,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259568,259581] [2025-03-08 21:06:40,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259726,259739] [2025-03-08 21:06:40,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[259884,259897] [2025-03-08 21:06:40,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260042,260055] [2025-03-08 21:06:40,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260202,260215] [2025-03-08 21:06:40,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260361,260374] [2025-03-08 21:06:40,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260500,260513] [2025-03-08 21:06:40,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260642,260655] [2025-03-08 21:06:40,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260791,260804] [2025-03-08 21:06:40,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[260930,260943] [2025-03-08 21:06:40,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261085,261098] [2025-03-08 21:06:40,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261245,261258] [2025-03-08 21:06:40,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261396,261409] [2025-03-08 21:06:40,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261547,261560] [2025-03-08 21:06:40,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261699,261712] [2025-03-08 21:06:40,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261848,261861] [2025-03-08 21:06:40,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[261996,262009] [2025-03-08 21:06:40,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262153,262166] [2025-03-08 21:06:40,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262302,262315] [2025-03-08 21:06:40,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262458,262471] [2025-03-08 21:06:40,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262611,262624] [2025-03-08 21:06:40,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262757,262770] [2025-03-08 21:06:40,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[262900,262913] [2025-03-08 21:06:40,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263052,263065] [2025-03-08 21:06:40,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263198,263211] [2025-03-08 21:06:40,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263343,263356] [2025-03-08 21:06:40,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263497,263510] [2025-03-08 21:06:40,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263648,263661] [2025-03-08 21:06:40,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263803,263816] [2025-03-08 21:06:40,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[263955,263968] [2025-03-08 21:06:40,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264110,264123] [2025-03-08 21:06:40,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264274,264287] [2025-03-08 21:06:40,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264430,264443] [2025-03-08 21:06:40,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264594,264607] [2025-03-08 21:06:40,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264736,264749] [2025-03-08 21:06:40,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[264894,264907] [2025-03-08 21:06:40,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265061,265074] [2025-03-08 21:06:40,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265220,265233] [2025-03-08 21:06:40,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265379,265392] [2025-03-08 21:06:40,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265528,265541] [2025-03-08 21:06:40,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265675,265688] [2025-03-08 21:06:40,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265814,265827] [2025-03-08 21:06:40,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[265977,265990] [2025-03-08 21:06:40,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266143,266156] [2025-03-08 21:06:40,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266307,266320] [2025-03-08 21:06:40,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266472,266485] [2025-03-08 21:06:40,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266637,266650] [2025-03-08 21:06:40,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266803,266816] [2025-03-08 21:06:40,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[266968,266981] [2025-03-08 21:06:40,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267135,267148] [2025-03-08 21:06:40,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267295,267308] [2025-03-08 21:06:40,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267457,267470] [2025-03-08 21:06:40,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267616,267629] [2025-03-08 21:06:40,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267762,267775] [2025-03-08 21:06:40,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[267905,267918] [2025-03-08 21:06:40,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268049,268062] [2025-03-08 21:06:40,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268192,268205] [2025-03-08 21:06:40,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268336,268349] [2025-03-08 21:06:40,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268477,268490] [2025-03-08 21:06:40,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268615,268628] [2025-03-08 21:06:40,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268773,268786] [2025-03-08 21:06:40,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[268932,268945] [2025-03-08 21:06:40,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269088,269101] [2025-03-08 21:06:40,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269237,269250] [2025-03-08 21:06:40,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269389,269402] [2025-03-08 21:06:40,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269540,269553] [2025-03-08 21:06:40,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269689,269702] [2025-03-08 21:06:40,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269841,269854] [2025-03-08 21:06:40,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[269989,270002] [2025-03-08 21:06:40,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270142,270155] [2025-03-08 21:06:40,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270293,270306] [2025-03-08 21:06:40,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270443,270456] [2025-03-08 21:06:40,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270590,270603] [2025-03-08 21:06:40,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270741,270754] [2025-03-08 21:06:40,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[270892,270905] [2025-03-08 21:06:40,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271040,271053] [2025-03-08 21:06:40,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271206,271219] [2025-03-08 21:06:40,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271375,271388] [2025-03-08 21:06:40,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271542,271555] [2025-03-08 21:06:40,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271710,271723] [2025-03-08 21:06:40,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[271860,271873] [2025-03-08 21:06:40,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272007,272020] [2025-03-08 21:06:40,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272168,272181] [2025-03-08 21:06:40,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272338,272351] [2025-03-08 21:06:40,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i[272500,272513] [2025-03-08 21:06:40,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:06:40,372 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:06:40,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40 WrapperNode [2025-03-08 21:06:40,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:06:40,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:06:40,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:06:40,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:06:40,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:40,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:40,550 INFO L138 Inliner]: procedures = 509, calls = 1274, calls flagged for inlining = 230, calls inlined = 156, statements flattened = 2802 [2025-03-08 21:06:40,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:06:40,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:06:40,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:06:40,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:06:40,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:40,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:40,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:40,930 INFO L175 MemorySlicer]: Split 421 memory accesses to 12 slices as follows [4, 4, 19, 35, 34, 3, 39, 1, 6, 1, 2, 273]. 65 percent of accesses are in the largest equivalence class. The 91 initializations are split as follows [4, 4, 0, 0, 34, 0, 8, 0, 6, 1, 2, 32]. The 174 writes are split as follows [0, 0, 1, 30, 0, 0, 31, 1, 0, 0, 0, 111]. [2025-03-08 21:06:40,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:40,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:40,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:40,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:41,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:41,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:41,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:06:41,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:06:41,033 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:06:41,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:06:41,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (1/1) ... [2025-03-08 21:06:41,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:06:41,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:06:41,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:06:41,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:06:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-08 21:06:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-08 21:06:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 21:06:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 21:06:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 21:06:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 21:06:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-08 21:06:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-08 21:06:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2025-03-08 21:06:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2025-03-08 21:06:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2025-03-08 21:06:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_usb_yurex [2025-03-08 21:06:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 21:06:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 21:06:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-08 21:06:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-08 21:06:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-08 21:06:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 21:06:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 21:06:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 21:06:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_io_mutex_of_usb_yurex [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-03-08 21:06:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 21:06:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 21:06:41,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 21:06:41,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-08 21:06:41,100 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-08 21:06:41,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-08 21:06:41,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-08 21:06:41,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-08 21:06:41,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2025-03-08 21:06:41,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_101 [2025-03-08 21:06:41,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_101 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 21:06:41,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-08 21:06:41,101 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-08 21:06:41,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_io_mutex_of_usb_yurex [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-08 21:06:41,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:06:41,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 21:06:41,104 INFO L130 BoogieDeclarations]: Found specification of procedure yurex_disconnect [2025-03-08 21:06:41,104 INFO L138 BoogieDeclarations]: Found implementation of procedure yurex_disconnect [2025-03-08 21:06:41,588 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:06:41,591 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:06:41,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4422: havoc dev_get_drvdata_#t~mem73#1.base, dev_get_drvdata_#t~mem73#1.offset; [2025-03-08 21:06:41,761 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 21:06:41,838 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4546: havoc #t~mem107;havoc #t~bitwise108; [2025-03-08 21:06:42,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6113: havoc ldv_usb_submit_urb_102_#t~nondet354#1; [2025-03-08 21:06:42,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4581: call ULTIMATE.dealloc(yurex_delete_~#descriptor~0#1.base, yurex_delete_~#descriptor~0#1.offset);havoc yurex_delete_~#descriptor~0#1.base, yurex_delete_~#descriptor~0#1.offset; [2025-03-08 21:06:42,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4651: call ULTIMATE.dealloc(yurex_interrupt_~#descriptor~1#1.base, yurex_interrupt_~#descriptor~1#1.offset);havoc yurex_interrupt_~#descriptor~1#1.base, yurex_interrupt_~#descriptor~1#1.offset;call ULTIMATE.dealloc(yurex_interrupt_~#descriptor___0~0#1.base, yurex_interrupt_~#descriptor___0~0#1.offset);havoc yurex_interrupt_~#descriptor___0~0#1.base, yurex_interrupt_~#descriptor___0~0#1.offset;call ULTIMATE.dealloc(yurex_interrupt_~#descriptor___1~0#1.base, yurex_interrupt_~#descriptor___1~0#1.offset);havoc yurex_interrupt_~#descriptor___1~0#1.base, yurex_interrupt_~#descriptor___1~0#1.offset; [2025-03-08 21:06:42,220 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10800: havoc #t~nondet531; [2025-03-08 21:06:42,309 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10796: havoc #t~nondet530; [2025-03-08 21:06:47,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10870: havoc usb_register_driver_#t~nondet539#1; [2025-03-08 21:06:47,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4827: call ULTIMATE.dealloc(yurex_probe_~#wait~0#1.base, yurex_probe_~#wait~0#1.offset);havoc yurex_probe_~#wait~0#1.base, yurex_probe_~#wait~0#1.offset;call ULTIMATE.dealloc(yurex_probe_~#__key~0#1.base, yurex_probe_~#__key~0#1.offset);havoc yurex_probe_~#__key~0#1.base, yurex_probe_~#__key~0#1.offset;call ULTIMATE.dealloc(yurex_probe_~#__key___0~0#1.base, yurex_probe_~#__key___0~0#1.offset);havoc yurex_probe_~#__key___0~0#1.base, yurex_probe_~#__key___0~0#1.offset;call ULTIMATE.dealloc(yurex_probe_~#__key___1~0#1.base, yurex_probe_~#__key___1~0#1.offset);havoc yurex_probe_~#__key___1~0#1.base, yurex_probe_~#__key___1~0#1.offset; [2025-03-08 21:06:47,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10842: havoc printk_#t~nondet534#1; [2025-03-08 21:06:47,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10810: havoc default_llseek_#t~nondet532#1; [2025-03-08 21:06:47,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4437: havoc iminor_#t~mem78#1; [2025-03-08 21:06:47,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10846: havoc schedule_timeout_#t~nondet535#1; [2025-03-08 21:06:47,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10850: havoc simple_strtoull_#t~nondet536#1; [2025-03-08 21:06:47,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10817: havoc fasync_helper_#t~nondet533#1; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6656: havoc ldv_linux_usb_dev_atomic_add_return_#t~mem387#1; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5108: call ULTIMATE.dealloc(yurex_read_~#in_buffer~0#1.base, yurex_read_~#in_buffer~0#1.offset);havoc yurex_read_~#in_buffer~0#1.base, yurex_read_~#in_buffer~0#1.offset; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4318: havoc usb_endpoint_dir_in_#t~mem55#1; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10859: havoc usb_find_interface_#t~ret537#1.base, usb_find_interface_#t~ret537#1.offset; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6202: havoc ldv_usb_submit_urb_108_#t~nondet364#1; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6336-1: ldv_usb_register_driver_123_#res#1 := ldv_usb_register_driver_123_~ldv_func_res~0#1; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4324: havoc usb_endpoint_xfer_int_#t~mem56#1; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10866: havoc usb_register_dev_#t~nondet538#1; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5881-1: ldv_usb_register_driver_#res#1 := ldv_usb_register_driver_~arg0#1; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6311: havoc ldv_usb_submit_urb_121_#t~nondet365#1; [2025-03-08 21:06:47,187 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5155: call ULTIMATE.dealloc(yurex_write_~#buffer~0#1.base, yurex_write_~#buffer~0#1.offset);havoc yurex_write_~#buffer~0#1.base, yurex_write_~#buffer~0#1.offset;call ULTIMATE.dealloc(yurex_write_~#wait~1#1.base, yurex_write_~#wait~1#1.offset);havoc yurex_write_~#wait~1#1.base, yurex_write_~#wait~1#1.offset;call ULTIMATE.dealloc(yurex_write_~#descriptor~2#1.base, yurex_write_~#descriptor~2#1.offset);havoc yurex_write_~#descriptor~2#1.base, yurex_write_~#descriptor~2#1.offset; [2025-03-08 21:06:47,497 INFO L? ?]: Removed 1377 outVars from TransFormulas that were not future-live. [2025-03-08 21:06:47,497 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:06:47,530 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:06:47,531 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:06:47,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:06:47 BoogieIcfgContainer [2025-03-08 21:06:47,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:06:47,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:06:47,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:06:47,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:06:47,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:06:38" (1/3) ... [2025-03-08 21:06:47,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf78a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:06:47, skipping insertion in model container [2025-03-08 21:06:47,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:06:40" (2/3) ... [2025-03-08 21:06:47,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf78a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:06:47, skipping insertion in model container [2025-03-08 21:06:47,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:06:47" (3/3) ... [2025-03-08 21:06:47,540 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i [2025-03-08 21:06:47,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:06:47,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--misc--yurex.ko.cil.i that has 72 procedures, 1031 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-03-08 21:06:47,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:06:47,624 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;@76b3bedf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:06:47,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-08 21:06:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 1030 states, 681 states have (on average 1.28928046989721) internal successors, (878), 739 states have internal predecessors, (878), 245 states have call successors, (245), 71 states have call predecessors, (245), 70 states have return successors, (240), 229 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 21:06:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 21:06:47,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:47,637 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:47,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:47,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash -644186177, now seen corresponding path program 1 times [2025-03-08 21:06:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:47,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707159653] [2025-03-08 21:06:47,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:47,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:48,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 21:06:48,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 21:06:48,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:48,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707159653] [2025-03-08 21:06:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707159653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:48,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:48,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060012184] [2025-03-08 21:06:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:48,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:48,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:48,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:48,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:48,991 INFO L87 Difference]: Start difference. First operand has 1030 states, 681 states have (on average 1.28928046989721) internal successors, (878), 739 states have internal predecessors, (878), 245 states have call successors, (245), 71 states have call predecessors, (245), 70 states have return successors, (240), 229 states have call predecessors, (240), 240 states have call successors, (240) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 21:06:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:49,220 INFO L93 Difference]: Finished difference Result 2010 states and 2746 transitions. [2025-03-08 21:06:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:49,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2025-03-08 21:06:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:49,243 INFO L225 Difference]: With dead ends: 2010 [2025-03-08 21:06:49,245 INFO L226 Difference]: Without dead ends: 1010 [2025-03-08 21:06:49,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:49,257 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 1284 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:49,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 2617 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-08 21:06:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2025-03-08 21:06:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 669 states have (on average 1.2257100149476832) internal successors, (820), 722 states have internal predecessors, (820), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1298 transitions. [2025-03-08 21:06:49,390 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1298 transitions. Word has length 71 [2025-03-08 21:06:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:49,391 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1298 transitions. [2025-03-08 21:06:49,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 21:06:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1298 transitions. [2025-03-08 21:06:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 21:06:49,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:49,398 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:49,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:06:49,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:49,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1372657177, now seen corresponding path program 1 times [2025-03-08 21:06:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:49,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038709186] [2025-03-08 21:06:49,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:49,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 21:06:49,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 21:06:49,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:49,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:50,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:50,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038709186] [2025-03-08 21:06:50,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038709186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:50,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:50,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741354271] [2025-03-08 21:06:50,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:50,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:50,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:50,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:50,224 INFO L87 Difference]: Start difference. First operand 1010 states and 1298 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 21:06:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:50,328 INFO L93 Difference]: Finished difference Result 1010 states and 1298 transitions. [2025-03-08 21:06:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:50,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2025-03-08 21:06:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:50,336 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 21:06:50,339 INFO L226 Difference]: Without dead ends: 1008 [2025-03-08 21:06:50,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:50,341 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 1263 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:50,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 2577 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-03-08 21:06:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2025-03-08 21:06:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 668 states have (on average 1.2245508982035929) internal successors, (818), 720 states have internal predecessors, (818), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1296 transitions. [2025-03-08 21:06:50,398 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1296 transitions. Word has length 77 [2025-03-08 21:06:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:50,399 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1296 transitions. [2025-03-08 21:06:50,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 21:06:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1296 transitions. [2025-03-08 21:06:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 21:06:50,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:50,401 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:50,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:06:50,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:50,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1292678762, now seen corresponding path program 1 times [2025-03-08 21:06:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:50,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302500295] [2025-03-08 21:06:50,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:50,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:50,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 21:06:50,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:06:50,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:50,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:51,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:51,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302500295] [2025-03-08 21:06:51,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302500295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:51,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:51,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:51,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104486411] [2025-03-08 21:06:51,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:51,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:51,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:51,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:51,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:51,085 INFO L87 Difference]: Start difference. First operand 1008 states and 1296 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:06:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:51,194 INFO L93 Difference]: Finished difference Result 1008 states and 1296 transitions. [2025-03-08 21:06:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-03-08 21:06:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:51,202 INFO L225 Difference]: With dead ends: 1008 [2025-03-08 21:06:51,203 INFO L226 Difference]: Without dead ends: 1006 [2025-03-08 21:06:51,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:51,205 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 1260 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:51,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 2573 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-08 21:06:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2025-03-08 21:06:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 667 states have (on average 1.2233883058470765) internal successors, (816), 718 states have internal predecessors, (816), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1294 transitions. [2025-03-08 21:06:51,283 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1294 transitions. Word has length 83 [2025-03-08 21:06:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:51,284 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1294 transitions. [2025-03-08 21:06:51,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:06:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1294 transitions. [2025-03-08 21:06:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 21:06:51,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:51,288 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:51,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:06:51,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1433261734, now seen corresponding path program 1 times [2025-03-08 21:06:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:51,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441137334] [2025-03-08 21:06:51,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:51,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 21:06:51,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 21:06:51,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:51,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:51,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441137334] [2025-03-08 21:06:51,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441137334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:51,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:51,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304213708] [2025-03-08 21:06:51,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:51,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:51,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:51,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:51,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:51,933 INFO L87 Difference]: Start difference. First operand 1006 states and 1294 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 21:06:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:52,010 INFO L93 Difference]: Finished difference Result 1006 states and 1294 transitions. [2025-03-08 21:06:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:52,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2025-03-08 21:06:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:52,016 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 21:06:52,016 INFO L226 Difference]: Without dead ends: 1004 [2025-03-08 21:06:52,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:52,017 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 1257 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:52,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2569 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-03-08 21:06:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2025-03-08 21:06:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 666 states have (on average 1.2222222222222223) internal successors, (814), 716 states have internal predecessors, (814), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1292 transitions. [2025-03-08 21:06:52,068 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1292 transitions. Word has length 89 [2025-03-08 21:06:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:52,068 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1292 transitions. [2025-03-08 21:06:52,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 21:06:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1292 transitions. [2025-03-08 21:06:52,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 21:06:52,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:52,070 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:52,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:06:52,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:52,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2056878019, now seen corresponding path program 1 times [2025-03-08 21:06:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:52,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858408178] [2025-03-08 21:06:52,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:52,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:52,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 21:06:52,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 21:06:52,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:52,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:52,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858408178] [2025-03-08 21:06:52,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858408178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:52,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:52,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213618338] [2025-03-08 21:06:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:52,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:52,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:52,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:52,730 INFO L87 Difference]: Start difference. First operand 1004 states and 1292 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 21:06:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:52,817 INFO L93 Difference]: Finished difference Result 1004 states and 1292 transitions. [2025-03-08 21:06:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:52,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-03-08 21:06:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:52,825 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 21:06:52,825 INFO L226 Difference]: Without dead ends: 1002 [2025-03-08 21:06:52,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:52,827 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 1254 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:52,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 2565 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-08 21:06:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2025-03-08 21:06:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 665 states have (on average 1.2210526315789474) internal successors, (812), 714 states have internal predecessors, (812), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1290 transitions. [2025-03-08 21:06:52,881 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1290 transitions. Word has length 95 [2025-03-08 21:06:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:52,881 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1290 transitions. [2025-03-08 21:06:52,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 21:06:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1290 transitions. [2025-03-08 21:06:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 21:06:52,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:52,885 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:52,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:06:52,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:52,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1272297222, now seen corresponding path program 1 times [2025-03-08 21:06:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:52,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067066816] [2025-03-08 21:06:52,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:52,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:53,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 21:06:53,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 21:06:53,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:53,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:53,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:53,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067066816] [2025-03-08 21:06:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067066816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:53,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:53,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063275512] [2025-03-08 21:06:53,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:53,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:53,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:53,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:53,567 INFO L87 Difference]: Start difference. First operand 1002 states and 1290 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 21:06:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:53,665 INFO L93 Difference]: Finished difference Result 1002 states and 1290 transitions. [2025-03-08 21:06:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:53,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-03-08 21:06:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:53,671 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 21:06:53,671 INFO L226 Difference]: Without dead ends: 1000 [2025-03-08 21:06:53,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:53,672 INFO L435 NwaCegarLoop]: 1281 mSDtfsCounter, 1251 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:53,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 2561 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-03-08 21:06:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2025-03-08 21:06:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 664 states have (on average 1.2198795180722892) internal successors, (810), 712 states have internal predecessors, (810), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1288 transitions. [2025-03-08 21:06:53,740 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1288 transitions. Word has length 101 [2025-03-08 21:06:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:53,741 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1288 transitions. [2025-03-08 21:06:53,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 21:06:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1288 transitions. [2025-03-08 21:06:53,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 21:06:53,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:53,742 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:53,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:06:53,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:53,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1801653087, now seen corresponding path program 1 times [2025-03-08 21:06:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:53,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476889659] [2025-03-08 21:06:53,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:54,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 21:06:54,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 21:06:54,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:54,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:54,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:54,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476889659] [2025-03-08 21:06:54,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476889659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:54,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:54,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:54,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504061896] [2025-03-08 21:06:54,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:54,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:54,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:54,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:54,371 INFO L87 Difference]: Start difference. First operand 1000 states and 1288 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:06:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:54,442 INFO L93 Difference]: Finished difference Result 1000 states and 1288 transitions. [2025-03-08 21:06:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:54,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-03-08 21:06:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:54,448 INFO L225 Difference]: With dead ends: 1000 [2025-03-08 21:06:54,449 INFO L226 Difference]: Without dead ends: 998 [2025-03-08 21:06:54,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:54,450 INFO L435 NwaCegarLoop]: 1279 mSDtfsCounter, 1248 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:54,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 2557 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-08 21:06:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2025-03-08 21:06:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 663 states have (on average 1.2187028657616892) internal successors, (808), 710 states have internal predecessors, (808), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1286 transitions. [2025-03-08 21:06:54,498 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1286 transitions. Word has length 107 [2025-03-08 21:06:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:54,499 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1286 transitions. [2025-03-08 21:06:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:06:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1286 transitions. [2025-03-08 21:06:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 21:06:54,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:54,500 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:54,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:06:54,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:54,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1585738438, now seen corresponding path program 1 times [2025-03-08 21:06:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:54,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538317534] [2025-03-08 21:06:54,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:54,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 21:06:54,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 21:06:54,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:54,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:55,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:55,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538317534] [2025-03-08 21:06:55,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538317534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:55,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:55,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:55,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832739538] [2025-03-08 21:06:55,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:55,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:55,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:55,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:55,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:55,049 INFO L87 Difference]: Start difference. First operand 998 states and 1286 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:06:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:55,132 INFO L93 Difference]: Finished difference Result 998 states and 1286 transitions. [2025-03-08 21:06:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:55,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2025-03-08 21:06:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:55,138 INFO L225 Difference]: With dead ends: 998 [2025-03-08 21:06:55,138 INFO L226 Difference]: Without dead ends: 996 [2025-03-08 21:06:55,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:55,141 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 1245 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:55,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2553 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-08 21:06:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2025-03-08 21:06:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 662 states have (on average 1.2175226586102719) internal successors, (806), 708 states have internal predecessors, (806), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1284 transitions. [2025-03-08 21:06:55,193 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1284 transitions. Word has length 113 [2025-03-08 21:06:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:55,193 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1284 transitions. [2025-03-08 21:06:55,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:06:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1284 transitions. [2025-03-08 21:06:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 21:06:55,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:55,199 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:55,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:06:55,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:55,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash 818783605, now seen corresponding path program 1 times [2025-03-08 21:06:55,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:55,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653093160] [2025-03-08 21:06:55,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:55,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:55,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 21:06:55,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 21:06:55,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:55,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:55,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653093160] [2025-03-08 21:06:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653093160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:55,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:55,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:55,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896961835] [2025-03-08 21:06:55,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:55,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:55,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:55,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:55,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:55,743 INFO L87 Difference]: Start difference. First operand 996 states and 1284 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:06:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:55,818 INFO L93 Difference]: Finished difference Result 996 states and 1284 transitions. [2025-03-08 21:06:55,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:55,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2025-03-08 21:06:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:55,823 INFO L225 Difference]: With dead ends: 996 [2025-03-08 21:06:55,823 INFO L226 Difference]: Without dead ends: 994 [2025-03-08 21:06:55,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:55,824 INFO L435 NwaCegarLoop]: 1275 mSDtfsCounter, 1241 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 2549 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:55,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 2549 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-08 21:06:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2025-03-08 21:06:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 661 states have (on average 1.2163388804841149) internal successors, (804), 706 states have internal predecessors, (804), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1282 transitions. [2025-03-08 21:06:55,873 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1282 transitions. Word has length 115 [2025-03-08 21:06:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:55,873 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1282 transitions. [2025-03-08 21:06:55,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:06:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1282 transitions. [2025-03-08 21:06:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 21:06:55,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:55,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:55,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:06:55,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:55,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1883907414, now seen corresponding path program 1 times [2025-03-08 21:06:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:55,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964905987] [2025-03-08 21:06:55,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:55,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:56,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 21:06:56,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 21:06:56,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:56,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:56,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:56,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964905987] [2025-03-08 21:06:56,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964905987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:56,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:56,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284615455] [2025-03-08 21:06:56,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:56,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:56,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:56,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:56,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:56,374 INFO L87 Difference]: Start difference. First operand 994 states and 1282 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:06:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:56,508 INFO L93 Difference]: Finished difference Result 994 states and 1282 transitions. [2025-03-08 21:06:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:56,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2025-03-08 21:06:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:56,516 INFO L225 Difference]: With dead ends: 994 [2025-03-08 21:06:56,516 INFO L226 Difference]: Without dead ends: 992 [2025-03-08 21:06:56,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:56,517 INFO L435 NwaCegarLoop]: 1273 mSDtfsCounter, 1240 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:56,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 2545 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-03-08 21:06:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2025-03-08 21:06:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 660 states have (on average 1.215151515151515) internal successors, (802), 704 states have internal predecessors, (802), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1280 transitions. [2025-03-08 21:06:56,611 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1280 transitions. Word has length 121 [2025-03-08 21:06:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:56,612 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1280 transitions. [2025-03-08 21:06:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:06:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1280 transitions. [2025-03-08 21:06:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 21:06:56,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:56,615 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:56,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:06:56,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:56,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1419189676, now seen corresponding path program 1 times [2025-03-08 21:06:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:56,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649914875] [2025-03-08 21:06:56,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:57,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 21:06:57,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 21:06:57,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:57,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:06:57,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:57,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649914875] [2025-03-08 21:06:57,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649914875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:57,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:57,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:06:57,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874743409] [2025-03-08 21:06:57,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:57,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:06:57,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:57,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:06:57,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:06:57,243 INFO L87 Difference]: Start difference. First operand 992 states and 1280 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:06:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:06:57,320 INFO L93 Difference]: Finished difference Result 992 states and 1280 transitions. [2025-03-08 21:06:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:06:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2025-03-08 21:06:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:06:57,328 INFO L225 Difference]: With dead ends: 992 [2025-03-08 21:06:57,328 INFO L226 Difference]: Without dead ends: 990 [2025-03-08 21:06:57,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:06:57,330 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 1237 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:06:57,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 2541 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:06:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-08 21:06:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2025-03-08 21:06:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 659 states have (on average 1.2139605462822458) internal successors, (800), 702 states have internal predecessors, (800), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:06:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1278 transitions. [2025-03-08 21:06:57,386 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1278 transitions. Word has length 127 [2025-03-08 21:06:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:06:57,386 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1278 transitions. [2025-03-08 21:06:57,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:06:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1278 transitions. [2025-03-08 21:06:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 21:06:57,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:06:57,389 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:06:57,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:06:57,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:06:57,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:06:57,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1199244474, now seen corresponding path program 1 times [2025-03-08 21:06:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:06:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117925700] [2025-03-08 21:06:57,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:06:57,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:06:57,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 21:06:57,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 21:06:57,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:06:57,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:06:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 21:06:58,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:06:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117925700] [2025-03-08 21:06:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117925700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:06:58,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:06:58,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:06:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272393225] [2025-03-08 21:06:58,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:06:58,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:06:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:06:58,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:06:58,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:06:58,728 INFO L87 Difference]: Start difference. First operand 990 states and 1278 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:07:02,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:07:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:04,016 INFO L93 Difference]: Finished difference Result 1940 states and 2513 transitions. [2025-03-08 21:07:04,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:07:04,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2025-03-08 21:07:04,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:04,023 INFO L225 Difference]: With dead ends: 1940 [2025-03-08 21:07:04,023 INFO L226 Difference]: Without dead ends: 990 [2025-03-08 21:07:04,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:07:04,028 INFO L435 NwaCegarLoop]: 1269 mSDtfsCounter, 1237 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 4594 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:04,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 4594 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 21:07:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-08 21:07:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2025-03-08 21:07:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 659 states have (on average 1.212443095599393) internal successors, (799), 702 states have internal predecessors, (799), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:07:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1277 transitions. [2025-03-08 21:07:04,182 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1277 transitions. Word has length 171 [2025-03-08 21:07:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:04,182 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1277 transitions. [2025-03-08 21:07:04,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:07:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1277 transitions. [2025-03-08 21:07:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 21:07:04,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:04,185 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:04,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:07:04,186 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:04,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:04,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1199214683, now seen corresponding path program 1 times [2025-03-08 21:07:04,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:04,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117280506] [2025-03-08 21:07:04,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:04,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:04,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 21:07:04,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 21:07:04,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:04,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 21:07:04,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:04,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117280506] [2025-03-08 21:07:04,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117280506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:04,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:04,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:04,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960391651] [2025-03-08 21:07:04,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:04,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:04,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:04,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:04,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:04,982 INFO L87 Difference]: Start difference. First operand 990 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 21:07:05,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:05,062 INFO L93 Difference]: Finished difference Result 990 states and 1277 transitions. [2025-03-08 21:07:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:05,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 171 [2025-03-08 21:07:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:05,067 INFO L225 Difference]: With dead ends: 990 [2025-03-08 21:07:05,067 INFO L226 Difference]: Without dead ends: 988 [2025-03-08 21:07:05,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:05,069 INFO L435 NwaCegarLoop]: 1268 mSDtfsCounter, 0 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3801 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:05,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3801 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-03-08 21:07:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2025-03-08 21:07:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 658 states have (on average 1.2112462006079028) internal successors, (797), 700 states have internal predecessors, (797), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:07:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1275 transitions. [2025-03-08 21:07:05,158 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1275 transitions. Word has length 171 [2025-03-08 21:07:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:05,159 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1275 transitions. [2025-03-08 21:07:05,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 21:07:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1275 transitions. [2025-03-08 21:07:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 21:07:05,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:05,161 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:05,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:07:05,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:05,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1730770647, now seen corresponding path program 1 times [2025-03-08 21:07:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562265687] [2025-03-08 21:07:05,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:05,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 21:07:05,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 21:07:05,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:05,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:05,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:05,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562265687] [2025-03-08 21:07:05,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562265687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:05,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:05,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139795303] [2025-03-08 21:07:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:05,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:05,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:05,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:05,847 INFO L87 Difference]: Start difference. First operand 988 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 21:07:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:05,922 INFO L93 Difference]: Finished difference Result 988 states and 1275 transitions. [2025-03-08 21:07:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:05,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2025-03-08 21:07:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:05,927 INFO L225 Difference]: With dead ends: 988 [2025-03-08 21:07:05,928 INFO L226 Difference]: Without dead ends: 986 [2025-03-08 21:07:05,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:05,928 INFO L435 NwaCegarLoop]: 1266 mSDtfsCounter, 1231 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:05,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 2531 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-03-08 21:07:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2025-03-08 21:07:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 657 states have (on average 1.2100456621004567) internal successors, (795), 698 states have internal predecessors, (795), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:07:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1273 transitions. [2025-03-08 21:07:05,980 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1273 transitions. Word has length 133 [2025-03-08 21:07:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:05,980 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1273 transitions. [2025-03-08 21:07:05,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 21:07:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1273 transitions. [2025-03-08 21:07:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 21:07:05,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:05,983 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:05,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:07:05,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:05,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -428729687, now seen corresponding path program 1 times [2025-03-08 21:07:05,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:05,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901300121] [2025-03-08 21:07:05,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:06,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 21:07:06,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 21:07:06,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:06,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 21:07:06,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:06,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901300121] [2025-03-08 21:07:06,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901300121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:06,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:06,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:07:06,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735970332] [2025-03-08 21:07:06,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:06,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:07:06,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:06,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:07:06,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:07:06,487 INFO L87 Difference]: Start difference. First operand 986 states and 1273 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:07:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:06,561 INFO L93 Difference]: Finished difference Result 1928 states and 2499 transitions. [2025-03-08 21:07:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:07:06,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 178 [2025-03-08 21:07:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:06,568 INFO L225 Difference]: With dead ends: 1928 [2025-03-08 21:07:06,569 INFO L226 Difference]: Without dead ends: 982 [2025-03-08 21:07:06,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:07:06,573 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 1228 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:06,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1262 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-03-08 21:07:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2025-03-08 21:07:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 654 states have (on average 1.2079510703363914) internal successors, (790), 694 states have internal predecessors, (790), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:07:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1268 transitions. [2025-03-08 21:07:06,634 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1268 transitions. Word has length 178 [2025-03-08 21:07:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:06,635 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1268 transitions. [2025-03-08 21:07:06,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:07:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1268 transitions. [2025-03-08 21:07:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 21:07:06,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:06,638 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:06,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:07:06,638 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:06,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:06,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1275703202, now seen corresponding path program 1 times [2025-03-08 21:07:06,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:06,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311910882] [2025-03-08 21:07:06,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:06,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:06,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 21:07:06,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 21:07:06,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:06,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:07,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:07,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311910882] [2025-03-08 21:07:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311910882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:07,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:07,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:07,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842493457] [2025-03-08 21:07:07,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:07,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:07,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:07,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:07,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:07,126 INFO L87 Difference]: Start difference. First operand 982 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 21:07:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:07,204 INFO L93 Difference]: Finished difference Result 982 states and 1268 transitions. [2025-03-08 21:07:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:07,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-03-08 21:07:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:07,210 INFO L225 Difference]: With dead ends: 982 [2025-03-08 21:07:07,210 INFO L226 Difference]: Without dead ends: 980 [2025-03-08 21:07:07,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:07,212 INFO L435 NwaCegarLoop]: 1259 mSDtfsCounter, 1223 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:07,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 2517 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-03-08 21:07:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2025-03-08 21:07:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 653 states have (on average 1.206738131699847) internal successors, (788), 692 states have internal predecessors, (788), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:07:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1266 transitions. [2025-03-08 21:07:07,284 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1266 transitions. Word has length 139 [2025-03-08 21:07:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:07,285 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1266 transitions. [2025-03-08 21:07:07,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 21:07:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1266 transitions. [2025-03-08 21:07:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 21:07:07,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:07,286 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:07,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:07:07,286 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:07,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1723321166, now seen corresponding path program 1 times [2025-03-08 21:07:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:07,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349777334] [2025-03-08 21:07:07,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:07,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 21:07:07,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 21:07:07,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:07,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:07,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:07,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349777334] [2025-03-08 21:07:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349777334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:07,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:07,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137868833] [2025-03-08 21:07:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:07,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:07,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:07,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:07,981 INFO L87 Difference]: Start difference. First operand 980 states and 1266 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 21:07:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:08,067 INFO L93 Difference]: Finished difference Result 980 states and 1266 transitions. [2025-03-08 21:07:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:08,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-03-08 21:07:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:08,072 INFO L225 Difference]: With dead ends: 980 [2025-03-08 21:07:08,073 INFO L226 Difference]: Without dead ends: 978 [2025-03-08 21:07:08,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:08,074 INFO L435 NwaCegarLoop]: 1257 mSDtfsCounter, 1220 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 2513 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:08,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 2513 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-08 21:07:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2025-03-08 21:07:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 652 states have (on average 1.205521472392638) internal successors, (786), 690 states have internal predecessors, (786), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:07:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1264 transitions. [2025-03-08 21:07:08,161 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1264 transitions. Word has length 145 [2025-03-08 21:07:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:08,161 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1264 transitions. [2025-03-08 21:07:08,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 21:07:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1264 transitions. [2025-03-08 21:07:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 21:07:08,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:08,164 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:08,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:07:08,164 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:08,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash -970769075, now seen corresponding path program 1 times [2025-03-08 21:07:08,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:08,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093154154] [2025-03-08 21:07:08,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:08,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 21:07:08,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 21:07:08,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:08,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:08,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093154154] [2025-03-08 21:07:08,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093154154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:08,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:08,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125811989] [2025-03-08 21:07:08,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:08,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:08,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:08,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:08,674 INFO L87 Difference]: Start difference. First operand 978 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 21:07:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:08,764 INFO L93 Difference]: Finished difference Result 978 states and 1264 transitions. [2025-03-08 21:07:08,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:08,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2025-03-08 21:07:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:08,774 INFO L225 Difference]: With dead ends: 978 [2025-03-08 21:07:08,775 INFO L226 Difference]: Without dead ends: 976 [2025-03-08 21:07:08,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:08,777 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 1217 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 2509 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:08,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 2509 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-08 21:07:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2025-03-08 21:07:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 651 states have (on average 1.2043010752688172) internal successors, (784), 688 states have internal predecessors, (784), 240 states have call successors, (240), 70 states have call predecessors, (240), 69 states have return successors, (238), 227 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 21:07:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1262 transitions. [2025-03-08 21:07:08,861 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1262 transitions. Word has length 151 [2025-03-08 21:07:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:08,862 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1262 transitions. [2025-03-08 21:07:08,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 21:07:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1262 transitions. [2025-03-08 21:07:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 21:07:08,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:08,865 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:08,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:07:08,865 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:08,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:08,866 INFO L85 PathProgramCache]: Analyzing trace with hash 762656652, now seen corresponding path program 1 times [2025-03-08 21:07:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:08,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378275040] [2025-03-08 21:07:08,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:09,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 21:07:09,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 21:07:09,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-08 21:07:09,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:09,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378275040] [2025-03-08 21:07:09,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378275040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:09,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:09,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:07:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602740280] [2025-03-08 21:07:09,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:09,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:07:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:09,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:07:09,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:07:09,635 INFO L87 Difference]: Start difference. First operand 976 states and 1262 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 21:07:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:09,791 INFO L93 Difference]: Finished difference Result 1639 states and 2075 transitions. [2025-03-08 21:07:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:07:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 187 [2025-03-08 21:07:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:09,797 INFO L225 Difference]: With dead ends: 1639 [2025-03-08 21:07:09,797 INFO L226 Difference]: Without dead ends: 981 [2025-03-08 21:07:09,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:07:09,799 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 0 mSDsluCounter, 5009 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6263 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:09,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6263 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:07:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-03-08 21:07:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-03-08 21:07:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 655 states have (on average 1.203053435114504) internal successors, (788), 692 states have internal predecessors, (788), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-03-08 21:07:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1270 transitions. [2025-03-08 21:07:09,859 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1270 transitions. Word has length 187 [2025-03-08 21:07:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:09,860 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1270 transitions. [2025-03-08 21:07:09,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 21:07:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1270 transitions. [2025-03-08 21:07:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 21:07:09,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:09,861 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:09,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:07:09,862 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash -948171506, now seen corresponding path program 1 times [2025-03-08 21:07:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893285819] [2025-03-08 21:07:09,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:10,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 21:07:10,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 21:07:10,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:10,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:10,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:10,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893285819] [2025-03-08 21:07:10,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893285819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:10,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:10,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392037600] [2025-03-08 21:07:10,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:10,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:10,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:10,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:10,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:10,440 INFO L87 Difference]: Start difference. First operand 981 states and 1270 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 21:07:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:10,550 INFO L93 Difference]: Finished difference Result 981 states and 1270 transitions. [2025-03-08 21:07:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:10,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2025-03-08 21:07:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:10,556 INFO L225 Difference]: With dead ends: 981 [2025-03-08 21:07:10,556 INFO L226 Difference]: Without dead ends: 979 [2025-03-08 21:07:10,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:10,559 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 1214 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:10,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 2505 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-03-08 21:07:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2025-03-08 21:07:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 654 states have (on average 1.201834862385321) internal successors, (786), 690 states have internal predecessors, (786), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-03-08 21:07:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1268 transitions. [2025-03-08 21:07:10,650 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1268 transitions. Word has length 157 [2025-03-08 21:07:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:10,652 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1268 transitions. [2025-03-08 21:07:10,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 21:07:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1268 transitions. [2025-03-08 21:07:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 21:07:10,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:10,654 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:10,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:07:10,654 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1114720425, now seen corresponding path program 1 times [2025-03-08 21:07:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:10,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689937751] [2025-03-08 21:07:10,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:11,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 21:07:11,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 21:07:11,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:11,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:11,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689937751] [2025-03-08 21:07:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689937751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:11,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:11,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:11,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562955283] [2025-03-08 21:07:11,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:11,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:11,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:11,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:11,216 INFO L87 Difference]: Start difference. First operand 979 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 21:07:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:11,297 INFO L93 Difference]: Finished difference Result 979 states and 1268 transitions. [2025-03-08 21:07:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:11,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2025-03-08 21:07:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:11,302 INFO L225 Difference]: With dead ends: 979 [2025-03-08 21:07:11,303 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 21:07:11,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:11,304 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 1211 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:11,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 2501 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 21:07:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-08 21:07:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 653 states have (on average 1.2006125574272588) internal successors, (784), 688 states have internal predecessors, (784), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-03-08 21:07:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1266 transitions. [2025-03-08 21:07:11,389 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1266 transitions. Word has length 163 [2025-03-08 21:07:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:11,389 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1266 transitions. [2025-03-08 21:07:11,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 21:07:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1266 transitions. [2025-03-08 21:07:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 21:07:11,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:11,391 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:11,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:07:11,391 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:11,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1804739358, now seen corresponding path program 1 times [2025-03-08 21:07:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918456151] [2025-03-08 21:07:11,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:11,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 21:07:11,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 21:07:11,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:11,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:11,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:11,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918456151] [2025-03-08 21:07:11,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918456151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:11,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:11,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:11,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664954937] [2025-03-08 21:07:11,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:11,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:11,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:11,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:11,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:11,847 INFO L87 Difference]: Start difference. First operand 977 states and 1266 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 21:07:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:11,932 INFO L93 Difference]: Finished difference Result 977 states and 1266 transitions. [2025-03-08 21:07:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:11,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-03-08 21:07:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:11,938 INFO L225 Difference]: With dead ends: 977 [2025-03-08 21:07:11,938 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 21:07:11,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:11,940 INFO L435 NwaCegarLoop]: 1249 mSDtfsCounter, 1208 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:11,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 2497 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 21:07:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2025-03-08 21:07:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 652 states have (on average 1.1993865030674846) internal successors, (782), 686 states have internal predecessors, (782), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-03-08 21:07:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1264 transitions. [2025-03-08 21:07:12,002 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1264 transitions. Word has length 169 [2025-03-08 21:07:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:12,002 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1264 transitions. [2025-03-08 21:07:12,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 21:07:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1264 transitions. [2025-03-08 21:07:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 21:07:12,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:12,004 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:12,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 21:07:12,004 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:12,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:12,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1834178765, now seen corresponding path program 1 times [2025-03-08 21:07:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:12,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337440932] [2025-03-08 21:07:12,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:12,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 21:07:12,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 21:07:12,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:12,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-03-08 21:07:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:12,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337440932] [2025-03-08 21:07:12,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337440932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:12,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:12,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:07:12,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398475058] [2025-03-08 21:07:12,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:12,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:07:12,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:12,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:07:12,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:07:12,493 INFO L87 Difference]: Start difference. First operand 975 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 21:07:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:12,585 INFO L93 Difference]: Finished difference Result 1739 states and 2225 transitions. [2025-03-08 21:07:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:07:12,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 211 [2025-03-08 21:07:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:12,590 INFO L225 Difference]: With dead ends: 1739 [2025-03-08 21:07:12,590 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 21:07:12,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:07:12,592 INFO L435 NwaCegarLoop]: 1245 mSDtfsCounter, 1228 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:12,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1245 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 21:07:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2025-03-08 21:07:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 649 states have (on average 1.197226502311248) internal successors, (777), 682 states have internal predecessors, (777), 240 states have call successors, (240), 70 states have call predecessors, (240), 70 states have return successors, (242), 228 states have call predecessors, (242), 238 states have call successors, (242) [2025-03-08 21:07:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1259 transitions. [2025-03-08 21:07:12,655 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1259 transitions. Word has length 211 [2025-03-08 21:07:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:12,656 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1259 transitions. [2025-03-08 21:07:12,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 21:07:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1259 transitions. [2025-03-08 21:07:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 21:07:12,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:12,658 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:12,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 21:07:12,658 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:12,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1558667491, now seen corresponding path program 1 times [2025-03-08 21:07:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:12,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407885220] [2025-03-08 21:07:12,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:12,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 21:07:13,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 21:07:13,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-08 21:07:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407885220] [2025-03-08 21:07:13,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407885220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:13,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:13,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:07:13,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026047098] [2025-03-08 21:07:13,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:13,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:07:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:13,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:07:13,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:13,320 INFO L87 Difference]: Start difference. First operand 971 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 21:07:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:13,447 INFO L93 Difference]: Finished difference Result 1031 states and 1314 transitions. [2025-03-08 21:07:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:07:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2025-03-08 21:07:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:13,453 INFO L225 Difference]: With dead ends: 1031 [2025-03-08 21:07:13,453 INFO L226 Difference]: Without dead ends: 1029 [2025-03-08 21:07:13,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:07:13,454 INFO L435 NwaCegarLoop]: 1241 mSDtfsCounter, 1025 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:13,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 3936 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:13,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-08 21:07:13,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2025-03-08 21:07:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 685 states have (on average 1.1883211678832117) internal successors, (814), 717 states have internal predecessors, (814), 247 states have call successors, (247), 82 states have call predecessors, (247), 82 states have return successors, (249), 235 states have call predecessors, (249), 245 states have call successors, (249) [2025-03-08 21:07:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1310 transitions. [2025-03-08 21:07:13,529 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1310 transitions. Word has length 203 [2025-03-08 21:07:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:13,529 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1310 transitions. [2025-03-08 21:07:13,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 21:07:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1310 transitions. [2025-03-08 21:07:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 21:07:13,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:13,533 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:13,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 21:07:13,533 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1753676057, now seen corresponding path program 1 times [2025-03-08 21:07:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679593788] [2025-03-08 21:07:13,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:13,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 21:07:13,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 21:07:13,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:13,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:14,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:14,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679593788] [2025-03-08 21:07:14,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679593788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:14,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:14,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:14,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760824476] [2025-03-08 21:07:14,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:14,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:14,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:14,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:14,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:14,181 INFO L87 Difference]: Start difference. First operand 1025 states and 1310 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 21:07:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:14,436 INFO L93 Difference]: Finished difference Result 1938 states and 2471 transitions. [2025-03-08 21:07:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:14,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-03-08 21:07:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:14,447 INFO L225 Difference]: With dead ends: 1938 [2025-03-08 21:07:14,448 INFO L226 Difference]: Without dead ends: 1936 [2025-03-08 21:07:14,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:14,450 INFO L435 NwaCegarLoop]: 1427 mSDtfsCounter, 1196 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:14,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 3935 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:07:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2025-03-08 21:07:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1903. [2025-03-08 21:07:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1278 states have (on average 1.1885758998435054) internal successors, (1519), 1326 states have internal predecessors, (1519), 454 states have call successors, (454), 159 states have call predecessors, (454), 160 states have return successors, (470), 435 states have call predecessors, (470), 452 states have call successors, (470) [2025-03-08 21:07:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2443 transitions. [2025-03-08 21:07:14,602 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2443 transitions. Word has length 175 [2025-03-08 21:07:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:14,603 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2443 transitions. [2025-03-08 21:07:14,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 21:07:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2443 transitions. [2025-03-08 21:07:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-08 21:07:14,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:14,607 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:14,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 21:07:14,607 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:14,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash -761173966, now seen corresponding path program 1 times [2025-03-08 21:07:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:14,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019244991] [2025-03-08 21:07:14,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:14,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:14,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 21:07:14,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 21:07:14,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:14,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-08 21:07:15,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019244991] [2025-03-08 21:07:15,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019244991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:07:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862954233] [2025-03-08 21:07:15,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:15,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:07:15,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:07:15,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:07:15,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:07:16,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 21:07:16,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 21:07:16,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:16,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:16,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 2283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 21:07:16,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:07:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 21:07:16,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:07:16,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862954233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:16,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:07:16,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 21:07:16,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61086435] [2025-03-08 21:07:16,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:16,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:07:16,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:16,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:07:16,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:07:16,466 INFO L87 Difference]: Start difference. First operand 1903 states and 2443 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 21:07:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:16,633 INFO L93 Difference]: Finished difference Result 3548 states and 4500 transitions. [2025-03-08 21:07:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:07:16,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 217 [2025-03-08 21:07:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:16,650 INFO L225 Difference]: With dead ends: 3548 [2025-03-08 21:07:16,650 INFO L226 Difference]: Without dead ends: 1953 [2025-03-08 21:07:16,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:07:16,655 INFO L435 NwaCegarLoop]: 1303 mSDtfsCounter, 1170 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:16,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1370 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2025-03-08 21:07:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1950. [2025-03-08 21:07:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1305 states have (on average 1.1839080459770115) internal successors, (1545), 1356 states have internal predecessors, (1545), 469 states have call successors, (469), 165 states have call predecessors, (469), 166 states have return successors, (485), 448 states have call predecessors, (485), 467 states have call successors, (485) [2025-03-08 21:07:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2499 transitions. [2025-03-08 21:07:16,830 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2499 transitions. Word has length 217 [2025-03-08 21:07:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:16,831 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 2499 transitions. [2025-03-08 21:07:16,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 21:07:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2499 transitions. [2025-03-08 21:07:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 21:07:16,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:16,833 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:16,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:07:17,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 21:07:17,034 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:17,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash 155048814, now seen corresponding path program 1 times [2025-03-08 21:07:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:17,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820360003] [2025-03-08 21:07:17,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:17,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:17,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 21:07:17,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 21:07:17,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:17,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:17,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:17,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820360003] [2025-03-08 21:07:17,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820360003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:17,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:17,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:17,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634916574] [2025-03-08 21:07:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:17,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:17,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:17,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:17,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:17,517 INFO L87 Difference]: Start difference. First operand 1950 states and 2499 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 21:07:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:17,674 INFO L93 Difference]: Finished difference Result 1950 states and 2499 transitions. [2025-03-08 21:07:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:17,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2025-03-08 21:07:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:17,683 INFO L225 Difference]: With dead ends: 1950 [2025-03-08 21:07:17,683 INFO L226 Difference]: Without dead ends: 1948 [2025-03-08 21:07:17,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:17,684 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 1192 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:17,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 2469 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-03-08 21:07:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1948. [2025-03-08 21:07:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1304 states have (on average 1.1832822085889572) internal successors, (1543), 1354 states have internal predecessors, (1543), 469 states have call successors, (469), 165 states have call predecessors, (469), 166 states have return successors, (485), 448 states have call predecessors, (485), 467 states have call successors, (485) [2025-03-08 21:07:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2497 transitions. [2025-03-08 21:07:17,859 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2497 transitions. Word has length 181 [2025-03-08 21:07:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:17,860 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 2497 transitions. [2025-03-08 21:07:17,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 21:07:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2497 transitions. [2025-03-08 21:07:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 21:07:17,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:17,862 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:17,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 21:07:17,862 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:17,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1528321866, now seen corresponding path program 1 times [2025-03-08 21:07:17,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:17,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51188589] [2025-03-08 21:07:17,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:17,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:18,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 21:07:18,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 21:07:18,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:18,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-08 21:07:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:18,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51188589] [2025-03-08 21:07:18,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51188589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:18,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:07:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720520736] [2025-03-08 21:07:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:18,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:07:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:18,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:07:18,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:18,504 INFO L87 Difference]: Start difference. First operand 1948 states and 2497 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 21:07:22,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:07:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:22,732 INFO L93 Difference]: Finished difference Result 1952 states and 2499 transitions. [2025-03-08 21:07:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:07:22,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) Word has length 214 [2025-03-08 21:07:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:22,740 INFO L225 Difference]: With dead ends: 1952 [2025-03-08 21:07:22,741 INFO L226 Difference]: Without dead ends: 1950 [2025-03-08 21:07:22,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:07:22,742 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 212 mSDsluCounter, 3642 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 4929 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:22,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 4929 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 21:07:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2025-03-08 21:07:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1946. [2025-03-08 21:07:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1303 states have (on average 1.1818879508825786) internal successors, (1540), 1352 states have internal predecessors, (1540), 469 states have call successors, (469), 165 states have call predecessors, (469), 166 states have return successors, (485), 448 states have call predecessors, (485), 467 states have call successors, (485) [2025-03-08 21:07:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2494 transitions. [2025-03-08 21:07:22,921 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2494 transitions. Word has length 214 [2025-03-08 21:07:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:22,922 INFO L471 AbstractCegarLoop]: Abstraction has 1946 states and 2494 transitions. [2025-03-08 21:07:22,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 21:07:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2494 transitions. [2025-03-08 21:07:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 21:07:22,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:22,924 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:22,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 21:07:22,924 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1095151654, now seen corresponding path program 1 times [2025-03-08 21:07:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:22,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436627688] [2025-03-08 21:07:22,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:22,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:23,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 21:07:23,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 21:07:23,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:23,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:07:23,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436627688] [2025-03-08 21:07:23,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436627688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726504477] [2025-03-08 21:07:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:23,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:23,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:23,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:23,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:23,412 INFO L87 Difference]: Start difference. First operand 1946 states and 2494 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 21:07:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:23,748 INFO L93 Difference]: Finished difference Result 3749 states and 4825 transitions. [2025-03-08 21:07:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:23,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2025-03-08 21:07:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:23,769 INFO L225 Difference]: With dead ends: 3749 [2025-03-08 21:07:23,770 INFO L226 Difference]: Without dead ends: 3591 [2025-03-08 21:07:23,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:23,775 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 1185 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 3861 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:23,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 3861 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:07:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2025-03-08 21:07:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3573. [2025-03-08 21:07:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3573 states, 2407 states have (on average 1.1882010801828002) internal successors, (2860), 2487 states have internal predecessors, (2860), 854 states have call successors, (854), 302 states have call predecessors, (854), 304 states have return successors, (914), 819 states have call predecessors, (914), 850 states have call successors, (914) [2025-03-08 21:07:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 4628 transitions. [2025-03-08 21:07:24,063 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 4628 transitions. Word has length 187 [2025-03-08 21:07:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:24,063 INFO L471 AbstractCegarLoop]: Abstraction has 3573 states and 4628 transitions. [2025-03-08 21:07:24,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 21:07:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 4628 transitions. [2025-03-08 21:07:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 21:07:24,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:24,066 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:24,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 21:07:24,066 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:24,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash 490436756, now seen corresponding path program 1 times [2025-03-08 21:07:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827291798] [2025-03-08 21:07:24,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:24,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 21:07:24,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 21:07:24,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:24,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-03-08 21:07:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827291798] [2025-03-08 21:07:24,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827291798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:24,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:24,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:07:24,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660271306] [2025-03-08 21:07:24,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:24,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:07:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:24,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:07:24,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:24,591 INFO L87 Difference]: Start difference. First operand 3573 states and 4628 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 21:07:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:24,875 INFO L93 Difference]: Finished difference Result 6611 states and 8532 transitions. [2025-03-08 21:07:24,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:07:24,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 230 [2025-03-08 21:07:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:24,889 INFO L225 Difference]: With dead ends: 6611 [2025-03-08 21:07:24,890 INFO L226 Difference]: Without dead ends: 3585 [2025-03-08 21:07:24,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:24,900 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 0 mSDsluCounter, 3690 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4922 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:24,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4922 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2025-03-08 21:07:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3585. [2025-03-08 21:07:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 2419 states have (on average 1.187267465894998) internal successors, (2872), 2499 states have internal predecessors, (2872), 854 states have call successors, (854), 302 states have call predecessors, (854), 304 states have return successors, (914), 819 states have call predecessors, (914), 850 states have call successors, (914) [2025-03-08 21:07:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4640 transitions. [2025-03-08 21:07:25,235 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4640 transitions. Word has length 230 [2025-03-08 21:07:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:25,236 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 4640 transitions. [2025-03-08 21:07:25,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 21:07:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4640 transitions. [2025-03-08 21:07:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 21:07:25,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:25,239 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:25,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 21:07:25,239 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:25,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1198506986, now seen corresponding path program 1 times [2025-03-08 21:07:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:25,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850320944] [2025-03-08 21:07:25,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:25,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:25,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 21:07:25,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 21:07:25,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-03-08 21:07:26,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:26,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850320944] [2025-03-08 21:07:26,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850320944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:26,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:26,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:07:26,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980893589] [2025-03-08 21:07:26,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:26,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:07:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:26,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:07:26,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:26,105 INFO L87 Difference]: Start difference. First operand 3585 states and 4640 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 21:07:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:26,425 INFO L93 Difference]: Finished difference Result 3641 states and 4680 transitions. [2025-03-08 21:07:26,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:07:26,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 230 [2025-03-08 21:07:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:26,437 INFO L225 Difference]: With dead ends: 3641 [2025-03-08 21:07:26,437 INFO L226 Difference]: Without dead ends: 3639 [2025-03-08 21:07:26,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:07:26,438 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 1109 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:26,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 3726 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:07:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2025-03-08 21:07:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3639. [2025-03-08 21:07:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 2458 states have (on average 1.1810414971521561) internal successors, (2903), 2537 states have internal predecessors, (2903), 854 states have call successors, (854), 318 states have call predecessors, (854), 320 states have return successors, (914), 819 states have call predecessors, (914), 850 states have call successors, (914) [2025-03-08 21:07:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4671 transitions. [2025-03-08 21:07:26,715 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4671 transitions. Word has length 230 [2025-03-08 21:07:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:26,717 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 4671 transitions. [2025-03-08 21:07:26,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (32), 3 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 21:07:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4671 transitions. [2025-03-08 21:07:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 21:07:26,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:26,719 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:26,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 21:07:26,719 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:26,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1830217577, now seen corresponding path program 1 times [2025-03-08 21:07:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:26,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130251380] [2025-03-08 21:07:26,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:27,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 21:07:27,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 21:07:27,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:27,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-08 21:07:28,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:28,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130251380] [2025-03-08 21:07:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130251380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:07:28,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680889944] [2025-03-08 21:07:28,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:28,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:07:28,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:07:28,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:07:28,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:07:29,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 21:07:29,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 21:07:29,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:29,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:29,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 2462 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 21:07:29,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:07:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-03-08 21:07:29,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:07:29,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680889944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:29,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:07:29,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 27 [2025-03-08 21:07:29,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165421839] [2025-03-08 21:07:29,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:29,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:07:29,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:29,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:07:29,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2025-03-08 21:07:29,746 INFO L87 Difference]: Start difference. First operand 3639 states and 4671 transitions. Second operand has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2025-03-08 21:07:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:30,724 INFO L93 Difference]: Finished difference Result 6570 states and 8299 transitions. [2025-03-08 21:07:30,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 21:07:30,725 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) Word has length 229 [2025-03-08 21:07:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:30,738 INFO L225 Difference]: With dead ends: 6570 [2025-03-08 21:07:30,738 INFO L226 Difference]: Without dead ends: 3880 [2025-03-08 21:07:30,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=1165, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 21:07:30,744 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 38 mSDsluCounter, 13674 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 14927 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:30,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 14927 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:07:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2025-03-08 21:07:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 3675. [2025-03-08 21:07:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3675 states, 2486 states have (on average 1.1790024135156878) internal successors, (2931), 2565 states have internal predecessors, (2931), 862 states have call successors, (862), 318 states have call predecessors, (862), 320 states have return successors, (922), 827 states have call predecessors, (922), 858 states have call successors, (922) [2025-03-08 21:07:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 4715 transitions. [2025-03-08 21:07:31,031 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 4715 transitions. Word has length 229 [2025-03-08 21:07:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:31,031 INFO L471 AbstractCegarLoop]: Abstraction has 3675 states and 4715 transitions. [2025-03-08 21:07:31,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 5 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2025-03-08 21:07:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4715 transitions. [2025-03-08 21:07:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-08 21:07:31,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:31,033 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:31,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:07:31,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-08 21:07:31,233 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:31,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1341096415, now seen corresponding path program 1 times [2025-03-08 21:07:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:31,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932448463] [2025-03-08 21:07:31,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:31,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 21:07:31,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 21:07:31,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:31,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 21:07:31,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932448463] [2025-03-08 21:07:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932448463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:07:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270307964] [2025-03-08 21:07:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:31,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:07:31,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:31,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:07:31,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:07:31,675 INFO L87 Difference]: Start difference. First operand 3675 states and 4715 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 21:07:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:32,143 INFO L93 Difference]: Finished difference Result 6805 states and 8634 transitions. [2025-03-08 21:07:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:07:32,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 238 [2025-03-08 21:07:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:32,157 INFO L225 Difference]: With dead ends: 6805 [2025-03-08 21:07:32,158 INFO L226 Difference]: Without dead ends: 3676 [2025-03-08 21:07:32,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:07:32,165 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 0 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:32,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2434 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:07:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2025-03-08 21:07:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3676. [2025-03-08 21:07:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3676 states, 2487 states have (on average 1.178930438279051) internal successors, (2932), 2565 states have internal predecessors, (2932), 862 states have call successors, (862), 318 states have call predecessors, (862), 320 states have return successors, (922), 828 states have call predecessors, (922), 858 states have call successors, (922) [2025-03-08 21:07:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 4716 transitions. [2025-03-08 21:07:32,448 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 4716 transitions. Word has length 238 [2025-03-08 21:07:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:32,449 INFO L471 AbstractCegarLoop]: Abstraction has 3676 states and 4716 transitions. [2025-03-08 21:07:32,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 21:07:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 4716 transitions. [2025-03-08 21:07:32,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-08 21:07:32,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:32,451 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:32,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 21:07:32,451 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ##fun~$Pointer$~TO~VOIDErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2025-03-08 21:07:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash 286640636, now seen corresponding path program 1 times [2025-03-08 21:07:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533414369] [2025-03-08 21:07:32,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-08 21:07:32,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-08 21:07:32,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:32,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:33,528 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 21:07:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:33,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533414369] [2025-03-08 21:07:33,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533414369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:33,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:33,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:07:33,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103468284] [2025-03-08 21:07:33,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:33,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:07:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:33,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:07:33,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:07:33,530 INFO L87 Difference]: Start difference. First operand 3676 states and 4716 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 4 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-08 21:07:37,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:07:41,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:07:45,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:07:49,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:07:53,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []