./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.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-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.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 4bd03bf538c8a1f05055d45724b67645b210b4f99e6ffddc4b441645e05ec36a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 20:17:53,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 20:17:53,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 20:17:53,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 20:17:53,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 20:17:53,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 20:17:53,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 20:17:53,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 20:17:53,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 20:17:53,081 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 20:17:53,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 20:17:53,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 20:17:53,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 20:17:53,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 20:17:53,083 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 20:17:53,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 20:17:53,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 20:17:53,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 20:17:53,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 20:17:53,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 20:17:53,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 20:17:53,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 20:17:53,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 20:17:53,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 20:17:53,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 20:17:53,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 20:17:53,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 20:17:53,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 20:17:53,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 20:17:53,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 20:17:53,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 20:17:53,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 20:17:53,085 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 20:17:53,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 20:17:53,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 20:17:53,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 20:17:53,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 20:17:53,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 20:17:53,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 20:17:53,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 20:17:53,086 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 -> 4bd03bf538c8a1f05055d45724b67645b210b4f99e6ffddc4b441645e05ec36a [2025-03-08 20:17:53,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 20:17:53,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 20:17:53,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 20:17:53,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 20:17:53,314 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 20:17:53,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i [2025-03-08 20:17:54,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d09ebaf4/24badde4ee6341e18c14e623bf630404/FLAG898bb028e [2025-03-08 20:17:54,775 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 20:17:54,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i [2025-03-08 20:17:54,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d09ebaf4/24badde4ee6341e18c14e623bf630404/FLAG898bb028e [2025-03-08 20:17:54,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d09ebaf4/24badde4ee6341e18c14e623bf630404 [2025-03-08 20:17:54,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 20:17:54,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 20:17:54,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 20:17:54,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 20:17:54,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 20:17:54,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:17:54" (1/1) ... [2025-03-08 20:17:54,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4956a52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:54, skipping insertion in model container [2025-03-08 20:17:54,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:17:54" (1/1) ... [2025-03-08 20:17:55,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 20:17:55,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196376,196389] [2025-03-08 20:17:55,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196545,196558] [2025-03-08 20:17:55,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196712,196725] [2025-03-08 20:17:55,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196880,196893] [2025-03-08 20:17:55,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 20:17:55,960 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 20:17:56,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [3610] [2025-03-08 20:17:56,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [3618] [2025-03-08 20:17:56,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196376,196389] [2025-03-08 20:17:56,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196545,196558] [2025-03-08 20:17:56,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196712,196725] [2025-03-08 20:17:56,156 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196880,196893] [2025-03-08 20:17:56,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 20:17:56,204 INFO L204 MainTranslator]: Completed translation [2025-03-08 20:17:56,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56 WrapperNode [2025-03-08 20:17:56,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 20:17:56,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 20:17:56,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 20:17:56,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 20:17:56,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,339 INFO L138 Inliner]: procedures = 288, calls = 1182, calls flagged for inlining = 114, calls inlined = 94, statements flattened = 2631 [2025-03-08 20:17:56,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 20:17:56,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 20:17:56,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 20:17:56,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 20:17:56,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,501 INFO L175 MemorySlicer]: Split 271 memory accesses to 30 slices as follows [1, 4, 135, 18, 6, 6, 1, 2, 29, 2, 5, 1, 5, 1, 4, 1, 5, 1, 4, 1, 2, 5, 6, 1, 5, 1, 11, 4, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 83 initializations are split as follows [1, 0, 0, 18, 6, 6, 1, 2, 0, 1, 5, 1, 5, 1, 4, 1, 5, 1, 4, 1, 0, 5, 0, 1, 5, 1, 0, 4, 1, 3]. The 109 writes are split as follows [0, 4, 64, 0, 0, 0, 0, 0, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 6, 0, 0, 0, 9, 0, 0, 0]. [2025-03-08 20:17:56,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 20:17:56,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 20:17:56,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 20:17:56,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 20:17:56,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (1/1) ... [2025-03-08 20:17:56,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 20:17:56,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 20:17:56,672 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 20:17:56,674 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 20:17:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-08 20:17:56,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#21 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#22 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#23 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#24 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#25 [2025-03-08 20:17:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#26 [2025-03-08 20:17:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#27 [2025-03-08 20:17:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#28 [2025-03-08 20:17:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#29 [2025-03-08 20:17:56,696 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#21 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#22 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#23 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#24 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#25 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#26 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#27 [2025-03-08 20:17:56,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#28 [2025-03-08 20:17:56,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#29 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#24 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#25 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#26 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#27 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#28 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#29 [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 20:17:56,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 20:17:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 20:17:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 20:17:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_automaton_state_0_6 [2025-03-08 20:17:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_automaton_state_0_6 [2025-03-08 20:17:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_efm_disable [2025-03-08 20:17:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_efm_disable [2025-03-08 20:17:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 20:17:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 20:17:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure request_irq [2025-03-08 20:17:56,701 INFO L138 BoogieDeclarations]: Found implementation of procedure request_irq [2025-03-08 20:17:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 20:17:56,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 20:17:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_port_len [2025-03-08 20:17:56,701 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_port_len [2025-03-08 20:17:56,701 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_wake_reg_read [2025-03-08 20:17:56,702 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_wake_reg_read [2025-03-08 20:17:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2025-03-08 20:17:56,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2025-03-08 20:17:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-03-08 20:17:56,702 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-03-08 20:17:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_clear_tx_fifo [2025-03-08 20:17:56,702 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_clear_tx_fifo [2025-03-08 20:17:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 20:17:56,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 20:17:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure ir_raw_event_handle [2025-03-08 20:17:56,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_raw_event_handle [2025-03-08 20:17:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-08 20:17:56,702 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-08 20:17:56,702 INFO L130 BoogieDeclarations]: Found specification of procedure rc_unregister_device [2025-03-08 20:17:56,703 INFO L138 BoogieDeclarations]: Found implementation of procedure rc_unregister_device [2025-03-08 20:17:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_clear_cir_wake_fifo [2025-03-08 20:17:56,703 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_clear_cir_wake_fifo [2025-03-08 20:17:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 20:17:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_process_rx_ir_data [2025-03-08 20:17:56,703 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_process_rx_ir_data [2025-03-08 20:17:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 20:17:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 20:17:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 20:17:56,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 20:17:56,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 20:17:56,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 20:17:56,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 20:17:56,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#27 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#28 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#29 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-08 20:17:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cr_write [2025-03-08 20:17:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cr_write [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_remove [2025-03-08 20:17:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_remove [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_47 [2025-03-08 20:17:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_47 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_45 [2025-03-08 20:17:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_45 [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 20:17:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-08 20:17:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_regs_init [2025-03-08 20:17:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_regs_init [2025-03-08 20:17:56,706 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_tx_inactive [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_tx_inactive [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_NOT_ARG_SIGN [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_NOT_ARG_SIGN [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_clear_cir_fifo [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_clear_cir_fifo [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_reg_read [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_reg_read [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_nvt_lock_of_nvt_dev [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_nvt_lock_of_nvt_dev [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_get_rx_ir_data [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_get_rx_ir_data [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_get_resource [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_get_resource [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_reg_write [2025-03-08 20:17:56,707 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_reg_write [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 20:17:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#27 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#28 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#29 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_resource_valid [2025-03-08 20:17:56,710 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_resource_valid [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-08 20:17:56,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_set_cir_iren [2025-03-08 20:17:56,710 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_set_cir_iren [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 20:17:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2025-03-08 20:17:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2025-03-08 20:17:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2025-03-08 20:17:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_set_reg_bit [2025-03-08 20:17:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_set_reg_bit [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2025-03-08 20:17:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 20:17:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_wake_regs_init [2025-03-08 20:17:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_wake_regs_init [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 20:17:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 20:17:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cr_read [2025-03-08 20:17:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cr_read [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_enable_wake [2025-03-08 20:17:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_enable_wake [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~$Pointer$~TO~int [2025-03-08 20:17:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~$Pointer$~TO~int [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-03-08 20:17:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_0 [2025-03-08 20:17:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_0 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 20:17:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 20:17:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#27 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#28 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#29 [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_wake_reg_write [2025-03-08 20:17:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_wake_reg_write [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_efm_enable [2025-03-08 20:17:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_efm_enable [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_disable_cir [2025-03-08 20:17:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_disable_cir [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_port_start [2025-03-08 20:17:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_port_start [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_select_logical_dev [2025-03-08 20:17:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_select_logical_dev [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-08 20:17:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2025-03-08 20:17:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2025-03-08 20:17:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_automaton_state_1_6 [2025-03-08 20:17:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_automaton_state_1_6 [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_shutdown [2025-03-08 20:17:56,717 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_shutdown [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2025-03-08 20:17:56,717 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_get_drvdata [2025-03-08 20:17:56,717 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_get_drvdata [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 20:17:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2025-03-08 20:17:56,718 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_region [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_port_valid [2025-03-08 20:17:56,718 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_port_valid [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2025-03-08 20:17:56,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2025-03-08 20:17:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 20:17:56,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 20:17:57,213 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 20:17:57,215 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 20:17:57,226 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 20:17:57,273 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7928: havoc request_threaded_irq_#t~nondet506#1; [2025-03-08 20:17:57,329 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3601: havoc resource_size_#t~mem27#1;havoc resource_size_#t~mem28#1; [2025-03-08 20:17:57,484 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4479: call ULTIMATE.dealloc(~#rawir~0#1.base, ~#rawir~0#1.offset);havoc ~#rawir~0#1.base, ~#rawir~0#1.offset; [2025-03-08 20:17:57,484 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7875: havoc ir_raw_event_store_with_filter_#t~nondet499#1; [2025-03-08 20:17:57,558 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7911: havoc #t~nondet503; [2025-03-08 20:17:57,578 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7854: havoc #t~nondet496; [2025-03-08 20:17:57,616 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5940: #res#1 := ~arg0#1; [2025-03-08 20:17:57,767 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7871: havoc ir_raw_event_store_#t~nondet498#1; [2025-03-08 20:17:57,767 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3804: call ULTIMATE.dealloc(ir_raw_event_reset_~#ev~0#1.base, ir_raw_event_reset_~#ev~0#1.offset);havoc ir_raw_event_reset_~#ev~0#1.base, ir_raw_event_reset_~#ev~0#1.offset; [2025-03-08 20:17:57,772 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7896: havoc #t~ret500.base, #t~ret500.offset; [2025-03-08 20:17:57,918 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3663: havoc #t~mem50; [2025-03-08 20:17:57,941 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6499: havoc ldv_dev_get_drvdata_#t~mem417#1.base, ldv_dev_get_drvdata_#t~mem417#1.offset;havoc ldv_dev_get_drvdata_#t~mem418#1.base, ldv_dev_get_drvdata_#t~mem418#1.offset; [2025-03-08 20:17:57,944 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7844: havoc #t~ret495.base, #t~ret495.offset; [2025-03-08 20:18:06,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7900: havoc pnp_register_driver_#t~nondet501#1; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint main_returnLabel#1: #t~ret508#1 := main_#res#1;havoc main_#t~ret370#1, main_~tmp~29#1;assume { :end_inline_main } true; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6388-1: ldv_request_irq_66_#res#1 := ldv_request_irq_66_~ldv_func_res~0#1; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7914: havoc rc_allocate_device_#t~ret504#1.base, rc_allocate_device_#t~ret504#1.offset; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7921: havoc rc_register_device_#t~nondet505#1; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7858: havoc device_init_wakeup_#t~nondet497#1; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6406-1: ldv_request_irq_67_#res#1 := ldv_request_irq_67_~ldv_func_res~1#1; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4094: call ULTIMATE.dealloc(nvt_hw_detect_~#chip_id~0#1.base, nvt_hw_detect_~#chip_id~0#1.offset);havoc nvt_hw_detect_~#chip_id~0#1.base, nvt_hw_detect_~#chip_id~0#1.offset; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6481-1: ldv_pnp_register_driver_77_#res#1 := ldv_pnp_register_driver_77_~ldv_func_res~2#1; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5894-1: ldv_pnp_register_driver_#res#1 := ldv_pnp_register_driver_~arg0#1; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3715: havoc pnp_irq_#t~mem58#1; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4979: call ULTIMATE.dealloc(nvt_probe_~#__key~0#1.base, nvt_probe_~#__key~0#1.offset);havoc nvt_probe_~#__key~0#1.base, nvt_probe_~#__key~0#1.offset;call ULTIMATE.dealloc(nvt_probe_~#__key___0~0#1.base, nvt_probe_~#__key___0~0#1.offset);havoc nvt_probe_~#__key___0~0#1.base, nvt_probe_~#__key___0~0#1.offset;call ULTIMATE.dealloc(nvt_probe_~#__key___1~0#1.base, nvt_probe_~#__key___1~0#1.offset);havoc nvt_probe_~#__key___1~0#1.base, nvt_probe_~#__key___1~0#1.offset; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-03-08 20:18:06,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5451: call ULTIMATE.dealloc(ldv_base_instance_suspend_2_7_~#arg2#1.base, ldv_base_instance_suspend_2_7_~#arg2#1.offset);havoc ldv_base_instance_suspend_2_7_~#arg2#1.base, ldv_base_instance_suspend_2_7_~#arg2#1.offset; [2025-03-08 20:18:07,241 INFO L? ?]: Removed 1065 outVars from TransFormulas that were not future-live. [2025-03-08 20:18:07,241 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 20:18:07,291 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 20:18:07,292 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 20:18:07,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:18:07 BoogieIcfgContainer [2025-03-08 20:18:07,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 20:18:07,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 20:18:07,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 20:18:07,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 20:18:07,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:17:54" (1/3) ... [2025-03-08 20:18:07,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b46014b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:18:07, skipping insertion in model container [2025-03-08 20:18:07,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:17:56" (2/3) ... [2025-03-08 20:18:07,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b46014b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:18:07, skipping insertion in model container [2025-03-08 20:18:07,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:18:07" (3/3) ... [2025-03-08 20:18:07,298 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i [2025-03-08 20:18:07,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 20:18:07,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i that has 103 procedures, 1442 locations, 1 initial locations, 31 loop locations, and 3 error locations. [2025-03-08 20:18:07,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 20:18:07,381 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;@21901fb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 20:18:07,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 20:18:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 1295 states, 773 states have (on average 1.2354463130659767) internal successors, (955), 786 states have internal predecessors, (955), 447 states have call successors, (447), 73 states have call predecessors, (447), 72 states have return successors, (443), 442 states have call predecessors, (443), 443 states have call successors, (443) [2025-03-08 20:18:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 20:18:07,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:07,394 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2025-03-08 20:18:07,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:07,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash -924810749, now seen corresponding path program 1 times [2025-03-08 20:18:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:07,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230415720] [2025-03-08 20:18:07,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:07,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 20:18:07,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 20:18:07,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:07,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 20:18:08,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230415720] [2025-03-08 20:18:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230415720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:18:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162742110] [2025-03-08 20:18:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:08,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:18:08,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:08,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:18:08,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:18:08,208 INFO L87 Difference]: Start difference. First operand has 1295 states, 773 states have (on average 1.2354463130659767) internal successors, (955), 786 states have internal predecessors, (955), 447 states have call successors, (447), 73 states have call predecessors, (447), 72 states have return successors, (443), 442 states have call predecessors, (443), 443 states have call successors, (443) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 20:18:12,238 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 20:18:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:12,589 INFO L93 Difference]: Finished difference Result 3796 states and 5522 transitions. [2025-03-08 20:18:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:18:12,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2025-03-08 20:18:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:12,621 INFO L225 Difference]: With dead ends: 3796 [2025-03-08 20:18:12,622 INFO L226 Difference]: Without dead ends: 2503 [2025-03-08 20:18:12,630 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 20:18:12,632 INFO L435 NwaCegarLoop]: 1835 mSDtfsCounter, 1765 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 3608 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:12,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 3608 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 20:18:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-03-08 20:18:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2499. [2025-03-08 20:18:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 1493 states have (on average 1.2263898191560616) internal successors, (1831), 1517 states have internal predecessors, (1831), 862 states have call successors, (862), 142 states have call predecessors, (862), 141 states have return successors, (859), 857 states have call predecessors, (859), 859 states have call successors, (859) [2025-03-08 20:18:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 3552 transitions. [2025-03-08 20:18:12,879 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 3552 transitions. Word has length 57 [2025-03-08 20:18:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:12,879 INFO L471 AbstractCegarLoop]: Abstraction has 2499 states and 3552 transitions. [2025-03-08 20:18:12,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 20:18:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 3552 transitions. [2025-03-08 20:18:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 20:18:12,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:12,886 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2025-03-08 20:18:12,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 20:18:12,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:12,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -469211659, now seen corresponding path program 1 times [2025-03-08 20:18:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124393586] [2025-03-08 20:18:12,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:13,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 20:18:13,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 20:18:13,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:13,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 20:18:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124393586] [2025-03-08 20:18:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124393586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:18:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260593426] [2025-03-08 20:18:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:13,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:18:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:13,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:18:13,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:18:13,347 INFO L87 Difference]: Start difference. First operand 2499 states and 3552 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 20:18:17,366 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 20:18:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:17,622 INFO L93 Difference]: Finished difference Result 4732 states and 6710 transitions. [2025-03-08 20:18:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:18:17,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2025-03-08 20:18:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:17,635 INFO L225 Difference]: With dead ends: 4732 [2025-03-08 20:18:17,635 INFO L226 Difference]: Without dead ends: 2244 [2025-03-08 20:18:17,643 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 20:18:17,644 INFO L435 NwaCegarLoop]: 1835 mSDtfsCounter, 686 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:17,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 3575 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 110 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 20:18:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2025-03-08 20:18:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2223. [2025-03-08 20:18:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 1409 states have (on average 1.2562100780695529) internal successors, (1770), 1444 states have internal predecessors, (1770), 676 states have call successors, (676), 136 states have call predecessors, (676), 135 states have return successors, (673), 669 states have call predecessors, (673), 673 states have call successors, (673) [2025-03-08 20:18:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3119 transitions. [2025-03-08 20:18:17,725 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3119 transitions. Word has length 71 [2025-03-08 20:18:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:17,725 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 3119 transitions. [2025-03-08 20:18:17,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 20:18:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3119 transitions. [2025-03-08 20:18:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 20:18:17,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:17,728 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 20:18:17,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 20:18:17,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1793255697, now seen corresponding path program 1 times [2025-03-08 20:18:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785204335] [2025-03-08 20:18:17,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:17,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:17,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 20:18:17,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 20:18:17,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:17,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 20:18:18,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:18,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785204335] [2025-03-08 20:18:18,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785204335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:18,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:18,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:18:18,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092222341] [2025-03-08 20:18:18,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:18,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:18:18,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:18,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:18:18,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:18:18,051 INFO L87 Difference]: Start difference. First operand 2223 states and 3119 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 20:18:22,066 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 20:18:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:22,288 INFO L93 Difference]: Finished difference Result 5673 states and 7981 transitions. [2025-03-08 20:18:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:18:22,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2025-03-08 20:18:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:22,312 INFO L225 Difference]: With dead ends: 5673 [2025-03-08 20:18:22,313 INFO L226 Difference]: Without dead ends: 3901 [2025-03-08 20:18:22,322 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 20:18:22,324 INFO L435 NwaCegarLoop]: 2386 mSDtfsCounter, 1762 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:22,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 4161 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 20:18:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3901 states. [2025-03-08 20:18:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3901 to 3883. [2025-03-08 20:18:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 2440 states have (on average 1.2536885245901639) internal successors, (3059), 2494 states have internal predecessors, (3059), 1205 states have call successors, (1205), 236 states have call predecessors, (1205), 235 states have return successors, (1202), 1197 states have call predecessors, (1202), 1202 states have call successors, (1202) [2025-03-08 20:18:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 5466 transitions. [2025-03-08 20:18:22,510 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 5466 transitions. Word has length 109 [2025-03-08 20:18:22,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:22,510 INFO L471 AbstractCegarLoop]: Abstraction has 3883 states and 5466 transitions. [2025-03-08 20:18:22,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 20:18:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 5466 transitions. [2025-03-08 20:18:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 20:18:22,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:22,513 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 20:18:22,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 20:18:22,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:22,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2004606610, now seen corresponding path program 1 times [2025-03-08 20:18:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499710931] [2025-03-08 20:18:22,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:22,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 20:18:22,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 20:18:22,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:22,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 20:18:22,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:22,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499710931] [2025-03-08 20:18:22,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499710931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:22,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:22,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 20:18:22,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530326850] [2025-03-08 20:18:22,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:23,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 20:18:23,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:23,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 20:18:23,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:18:23,002 INFO L87 Difference]: Start difference. First operand 3883 states and 5466 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 20:18:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:23,247 INFO L93 Difference]: Finished difference Result 3889 states and 5471 transitions. [2025-03-08 20:18:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:18:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-08 20:18:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:23,268 INFO L225 Difference]: With dead ends: 3889 [2025-03-08 20:18:23,268 INFO L226 Difference]: Without dead ends: 3887 [2025-03-08 20:18:23,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 20:18:23,272 INFO L435 NwaCegarLoop]: 1798 mSDtfsCounter, 1787 mSDsluCounter, 3587 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1788 SdHoareTripleChecker+Valid, 5385 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:23,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1788 Valid, 5385 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:18:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2025-03-08 20:18:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3887. [2025-03-08 20:18:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3887 states, 2443 states have (on average 1.2533769954973393) internal successors, (3062), 2497 states have internal predecessors, (3062), 1205 states have call successors, (1205), 237 states have call predecessors, (1205), 236 states have return successors, (1202), 1197 states have call predecessors, (1202), 1202 states have call successors, (1202) [2025-03-08 20:18:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3887 states to 3887 states and 5469 transitions. [2025-03-08 20:18:23,493 INFO L78 Accepts]: Start accepts. Automaton has 3887 states and 5469 transitions. Word has length 109 [2025-03-08 20:18:23,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:23,494 INFO L471 AbstractCegarLoop]: Abstraction has 3887 states and 5469 transitions. [2025-03-08 20:18:23,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 20:18:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3887 states and 5469 transitions. [2025-03-08 20:18:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 20:18:23,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:23,500 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 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] [2025-03-08 20:18:23,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 20:18:23,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:23,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2066983823, now seen corresponding path program 1 times [2025-03-08 20:18:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:23,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206472747] [2025-03-08 20:18:23,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:23,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 20:18:23,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 20:18:23,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:23,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 20:18:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:23,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206472747] [2025-03-08 20:18:23,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206472747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:23,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:23,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 20:18:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595604227] [2025-03-08 20:18:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 20:18:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:23,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 20:18:23,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:18:23,996 INFO L87 Difference]: Start difference. First operand 3887 states and 5469 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 20:18:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:24,195 INFO L93 Difference]: Finished difference Result 3893 states and 5474 transitions. [2025-03-08 20:18:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:18:24,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2025-03-08 20:18:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:24,213 INFO L225 Difference]: With dead ends: 3893 [2025-03-08 20:18:24,213 INFO L226 Difference]: Without dead ends: 3891 [2025-03-08 20:18:24,215 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 20:18:24,216 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 1783 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 5389 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:24,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 5389 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:18:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2025-03-08 20:18:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3891. [2025-03-08 20:18:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 2446 states have (on average 1.2530662305805396) internal successors, (3065), 2500 states have internal predecessors, (3065), 1205 states have call successors, (1205), 238 states have call predecessors, (1205), 237 states have return successors, (1202), 1197 states have call predecessors, (1202), 1202 states have call successors, (1202) [2025-03-08 20:18:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 5472 transitions. [2025-03-08 20:18:24,357 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 5472 transitions. Word has length 114 [2025-03-08 20:18:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:24,358 INFO L471 AbstractCegarLoop]: Abstraction has 3891 states and 5472 transitions. [2025-03-08 20:18:24,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 20:18:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 5472 transitions. [2025-03-08 20:18:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 20:18:24,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:24,360 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 20:18:24,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 20:18:24,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:24,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash -782669576, now seen corresponding path program 1 times [2025-03-08 20:18:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:24,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589928974] [2025-03-08 20:18:24,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:24,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 20:18:24,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 20:18:24,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:24,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 20:18:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589928974] [2025-03-08 20:18:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589928974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:24,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:24,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:18:24,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447985996] [2025-03-08 20:18:24,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:24,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:18:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:24,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:18:24,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:18:24,663 INFO L87 Difference]: Start difference. First operand 3891 states and 5472 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 20:18:28,678 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 20:18:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:29,037 INFO L93 Difference]: Finished difference Result 10860 states and 15256 transitions. [2025-03-08 20:18:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:18:29,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 126 [2025-03-08 20:18:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:29,081 INFO L225 Difference]: With dead ends: 10860 [2025-03-08 20:18:29,082 INFO L226 Difference]: Without dead ends: 6980 [2025-03-08 20:18:29,101 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 20:18:29,102 INFO L435 NwaCegarLoop]: 2126 mSDtfsCounter, 1704 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 3907 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:29,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 3907 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 20:18:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2025-03-08 20:18:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 6941. [2025-03-08 20:18:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6941 states, 4338 states have (on average 1.2425080682342093) internal successors, (5390), 4423 states have internal predecessors, (5390), 2168 states have call successors, (2168), 433 states have call predecessors, (2168), 432 states have return successors, (2177), 2155 states have call predecessors, (2177), 2165 states have call successors, (2177) [2025-03-08 20:18:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 9735 transitions. [2025-03-08 20:18:29,458 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 9735 transitions. Word has length 126 [2025-03-08 20:18:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:29,459 INFO L471 AbstractCegarLoop]: Abstraction has 6941 states and 9735 transitions. [2025-03-08 20:18:29,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 20:18:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 9735 transitions. [2025-03-08 20:18:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 20:18:29,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:29,463 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 20:18:29,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 20:18:29,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:29,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1827183154, now seen corresponding path program 1 times [2025-03-08 20:18:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399571979] [2025-03-08 20:18:29,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:29,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 20:18:29,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 20:18:29,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:29,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-08 20:18:29,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:29,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399571979] [2025-03-08 20:18:29,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399571979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:29,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:29,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 20:18:29,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514611776] [2025-03-08 20:18:29,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:29,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 20:18:29,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:29,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 20:18:29,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:18:29,943 INFO L87 Difference]: Start difference. First operand 6941 states and 9735 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 20:18:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:30,263 INFO L93 Difference]: Finished difference Result 6947 states and 9740 transitions. [2025-03-08 20:18:30,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:18:30,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-08 20:18:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:30,308 INFO L225 Difference]: With dead ends: 6947 [2025-03-08 20:18:30,308 INFO L226 Difference]: Without dead ends: 6945 [2025-03-08 20:18:30,315 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 20:18:30,316 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 1782 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 5389 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:30,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 5389 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:18:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6945 states. [2025-03-08 20:18:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6945 to 6945. [2025-03-08 20:18:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6945 states, 4341 states have (on average 1.2423404745450357) internal successors, (5393), 4426 states have internal predecessors, (5393), 2168 states have call successors, (2168), 434 states have call predecessors, (2168), 433 states have return successors, (2177), 2155 states have call predecessors, (2177), 2165 states have call successors, (2177) [2025-03-08 20:18:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6945 states to 6945 states and 9738 transitions. [2025-03-08 20:18:30,644 INFO L78 Accepts]: Start accepts. Automaton has 6945 states and 9738 transitions. Word has length 119 [2025-03-08 20:18:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:30,645 INFO L471 AbstractCegarLoop]: Abstraction has 6945 states and 9738 transitions. [2025-03-08 20:18:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 20:18:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6945 states and 9738 transitions. [2025-03-08 20:18:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 20:18:30,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:30,648 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 20:18:30,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 20:18:30,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:30,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:30,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1038724433, now seen corresponding path program 1 times [2025-03-08 20:18:30,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:30,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681795117] [2025-03-08 20:18:30,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:30,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 20:18:30,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 20:18:30,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:30,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-08 20:18:31,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:31,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681795117] [2025-03-08 20:18:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681795117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:31,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 20:18:31,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088420606] [2025-03-08 20:18:31,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:31,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 20:18:31,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:31,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 20:18:31,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:18:31,026 INFO L87 Difference]: Start difference. First operand 6945 states and 9738 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 20:18:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:31,377 INFO L93 Difference]: Finished difference Result 7196 states and 9951 transitions. [2025-03-08 20:18:31,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:18:31,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-08 20:18:31,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:31,414 INFO L225 Difference]: With dead ends: 7196 [2025-03-08 20:18:31,414 INFO L226 Difference]: Without dead ends: 7194 [2025-03-08 20:18:31,422 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 20:18:31,423 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 1734 mSDsluCounter, 3646 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 5445 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:31,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 5445 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:18:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states. [2025-03-08 20:18:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 7192. [2025-03-08 20:18:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7192 states, 4506 states have (on average 1.2354638260097648) internal successors, (5567), 4591 states have internal predecessors, (5567), 2186 states have call successors, (2186), 498 states have call predecessors, (2186), 497 states have return successors, (2195), 2173 states have call predecessors, (2195), 2183 states have call successors, (2195) [2025-03-08 20:18:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7192 states to 7192 states and 9948 transitions. [2025-03-08 20:18:31,788 INFO L78 Accepts]: Start accepts. Automaton has 7192 states and 9948 transitions. Word has length 124 [2025-03-08 20:18:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 7192 states and 9948 transitions. [2025-03-08 20:18:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 20:18:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7192 states and 9948 transitions. [2025-03-08 20:18:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 20:18:31,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:31,792 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 20:18:31,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 20:18:31,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2040160814, now seen corresponding path program 1 times [2025-03-08 20:18:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019351388] [2025-03-08 20:18:31,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:31,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 20:18:31,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 20:18:31,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:31,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-08 20:18:32,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:32,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019351388] [2025-03-08 20:18:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019351388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:32,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:32,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 20:18:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165185989] [2025-03-08 20:18:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:32,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 20:18:32,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:32,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 20:18:32,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:18:32,149 INFO L87 Difference]: Start difference. First operand 7192 states and 9948 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 20:18:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:32,625 INFO L93 Difference]: Finished difference Result 7198 states and 9953 transitions. [2025-03-08 20:18:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:18:32,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-08 20:18:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:32,665 INFO L225 Difference]: With dead ends: 7198 [2025-03-08 20:18:32,665 INFO L226 Difference]: Without dead ends: 7196 [2025-03-08 20:18:32,672 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 20:18:32,672 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 1780 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 5389 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:32,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1781 Valid, 5389 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:18:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2025-03-08 20:18:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7196. [2025-03-08 20:18:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7196 states, 4509 states have (on average 1.235307163450876) internal successors, (5570), 4594 states have internal predecessors, (5570), 2186 states have call successors, (2186), 499 states have call predecessors, (2186), 498 states have return successors, (2195), 2173 states have call predecessors, (2195), 2183 states have call successors, (2195) [2025-03-08 20:18:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 9951 transitions. [2025-03-08 20:18:33,210 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 9951 transitions. Word has length 129 [2025-03-08 20:18:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:33,211 INFO L471 AbstractCegarLoop]: Abstraction has 7196 states and 9951 transitions. [2025-03-08 20:18:33,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 20:18:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 9951 transitions. [2025-03-08 20:18:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 20:18:33,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:33,215 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 20:18:33,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 20:18:33,215 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:33,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2031394879, now seen corresponding path program 1 times [2025-03-08 20:18:33,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:33,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213215854] [2025-03-08 20:18:33,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:33,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 20:18:33,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 20:18:33,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:33,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 20:18:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:33,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213215854] [2025-03-08 20:18:33,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213215854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:33,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:18:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160629865] [2025-03-08 20:18:33,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:33,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:18:33,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:33,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:18:33,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:18:33,542 INFO L87 Difference]: Start difference. First operand 7196 states and 9951 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 20:18:37,557 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 20:18:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:38,069 INFO L93 Difference]: Finished difference Result 18500 states and 25557 transitions. [2025-03-08 20:18:38,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:18:38,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 141 [2025-03-08 20:18:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:38,128 INFO L225 Difference]: With dead ends: 18500 [2025-03-08 20:18:38,128 INFO L226 Difference]: Without dead ends: 11315 [2025-03-08 20:18:38,166 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 20:18:38,167 INFO L435 NwaCegarLoop]: 2130 mSDtfsCounter, 1457 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 3911 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:38,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 3911 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 20:18:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11315 states. [2025-03-08 20:18:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11315 to 11260. [2025-03-08 20:18:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11260 states, 6905 states have (on average 1.2073859522085446) internal successors, (8337), 7003 states have internal predecessors, (8337), 3576 states have call successors, (3576), 781 states have call predecessors, (3576), 776 states have return successors, (3613), 3547 states have call predecessors, (3613), 3573 states have call successors, (3613) [2025-03-08 20:18:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11260 states to 11260 states and 15526 transitions. [2025-03-08 20:18:38,798 INFO L78 Accepts]: Start accepts. Automaton has 11260 states and 15526 transitions. Word has length 141 [2025-03-08 20:18:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:38,799 INFO L471 AbstractCegarLoop]: Abstraction has 11260 states and 15526 transitions. [2025-03-08 20:18:38,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 20:18:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 11260 states and 15526 transitions. [2025-03-08 20:18:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 20:18:38,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:38,801 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 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] [2025-03-08 20:18:38,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 20:18:38,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:38,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1567099315, now seen corresponding path program 1 times [2025-03-08 20:18:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:38,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200291393] [2025-03-08 20:18:38,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:38,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:38,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 20:18:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 20:18:38,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:38,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-08 20:18:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200291393] [2025-03-08 20:18:39,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200291393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:39,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:39,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 20:18:39,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046118441] [2025-03-08 20:18:39,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:39,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 20:18:39,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:39,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 20:18:39,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:18:39,177 INFO L87 Difference]: Start difference. First operand 11260 states and 15526 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 20:18:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:39,754 INFO L93 Difference]: Finished difference Result 12236 states and 16630 transitions. [2025-03-08 20:18:39,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:18:39,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-08 20:18:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:39,818 INFO L225 Difference]: With dead ends: 12236 [2025-03-08 20:18:39,818 INFO L226 Difference]: Without dead ends: 12234 [2025-03-08 20:18:39,827 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 20:18:39,828 INFO L435 NwaCegarLoop]: 1833 mSDtfsCounter, 1597 mSDsluCounter, 3941 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 5774 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:39,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 5774 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:18:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12234 states. [2025-03-08 20:18:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12234 to 12232. [2025-03-08 20:18:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12232 states, 7474 states have (on average 1.1964142360181964) internal successors, (8942), 7572 states have internal predecessors, (8942), 3824 states have call successors, (3824), 936 states have call predecessors, (3824), 931 states have return successors, (3861), 3795 states have call predecessors, (3861), 3821 states have call successors, (3861) [2025-03-08 20:18:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12232 states to 12232 states and 16627 transitions. [2025-03-08 20:18:40,656 INFO L78 Accepts]: Start accepts. Automaton has 12232 states and 16627 transitions. Word has length 152 [2025-03-08 20:18:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:40,659 INFO L471 AbstractCegarLoop]: Abstraction has 12232 states and 16627 transitions. [2025-03-08 20:18:40,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 20:18:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 12232 states and 16627 transitions. [2025-03-08 20:18:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 20:18:40,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:40,662 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 20:18:40,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 20:18:40,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:40,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1419512399, now seen corresponding path program 1 times [2025-03-08 20:18:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:40,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524326257] [2025-03-08 20:18:40,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:40,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:40,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 20:18:40,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 20:18:40,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:40,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 20:18:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524326257] [2025-03-08 20:18:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524326257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:41,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:41,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:18:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205250496] [2025-03-08 20:18:41,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:41,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:18:41,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:41,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:18:41,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:18:41,043 INFO L87 Difference]: Start difference. First operand 12232 states and 16627 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 20:18:45,061 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 20:18:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:46,016 INFO L93 Difference]: Finished difference Result 26931 states and 36524 transitions. [2025-03-08 20:18:46,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:18:46,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 131 [2025-03-08 20:18:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:46,137 INFO L225 Difference]: With dead ends: 26931 [2025-03-08 20:18:46,137 INFO L226 Difference]: Without dead ends: 14748 [2025-03-08 20:18:46,204 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 20:18:46,209 INFO L435 NwaCegarLoop]: 2420 mSDtfsCounter, 687 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:46,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 4146 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 20:18:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14748 states. [2025-03-08 20:18:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14748 to 14700. [2025-03-08 20:18:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14700 states, 9186 states have (on average 1.2046592640975398) internal successors, (11066), 9332 states have internal predecessors, (11066), 4350 states have call successors, (4350), 1166 states have call predecessors, (4350), 1161 states have return successors, (4387), 4309 states have call predecessors, (4387), 4347 states have call successors, (4387) [2025-03-08 20:18:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14700 states to 14700 states and 19803 transitions. [2025-03-08 20:18:46,971 INFO L78 Accepts]: Start accepts. Automaton has 14700 states and 19803 transitions. Word has length 131 [2025-03-08 20:18:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:46,971 INFO L471 AbstractCegarLoop]: Abstraction has 14700 states and 19803 transitions. [2025-03-08 20:18:46,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 20:18:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 14700 states and 19803 transitions. [2025-03-08 20:18:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 20:18:46,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:46,973 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 20:18:46,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 20:18:46,974 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:46,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1111026034, now seen corresponding path program 1 times [2025-03-08 20:18:46,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:46,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131881954] [2025-03-08 20:18:46,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:46,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:47,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 20:18:47,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 20:18:47,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:47,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-08 20:18:47,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:47,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131881954] [2025-03-08 20:18:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131881954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 20:18:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778761870] [2025-03-08 20:18:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:47,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 20:18:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:47,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 20:18:47,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:18:47,364 INFO L87 Difference]: Start difference. First operand 14700 states and 19803 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 20:18:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:48,120 INFO L93 Difference]: Finished difference Result 14706 states and 19808 transitions. [2025-03-08 20:18:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:18:48,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2025-03-08 20:18:48,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:48,176 INFO L225 Difference]: With dead ends: 14706 [2025-03-08 20:18:48,176 INFO L226 Difference]: Without dead ends: 14702 [2025-03-08 20:18:48,181 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 20:18:48,182 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 1778 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 5389 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:48,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 5389 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:18:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14702 states. [2025-03-08 20:18:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14702 to 14702. [2025-03-08 20:18:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14702 states, 9188 states have (on average 1.2045058772311712) internal successors, (11067), 9333 states have internal predecessors, (11067), 4350 states have call successors, (4350), 1167 states have call predecessors, (4350), 1161 states have return successors, (4387), 4309 states have call predecessors, (4387), 4347 states have call successors, (4387) [2025-03-08 20:18:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 19804 transitions. [2025-03-08 20:18:48,891 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 19804 transitions. Word has length 139 [2025-03-08 20:18:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:48,892 INFO L471 AbstractCegarLoop]: Abstraction has 14702 states and 19804 transitions. [2025-03-08 20:18:48,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 20:18:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 19804 transitions. [2025-03-08 20:18:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 20:18:48,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:48,894 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 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] [2025-03-08 20:18:48,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 20:18:48,894 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:48,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 557438995, now seen corresponding path program 1 times [2025-03-08 20:18:48,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:48,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375196693] [2025-03-08 20:18:48,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:49,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 20:18:49,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 20:18:49,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:49,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-03-08 20:18:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375196693] [2025-03-08 20:18:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375196693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 20:18:49,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893654956] [2025-03-08 20:18:49,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:49,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 20:18:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:49,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 20:18:49,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 20:18:49,364 INFO L87 Difference]: Start difference. First operand 14702 states and 19804 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 20:18:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:50,270 INFO L93 Difference]: Finished difference Result 14702 states and 19804 transitions. [2025-03-08 20:18:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 20:18:50,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 162 [2025-03-08 20:18:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:50,352 INFO L225 Difference]: With dead ends: 14702 [2025-03-08 20:18:50,352 INFO L226 Difference]: Without dead ends: 14483 [2025-03-08 20:18:50,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 20:18:50,364 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 1763 mSDsluCounter, 3586 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 5385 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:50,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 5385 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 20:18:50,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14483 states. [2025-03-08 20:18:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14483 to 14483. [2025-03-08 20:18:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14483 states, 9050 states have (on average 1.2022099447513812) internal successors, (10880), 9171 states have internal predecessors, (10880), 4283 states have call successors, (4283), 1152 states have call predecessors, (4283), 1148 states have return successors, (4323), 4267 states have call predecessors, (4323), 4283 states have call successors, (4323) [2025-03-08 20:18:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 19486 transitions. [2025-03-08 20:18:51,223 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 19486 transitions. Word has length 162 [2025-03-08 20:18:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:51,224 INFO L471 AbstractCegarLoop]: Abstraction has 14483 states and 19486 transitions. [2025-03-08 20:18:51,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 20:18:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 19486 transitions. [2025-03-08 20:18:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 20:18:51,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:51,227 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:18:51,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 20:18:51,227 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:51,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1401453731, now seen corresponding path program 1 times [2025-03-08 20:18:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922490557] [2025-03-08 20:18:51,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:51,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 20:18:51,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 20:18:51,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:51,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-08 20:18:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922490557] [2025-03-08 20:18:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922490557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:51,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:51,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:18:51,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052887884] [2025-03-08 20:18:51,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:51,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:18:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:51,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:18:51,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:18:51,529 INFO L87 Difference]: Start difference. First operand 14483 states and 19486 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 20:18:55,543 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 20:18:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:18:56,340 INFO L93 Difference]: Finished difference Result 31305 states and 42063 transitions. [2025-03-08 20:18:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:18:56,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 203 [2025-03-08 20:18:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:18:56,419 INFO L225 Difference]: With dead ends: 31305 [2025-03-08 20:18:56,420 INFO L226 Difference]: Without dead ends: 16816 [2025-03-08 20:18:56,467 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 20:18:56,468 INFO L435 NwaCegarLoop]: 2386 mSDtfsCounter, 646 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 4089 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 20:18:56,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 4089 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 20:18:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16816 states. [2025-03-08 20:18:57,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16816 to 16808. [2025-03-08 20:18:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16808 states, 10655 states have (on average 1.207977475363679) internal successors, (12871), 10816 states have internal predecessors, (12871), 4786 states have call successors, (4786), 1369 states have call predecessors, (4786), 1365 states have return successors, (4826), 4766 states have call predecessors, (4826), 4786 states have call successors, (4826) [2025-03-08 20:18:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16808 states to 16808 states and 22483 transitions. [2025-03-08 20:18:57,367 INFO L78 Accepts]: Start accepts. Automaton has 16808 states and 22483 transitions. Word has length 203 [2025-03-08 20:18:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:18:57,368 INFO L471 AbstractCegarLoop]: Abstraction has 16808 states and 22483 transitions. [2025-03-08 20:18:57,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 20:18:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 16808 states and 22483 transitions. [2025-03-08 20:18:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 20:18:57,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:18:57,370 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:18:57,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 20:18:57,370 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:18:57,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:18:57,371 INFO L85 PathProgramCache]: Analyzing trace with hash 324027166, now seen corresponding path program 1 times [2025-03-08 20:18:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:18:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369031555] [2025-03-08 20:18:57,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:18:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:18:57,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 20:18:57,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 20:18:57,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:18:57,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:18:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-08 20:18:57,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:18:57,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369031555] [2025-03-08 20:18:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369031555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:18:57,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:18:57,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:18:57,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622362796] [2025-03-08 20:18:57,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:18:57,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:18:57,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:18:57,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:18:57,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:18:57,656 INFO L87 Difference]: Start difference. First operand 16808 states and 22483 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 20:19:01,673 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 20:19:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:19:02,589 INFO L93 Difference]: Finished difference Result 36991 states and 49288 transitions. [2025-03-08 20:19:02,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:19:02,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 203 [2025-03-08 20:19:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:19:02,672 INFO L225 Difference]: With dead ends: 36991 [2025-03-08 20:19:02,673 INFO L226 Difference]: Without dead ends: 20232 [2025-03-08 20:19:02,722 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 20:19:02,724 INFO L435 NwaCegarLoop]: 2490 mSDtfsCounter, 1478 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 20:19:02,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 3480 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 20:19:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20232 states. [2025-03-08 20:19:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20232 to 20224. [2025-03-08 20:19:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20224 states, 12891 states have (on average 1.2061127918702972) internal successors, (15548), 13090 states have internal predecessors, (15548), 5586 states have call successors, (5586), 1751 states have call predecessors, (5586), 1745 states have return successors, (5626), 5562 states have call predecessors, (5626), 5586 states have call successors, (5626) [2025-03-08 20:19:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20224 states to 20224 states and 26760 transitions. [2025-03-08 20:19:03,875 INFO L78 Accepts]: Start accepts. Automaton has 20224 states and 26760 transitions. Word has length 203 [2025-03-08 20:19:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:19:03,876 INFO L471 AbstractCegarLoop]: Abstraction has 20224 states and 26760 transitions. [2025-03-08 20:19:03,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 20:19:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 20224 states and 26760 transitions. [2025-03-08 20:19:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-08 20:19:03,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:19:03,880 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:19:03,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 20:19:03,880 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:19:03,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:19:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash 482119382, now seen corresponding path program 1 times [2025-03-08 20:19:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:19:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079363787] [2025-03-08 20:19:03,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:19:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:19:04,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-08 20:19:04,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-08 20:19:04,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:19:04,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:19:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-03-08 20:19:04,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:19:04,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079363787] [2025-03-08 20:19:04,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079363787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:19:04,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:19:04,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:19:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949486352] [2025-03-08 20:19:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:19:04,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:19:04,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:19:04,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:19:04,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:19:04,332 INFO L87 Difference]: Start difference. First operand 20224 states and 26760 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 20:19:08,348 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 20:19:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:19:10,223 INFO L93 Difference]: Finished difference Result 42885 states and 56736 transitions. [2025-03-08 20:19:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:19:10,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 273 [2025-03-08 20:19:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 20:19:10,357 INFO L225 Difference]: With dead ends: 42885 [2025-03-08 20:19:10,357 INFO L226 Difference]: Without dead ends: 22724 [2025-03-08 20:19:10,438 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 20:19:10,440 INFO L435 NwaCegarLoop]: 2130 mSDtfsCounter, 659 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 3835 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 20:19:10,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 3835 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 20:19:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22724 states. [2025-03-08 20:19:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22724 to 22716. [2025-03-08 20:19:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22716 states, 14635 states have (on average 1.209976084728391) internal successors, (17708), 14874 states have internal predecessors, (17708), 6104 states have call successors, (6104), 1981 states have call predecessors, (6104), 1975 states have return successors, (6144), 6076 states have call predecessors, (6144), 6104 states have call successors, (6144) [2025-03-08 20:19:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22716 states to 22716 states and 29956 transitions. [2025-03-08 20:19:11,721 INFO L78 Accepts]: Start accepts. Automaton has 22716 states and 29956 transitions. Word has length 273 [2025-03-08 20:19:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 20:19:11,722 INFO L471 AbstractCegarLoop]: Abstraction has 22716 states and 29956 transitions. [2025-03-08 20:19:11,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 20:19:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 22716 states and 29956 transitions. [2025-03-08 20:19:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-08 20:19:11,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 20:19:11,725 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:19:11,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 20:19:11,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 20:19:11,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 20:19:11,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1243361515, now seen corresponding path program 1 times [2025-03-08 20:19:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 20:19:11,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331246593] [2025-03-08 20:19:11,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 20:19:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 20:19:11,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-08 20:19:11,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-08 20:19:11,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 20:19:11,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 20:19:12,195 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-03-08 20:19:12,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 20:19:12,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331246593] [2025-03-08 20:19:12,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331246593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 20:19:12,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 20:19:12,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 20:19:12,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827645762] [2025-03-08 20:19:12,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 20:19:12,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 20:19:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 20:19:12,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 20:19:12,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 20:19:12,196 INFO L87 Difference]: Start difference. First operand 22716 states and 29956 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-08 20:19:16,218 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 20:19:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 20:19:17,270 INFO L93 Difference]: Finished difference Result 47773 states and 63008 transitions. [2025-03-08 20:19:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 20:19:17,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 273 [2025-03-08 20:19:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted.