./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-net-wireless-cw1200-cw1200_wlan_spi.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-net-wireless-cw1200-cw1200_wlan_spi.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 737f509bd25a9e06ce0273f44396be18568d5a5ccd53141342830e40e0488456 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 09:30:18,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 09:30:18,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 09:30:18,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 09:30:18,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 09:30:18,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 09:30:18,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 09:30:18,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 09:30:18,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 09:30:18,123 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 09:30:18,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 09:30:18,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 09:30:18,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 09:30:18,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 09:30:18,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 09:30:18,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 09:30:18,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 09:30:18,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 09:30:18,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 09:30:18,125 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 -> 737f509bd25a9e06ce0273f44396be18568d5a5ccd53141342830e40e0488456 [2025-03-17 09:30:18,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 09:30:18,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 09:30:18,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 09:30:18,401 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 09:30:18,401 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 09:30:18,403 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-net-wireless-cw1200-cw1200_wlan_spi.cil.i [2025-03-17 09:30:19,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df363959/0335c26f0750486498d369b9f8f96c57/FLAG85d7e1c91 [2025-03-17 09:30:20,136 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 09:30:20,138 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-net-wireless-cw1200-cw1200_wlan_spi.cil.i [2025-03-17 09:30:20,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df363959/0335c26f0750486498d369b9f8f96c57/FLAG85d7e1c91 [2025-03-17 09:30:20,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df363959/0335c26f0750486498d369b9f8f96c57 [2025-03-17 09:30:20,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 09:30:20,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 09:30:20,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 09:30:20,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 09:30:20,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 09:30:20,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 09:30:20" (1/1) ... [2025-03-17 09:30:20,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4356da5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:20, skipping insertion in model container [2025-03-17 09:30:20,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 09:30:20" (1/1) ... [2025-03-17 09:30:20,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 09:30:22,608 WARN L250 ndardFunctionHandler]: Function 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-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292189,292202] [2025-03-17 09:30:22,615 WARN L250 ndardFunctionHandler]: Function 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-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292358,292371] [2025-03-17 09:30:22,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292525,292538] [2025-03-17 09:30:22,623 WARN L250 ndardFunctionHandler]: Function 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-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292693,292706] [2025-03-17 09:30:22,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 09:30:22,647 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 09:30:22,751 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [6219] [2025-03-17 09:30:22,753 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [6222] [2025-03-17 09:30:22,753 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [6225] [2025-03-17 09:30:22,753 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [6228] [2025-03-17 09:30:22,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %b0, %1\n": "+q" (__ret), "+m" (tmp___0->state): : "memory", "cc"); [6657-6658] [2025-03-17 09:30:22,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %w0, %1\n": "+r" (__ret), "+m" (tmp___1->state): : "memory", "cc"); [6664-6665] [2025-03-17 09:30:22,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0, %1\n": "+r" (__ret), "+m" (tmp___2->state): : "memory", "cc"); [6671-6672] [2025-03-17 09:30:22,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %q0, %1\n": "+r" (__ret), "+m" (tmp___3->state): : "memory", "cc"); [6678-6679] [2025-03-17 09:30:22,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %b0, %1\n": "+q" (__ret___0), "+m" (tmp___4->state): : "memory", "cc"); [6722-6723] [2025-03-17 09:30:22,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %w0, %1\n": "+r" (__ret___0), "+m" (tmp___5->state): : "memory", "cc"); [6729-6730] [2025-03-17 09:30:22,810 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0, %1\n": "+r" (__ret___0), "+m" (tmp___6->state): : "memory", "cc"); [6736-6737] [2025-03-17 09:30:22,810 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %q0, %1\n": "+r" (__ret___0), "+m" (tmp___7->state): : "memory", "cc"); [6743-6744] [2025-03-17 09:30:22,880 WARN L250 ndardFunctionHandler]: Function 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-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292189,292202] [2025-03-17 09:30:22,880 WARN L250 ndardFunctionHandler]: Function 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-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292358,292371] [2025-03-17 09:30:22,881 WARN L250 ndardFunctionHandler]: Function 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-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292525,292538] [2025-03-17 09:30:22,881 WARN L250 ndardFunctionHandler]: Function 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-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292693,292706] [2025-03-17 09:30:22,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 09:30:22,974 INFO L204 MainTranslator]: Completed translation [2025-03-17 09:30:22,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22 WrapperNode [2025-03-17 09:30:22,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 09:30:22,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 09:30:22,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 09:30:22,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 09:30:22,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,132 INFO L138 Inliner]: procedures = 327, calls = 936, calls flagged for inlining = 153, calls inlined = 140, statements flattened = 2787 [2025-03-17 09:30:23,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 09:30:23,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 09:30:23,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 09:30:23,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 09:30:23,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,482 INFO L175 MemorySlicer]: Split 272 memory accesses to 11 slices as follows [25, 52, 2, 14, 6, 5, 1, 2, 2, 158, 5]. 58 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [0, 0, 0, 0, 6, 0, 1, 2, 1, 0, 0]. The 123 writes are split as follows [23, 52, 1, 12, 0, 5, 0, 0, 0, 26, 4]. [2025-03-17 09:30:23,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 09:30:23,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 09:30:23,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 09:30:23,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 09:30:23,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (1/1) ... [2025-03-17 09:30:23,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 09:30:23,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 09:30:23,623 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-17 09:30:23,628 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-17 09:30:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-03-17 09:30:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-03-17 09:30:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-03-17 09:30:23,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-03-17 09:30:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 09:30:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 09:30:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 09:30:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 09:30:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_request [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_request [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure spi_sync [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_sync [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_irq_unsubscribe [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_irq_unsubscribe [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~bool~0~TO~int [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~bool~0~TO~int [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_unlock [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_unlock [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 09:30:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 09:30:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_66 [2025-03-17 09:30:23,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_66 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_platdata [2025-03-17 09:30:23,644 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_platdata [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-17 09:30:23,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-17 09:30:23,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_hwbus_priv [2025-03-17 09:30:23,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_hwbus_priv [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 09:30:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 09:30:23,646 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_add_tail [2025-03-17 09:30:23,646 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_add_tail [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-17 09:30:23,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-17 09:30:23,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2025-03-17 09:30:23,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 09:30:23,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_probe [2025-03-17 09:30:23,646 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_probe [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 09:30:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-17 09:30:23,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-03-17 09:30:23,647 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2025-03-17 09:30:23,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 09:30:23,647 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 09:30:23,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 09:30:23,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 09:30:23,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 09:30:23,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 09:30:23,648 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_disconnect [2025-03-17 09:30:23,648 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_disconnect [2025-03-17 09:30:23,648 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2025-03-17 09:30:23,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2025-03-17 09:30:23,648 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 09:30:23,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 09:30:23,648 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_set_value [2025-03-17 09:30:23,648 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_set_value [2025-03-17 09:30:23,648 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_direction_output [2025-03-17 09:30:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_direction_output [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-03-17 09:30:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_off [2025-03-17 09:30:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_off [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2025-03-17 09:30:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_0 [2025-03-17 09:30:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_0 [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_3 [2025-03-17 09:30:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_3 [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-17 09:30:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 09:30:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_init [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_init [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure spi_get_drvdata [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_get_drvdata [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_lock [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_lock [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_resume [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_resume [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_EMGentry_exit_spi_driver_exit_9_2 [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_EMGentry_exit_spi_driver_exit_9_2 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_pm [2025-03-17 09:30:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_pm [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 09:30:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2025-03-17 09:30:23,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2025-03-17 09:30:23,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 09:30:23,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 09:30:24,160 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 09:30:24,163 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 09:30:24,206 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 09:30:24,228 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11309: havoc #t~nondet518; [2025-03-17 09:30:24,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11298: havoc #t~nondet515; [2025-03-17 09:30:24,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11359: havoc #t~nondet523; [2025-03-17 09:30:24,356 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6870: call ULTIMATE.dealloc(~#descriptor~1#1.base, ~#descriptor~1#1.offset);havoc ~#descriptor~1#1.base, ~#descriptor~1#1.offset; [2025-03-17 09:30:24,408 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11247: havoc #t~nondet512; [2025-03-17 09:30:24,426 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11301: havoc gpio_to_desc_#t~ret516#1.base, gpio_to_desc_#t~ret516#1.offset; [2025-03-17 09:30:24,426 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11305: havoc gpiod_direction_output_#t~nondet517#1; [2025-03-17 09:30:24,503 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6293: havoc #t~mem38.base, #t~mem38.offset; [2025-03-17 09:30:24,561 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9475: havoc ldv_dev_get_drvdata_#t~mem414#1.base, ldv_dev_get_drvdata_#t~mem414#1.offset;havoc ldv_dev_get_drvdata_#t~mem415#1.base, ldv_dev_get_drvdata_#t~mem415#1.offset; [2025-03-17 09:30:24,579 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11337: havoc #t~nondet519; [2025-03-17 09:30:24,627 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6610: call ULTIMATE.dealloc(~#wait~0#1.base, ~#wait~0#1.offset);havoc ~#wait~0#1.base, ~#wait~0#1.offset; [2025-03-17 09:30:24,673 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6188: havoc #t~bitwise4; [2025-03-17 09:30:35,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6444: call ULTIMATE.dealloc(cw1200_spi_memcpy_fromio_~#regaddr~0#1.base, cw1200_spi_memcpy_fromio_~#regaddr~0#1.offset);havoc cw1200_spi_memcpy_fromio_~#regaddr~0#1.base, cw1200_spi_memcpy_fromio_~#regaddr~0#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_fromio_~#m~0#1.base, cw1200_spi_memcpy_fromio_~#m~0#1.offset);havoc cw1200_spi_memcpy_fromio_~#m~0#1.base, cw1200_spi_memcpy_fromio_~#m~0#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_fromio_~#t_addr~0#1.base, cw1200_spi_memcpy_fromio_~#t_addr~0#1.offset);havoc cw1200_spi_memcpy_fromio_~#t_addr~0#1.base, cw1200_spi_memcpy_fromio_~#t_addr~0#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_fromio_~#t_msg~0#1.base, cw1200_spi_memcpy_fromio_~#t_msg~0#1.offset);havoc cw1200_spi_memcpy_fromio_~#t_msg~0#1.base, cw1200_spi_memcpy_fromio_~#t_msg~0#1.offset; [2025-03-17 09:30:35,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9457-1: ldv_spi_register_driver_74_#res#1 := ldv_spi_register_driver_74_~ldv_func_res~1#1; [2025-03-17 09:30:35,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11275: havoc cw1200_can_suspend_#t~nondet513#1; [2025-03-17 09:30:35,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6520: call ULTIMATE.dealloc(cw1200_spi_memcpy_toio_~#regaddr~1#1.base, cw1200_spi_memcpy_toio_~#regaddr~1#1.offset);havoc cw1200_spi_memcpy_toio_~#regaddr~1#1.base, cw1200_spi_memcpy_toio_~#regaddr~1#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_toio_~#t_addr~1#1.base, cw1200_spi_memcpy_toio_~#t_addr~1#1.offset);havoc cw1200_spi_memcpy_toio_~#t_addr~1#1.base, cw1200_spi_memcpy_toio_~#t_addr~1#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_toio_~#t_msg~1#1.base, cw1200_spi_memcpy_toio_~#t_msg~1#1.offset);havoc cw1200_spi_memcpy_toio_~#t_msg~1#1.base, cw1200_spi_memcpy_toio_~#t_msg~1#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_toio_~#m~1#1.base, cw1200_spi_memcpy_toio_~#m~1#1.offset);havoc cw1200_spi_memcpy_toio_~#m~1#1.base, cw1200_spi_memcpy_toio_~#m~1#1.offset; [2025-03-17 09:30:35,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11351: havoc spi_register_driver_#t~nondet521#1; [2025-03-17 09:30:35,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8907-1: ldv_spi_register_driver_#res#1 := ldv_spi_register_driver_~arg0#1; [2025-03-17 09:30:35,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-03-17 09:30:35,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8025: call ULTIMATE.dealloc(ldv_io_instance_callback_0_17_~#arg2#1.base, ldv_io_instance_callback_0_17_~#arg2#1.offset);havoc ldv_io_instance_callback_0_17_~#arg2#1.base, ldv_io_instance_callback_0_17_~#arg2#1.offset; [2025-03-17 09:30:35,787 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret526#1 := main_#res#1;havoc main_#t~ret266#1, main_~tmp~19#1;assume { :end_inline_main } true; [2025-03-17 09:30:35,967 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7024: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset;call ULTIMATE.dealloc(~#__key___0~0#1.base, ~#__key___0~0#1.offset);havoc ~#__key___0~0#1.base, ~#__key___0~0#1.offset; [2025-03-17 09:30:35,968 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8882-1: ldv_request_threaded_irq_#res#1 := ldv_request_threaded_irq_~arg0#1; [2025-03-17 09:30:35,968 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11344: havoc request_threaded_irq_#t~nondet520#1; [2025-03-17 09:30:35,968 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6795: call ULTIMATE.dealloc(cw1200_spi_irq_subscribe_~#descriptor~0#1.base, cw1200_spi_irq_subscribe_~#descriptor~0#1.offset);havoc cw1200_spi_irq_subscribe_~#descriptor~0#1.base, cw1200_spi_irq_subscribe_~#descriptor~0#1.offset; [2025-03-17 09:30:35,968 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11279: havoc cw1200_core_probe_#t~nondet514#1; [2025-03-17 09:30:35,968 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9422-1: ldv_request_threaded_irq_71_#res#1 := ldv_request_threaded_irq_71_~ldv_func_res~0#1; [2025-03-17 09:30:35,968 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11355: havoc spi_setup_#t~nondet522#1; [2025-03-17 09:30:36,362 INFO L? ?]: Removed 921 outVars from TransFormulas that were not future-live. [2025-03-17 09:30:36,362 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 09:30:36,405 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 09:30:36,405 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 09:30:36,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 09:30:36 BoogieIcfgContainer [2025-03-17 09:30:36,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 09:30:36,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 09:30:36,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 09:30:36,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 09:30:36,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 09:30:20" (1/3) ... [2025-03-17 09:30:36,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12eded31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 09:30:36, skipping insertion in model container [2025-03-17 09:30:36,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 09:30:22" (2/3) ... [2025-03-17 09:30:36,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12eded31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 09:30:36, skipping insertion in model container [2025-03-17 09:30:36,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 09:30:36" (3/3) ... [2025-03-17 09:30:36,415 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i [2025-03-17 09:30:36,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 09:30:36,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i that has 54 procedures, 987 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-03-17 09:30:36,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 09:30:36,519 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;@68b35115, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 09:30:36,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-17 09:30:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 985 states, 674 states have (on average 1.324925816023739) internal successors, (893), 688 states have internal predecessors, (893), 256 states have call successors, (256), 53 states have call predecessors, (256), 52 states have return successors, (247), 246 states have call predecessors, (247), 247 states have call successors, (247) [2025-03-17 09:30:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 09:30:36,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:30:36,549 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 09:30:36,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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-17 09:30:36,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:30:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1537571976, now seen corresponding path program 1 times [2025-03-17 09:30:36,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:30:36,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68966632] [2025-03-17 09:30:36,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:30:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:30:36,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 09:30:36,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 09:30:36,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:30:36,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:30:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-17 09:30:37,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:30:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68966632] [2025-03-17 09:30:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68966632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:30:37,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:30:37,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 09:30:37,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723861037] [2025-03-17 09:30:37,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:30:37,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 09:30:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:30:37,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 09:30:37,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 09:30:37,332 INFO L87 Difference]: Start difference. First operand has 985 states, 674 states have (on average 1.324925816023739) internal successors, (893), 688 states have internal predecessors, (893), 256 states have call successors, (256), 53 states have call predecessors, (256), 52 states have return successors, (247), 246 states have call predecessors, (247), 247 states have call successors, (247) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 09:30:40,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 09:30:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:30:40,800 INFO L93 Difference]: Finished difference Result 2694 states and 3889 transitions. [2025-03-17 09:30:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 09:30:40,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 147 [2025-03-17 09:30:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:30:40,833 INFO L225 Difference]: With dead ends: 2694 [2025-03-17 09:30:40,833 INFO L226 Difference]: Without dead ends: 1716 [2025-03-17 09:30:40,843 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-17 09:30:40,849 INFO L435 NwaCegarLoop]: 1428 mSDtfsCounter, 1052 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-17 09:30:40,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 2678 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-17 09:30:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2025-03-17 09:30:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1689. [2025-03-17 09:30:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1171 states have (on average 1.28266438941076) internal successors, (1502), 1198 states have internal predecessors, (1502), 418 states have call successors, (418), 98 states have call predecessors, (418), 97 states have return successors, (414), 408 states have call predecessors, (414), 414 states have call successors, (414) [2025-03-17 09:30:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2334 transitions. [2025-03-17 09:30:41,048 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2334 transitions. Word has length 147 [2025-03-17 09:30:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:30:41,052 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2334 transitions. [2025-03-17 09:30:41,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 09:30:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2334 transitions. [2025-03-17 09:30:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 09:30:41,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:30:41,058 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 09:30:41,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 09:30:41,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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-17 09:30:41,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:30:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1872030306, now seen corresponding path program 1 times [2025-03-17 09:30:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:30:41,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847740253] [2025-03-17 09:30:41,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:30:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:30:41,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 09:30:41,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 09:30:41,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:30:41,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:30:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-17 09:30:41,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:30:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847740253] [2025-03-17 09:30:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847740253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:30:41,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:30:41,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 09:30:41,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461035058] [2025-03-17 09:30:41,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:30:41,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 09:30:41,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:30:41,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 09:30:41,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 09:30:41,391 INFO L87 Difference]: Start difference. First operand 1689 states and 2334 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-17 09:30:44,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 09:30:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:30:44,734 INFO L93 Difference]: Finished difference Result 4910 states and 6769 transitions. [2025-03-17 09:30:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 09:30:44,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 147 [2025-03-17 09:30:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:30:44,766 INFO L225 Difference]: With dead ends: 4910 [2025-03-17 09:30:44,766 INFO L226 Difference]: Without dead ends: 3244 [2025-03-17 09:30:44,774 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-17 09:30:44,775 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 1199 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 09:30:44,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 2601 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 09:30:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2025-03-17 09:30:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 3240. [2025-03-17 09:30:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 2274 states have (on average 1.2792436235708005) internal successors, (2909), 2320 states have internal predecessors, (2909), 772 states have call successors, (772), 192 states have call predecessors, (772), 191 states have return successors, (768), 759 states have call predecessors, (768), 768 states have call successors, (768) [2025-03-17 09:30:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 4449 transitions. [2025-03-17 09:30:44,989 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 4449 transitions. Word has length 147 [2025-03-17 09:30:44,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:30:44,989 INFO L471 AbstractCegarLoop]: Abstraction has 3240 states and 4449 transitions. [2025-03-17 09:30:44,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-17 09:30:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4449 transitions. [2025-03-17 09:30:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 09:30:44,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:30:44,992 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 09:30:44,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 09:30:44,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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-17 09:30:44,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:30:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1157386674, now seen corresponding path program 1 times [2025-03-17 09:30:44,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:30:44,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401951757] [2025-03-17 09:30:44,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:30:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:30:45,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 09:30:45,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 09:30:45,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:30:45,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:30:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-17 09:30:45,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:30:45,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401951757] [2025-03-17 09:30:45,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401951757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:30:45,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:30:45,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 09:30:45,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222859280] [2025-03-17 09:30:45,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:30:45,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 09:30:45,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:30:45,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 09:30:45,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 09:30:45,186 INFO L87 Difference]: Start difference. First operand 3240 states and 4449 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 09:30:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:30:45,894 INFO L93 Difference]: Finished difference Result 7703 states and 10552 transitions. [2025-03-17 09:30:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 09:30:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2025-03-17 09:30:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:30:45,920 INFO L225 Difference]: With dead ends: 7703 [2025-03-17 09:30:45,920 INFO L226 Difference]: Without dead ends: 4486 [2025-03-17 09:30:45,929 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-17 09:30:45,930 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 1113 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 2618 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 09:30:45,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 2618 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 09:30:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2025-03-17 09:30:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4457. [2025-03-17 09:30:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4457 states, 3103 states have (on average 1.2684498872059298) internal successors, (3936), 3178 states have internal predecessors, (3936), 1074 states have call successors, (1074), 278 states have call predecessors, (1074), 277 states have return successors, (1070), 1048 states have call predecessors, (1070), 1070 states have call successors, (1070) [2025-03-17 09:30:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 6080 transitions. [2025-03-17 09:30:46,184 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 6080 transitions. Word has length 153 [2025-03-17 09:30:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:30:46,186 INFO L471 AbstractCegarLoop]: Abstraction has 4457 states and 6080 transitions. [2025-03-17 09:30:46,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 09:30:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 6080 transitions. [2025-03-17 09:30:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 09:30:46,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:30:46,189 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 09:30:46,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 09:30:46,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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-17 09:30:46,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:30:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1255827195, now seen corresponding path program 1 times [2025-03-17 09:30:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:30:46,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206056398] [2025-03-17 09:30:46,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:30:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:30:46,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 09:30:46,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 09:30:46,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:30:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:30:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-17 09:30:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:30:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206056398] [2025-03-17 09:30:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206056398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:30:46,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:30:46,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 09:30:46,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173806284] [2025-03-17 09:30:46,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:30:46,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 09:30:46,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:30:46,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 09:30:46,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 09:30:46,433 INFO L87 Difference]: Start difference. First operand 4457 states and 6080 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 09:30:50,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 09:30:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:30:50,595 INFO L93 Difference]: Finished difference Result 12993 states and 17950 transitions. [2025-03-17 09:30:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 09:30:50,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 157 [2025-03-17 09:30:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:30:50,655 INFO L225 Difference]: With dead ends: 12993 [2025-03-17 09:30:50,655 INFO L226 Difference]: Without dead ends: 8559 [2025-03-17 09:30:50,678 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-17 09:30:50,679 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 1284 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-17 09:30:50,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 2634 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-17 09:30:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8559 states. [2025-03-17 09:30:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8559 to 8522. [2025-03-17 09:30:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8522 states, 5958 states have (on average 1.270392749244713) internal successors, (7569), 6118 states have internal predecessors, (7569), 2042 states have call successors, (2042), 532 states have call predecessors, (2042), 519 states have return successors, (2224), 1955 states have call predecessors, (2224), 2038 states have call successors, (2224) [2025-03-17 09:30:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8522 states to 8522 states and 11835 transitions. [2025-03-17 09:30:51,114 INFO L78 Accepts]: Start accepts. Automaton has 8522 states and 11835 transitions. Word has length 157 [2025-03-17 09:30:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:30:51,115 INFO L471 AbstractCegarLoop]: Abstraction has 8522 states and 11835 transitions. [2025-03-17 09:30:51,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 09:30:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 8522 states and 11835 transitions. [2025-03-17 09:30:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 09:30:51,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:30:51,118 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 11, 11, 11, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 09:30:51,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 09:30:51,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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-17 09:30:51,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:30:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1148816367, now seen corresponding path program 1 times [2025-03-17 09:30:51,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:30:51,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027496814] [2025-03-17 09:30:51,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:30:51,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:30:51,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 09:30:51,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 09:30:51,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:30:51,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:30:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2025-03-17 09:30:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:30:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027496814] [2025-03-17 09:30:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027496814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:30:51,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:30:51,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 09:30:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582322310] [2025-03-17 09:30:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:30:51,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 09:30:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:30:51,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 09:30:51,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 09:30:51,369 INFO L87 Difference]: Start difference. First operand 8522 states and 11835 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 09:30:52,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 09:30:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:30:53,275 INFO L93 Difference]: Finished difference Result 21030 states and 29076 transitions. [2025-03-17 09:30:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 09:30:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 169 [2025-03-17 09:30:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:30:53,371 INFO L225 Difference]: With dead ends: 21030 [2025-03-17 09:30:53,371 INFO L226 Difference]: Without dead ends: 12531 [2025-03-17 09:30:53,407 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-17 09:30:53,409 INFO L435 NwaCegarLoop]: 1594 mSDtfsCounter, 1188 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 09:30:53,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 2870 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 09:30:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2025-03-17 09:30:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12490. [2025-03-17 09:30:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12490 states, 8743 states have (on average 1.2587212627244653) internal successors, (11005), 9003 states have internal predecessors, (11005), 2948 states have call successors, (2948), 815 states have call predecessors, (2948), 796 states have return successors, (3173), 2797 states have call predecessors, (3173), 2944 states have call successors, (3173) [2025-03-17 09:30:53,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12490 states to 12490 states and 17126 transitions. [2025-03-17 09:30:53,951 INFO L78 Accepts]: Start accepts. Automaton has 12490 states and 17126 transitions. Word has length 169 [2025-03-17 09:30:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:30:53,951 INFO L471 AbstractCegarLoop]: Abstraction has 12490 states and 17126 transitions. [2025-03-17 09:30:53,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-17 09:30:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 12490 states and 17126 transitions. [2025-03-17 09:30:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 09:30:53,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:30:53,956 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 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] [2025-03-17 09:30:53,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 09:30:53,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-17 09:30:53,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:30:53,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1321754522, now seen corresponding path program 1 times [2025-03-17 09:30:53,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:30:53,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288172999] [2025-03-17 09:30:53,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:30:53,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:30:54,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 09:30:54,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 09:30:54,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:30:54,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:30:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-03-17 09:30:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:30:54,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288172999] [2025-03-17 09:30:54,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288172999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:30:54,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:30:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 09:30:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575874870] [2025-03-17 09:30:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:30:54,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 09:30:54,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:30:54,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 09:30:54,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 09:30:54,144 INFO L87 Difference]: Start difference. First operand 12490 states and 17126 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-17 09:30:55,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 09:30:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:30:55,858 INFO L93 Difference]: Finished difference Result 34671 states and 47657 transitions. [2025-03-17 09:30:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 09:30:55,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 202 [2025-03-17 09:30:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:30:55,990 INFO L225 Difference]: With dead ends: 34671 [2025-03-17 09:30:55,990 INFO L226 Difference]: Without dead ends: 23122 [2025-03-17 09:30:56,046 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-17 09:30:56,048 INFO L435 NwaCegarLoop]: 2491 mSDtfsCounter, 1177 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 3779 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 09:30:56,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 3779 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 09:30:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23122 states. [2025-03-17 09:30:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23122 to 23118. [2025-03-17 09:30:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23118 states, 16307 states have (on average 1.2570675170172319) internal successors, (20499), 16727 states have internal predecessors, (20499), 5344 states have call successors, (5344), 1499 states have call predecessors, (5344), 1464 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-03-17 09:30:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23118 states to 23118 states and 31638 transitions. [2025-03-17 09:30:56,946 INFO L78 Accepts]: Start accepts. Automaton has 23118 states and 31638 transitions. Word has length 202 [2025-03-17 09:30:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:30:56,946 INFO L471 AbstractCegarLoop]: Abstraction has 23118 states and 31638 transitions. [2025-03-17 09:30:56,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-17 09:30:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 23118 states and 31638 transitions. [2025-03-17 09:30:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 09:30:56,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:30:56,950 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 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] [2025-03-17 09:30:56,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 09:30:56,950 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-17 09:30:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:30:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2011598757, now seen corresponding path program 1 times [2025-03-17 09:30:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:30:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602365469] [2025-03-17 09:30:56,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:30:56,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:30:57,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 09:30:57,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 09:30:57,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:30:57,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:30:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2025-03-17 09:30:57,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:30:57,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602365469] [2025-03-17 09:30:57,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602365469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:30:57,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:30:57,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:30:57,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283618753] [2025-03-17 09:30:57,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:30:57,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:30:57,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:30:57,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:30:57,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:30:57,444 INFO L87 Difference]: Start difference. First operand 23118 states and 31638 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 09:30:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:30:58,021 INFO L93 Difference]: Finished difference Result 23124 states and 31643 transitions. [2025-03-17 09:30:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 09:30:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 202 [2025-03-17 09:30:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:30:58,133 INFO L225 Difference]: With dead ends: 23124 [2025-03-17 09:30:58,133 INFO L226 Difference]: Without dead ends: 23122 [2025-03-17 09:30:58,146 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-17 09:30:58,147 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 1275 mSDsluCounter, 2623 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 3941 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 09:30:58,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 3941 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 09:30:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23122 states. [2025-03-17 09:30:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23122 to 23122. [2025-03-17 09:30:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23122 states, 16310 states have (on average 1.2570202329858982) internal successors, (20502), 16730 states have internal predecessors, (20502), 5344 states have call successors, (5344), 1500 states have call predecessors, (5344), 1465 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-03-17 09:30:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23122 states to 23122 states and 31641 transitions. [2025-03-17 09:30:59,309 INFO L78 Accepts]: Start accepts. Automaton has 23122 states and 31641 transitions. Word has length 202 [2025-03-17 09:30:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:30:59,310 INFO L471 AbstractCegarLoop]: Abstraction has 23122 states and 31641 transitions. [2025-03-17 09:30:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 09:30:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 23122 states and 31641 transitions. [2025-03-17 09:30:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 09:30:59,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:30:59,315 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 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] [2025-03-17 09:30:59,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 09:30:59,315 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-17 09:30:59,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:30:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash -236017833, now seen corresponding path program 1 times [2025-03-17 09:30:59,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:30:59,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428965515] [2025-03-17 09:30:59,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:30:59,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:30:59,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 09:30:59,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 09:30:59,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:30:59,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:30:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2025-03-17 09:30:59,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:30:59,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428965515] [2025-03-17 09:30:59,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428965515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:30:59,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:30:59,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:30:59,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262813509] [2025-03-17 09:30:59,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:30:59,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:30:59,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:30:59,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:30:59,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:30:59,746 INFO L87 Difference]: Start difference. First operand 23122 states and 31641 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-17 09:31:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:31:00,549 INFO L93 Difference]: Finished difference Result 23128 states and 31646 transitions. [2025-03-17 09:31:00,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 09:31:00,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 207 [2025-03-17 09:31:00,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:31:00,667 INFO L225 Difference]: With dead ends: 23128 [2025-03-17 09:31:00,667 INFO L226 Difference]: Without dead ends: 23126 [2025-03-17 09:31:00,683 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-17 09:31:00,685 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 1271 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 09:31:00,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 3945 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 09:31:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23126 states. [2025-03-17 09:31:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23126 to 23126. [2025-03-17 09:31:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23126 states, 16313 states have (on average 1.256972966345859) internal successors, (20505), 16733 states have internal predecessors, (20505), 5344 states have call successors, (5344), 1501 states have call predecessors, (5344), 1466 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-03-17 09:31:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23126 states to 23126 states and 31644 transitions. [2025-03-17 09:31:01,588 INFO L78 Accepts]: Start accepts. Automaton has 23126 states and 31644 transitions. Word has length 207 [2025-03-17 09:31:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:31:01,588 INFO L471 AbstractCegarLoop]: Abstraction has 23126 states and 31644 transitions. [2025-03-17 09:31:01,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-17 09:31:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 23126 states and 31644 transitions. [2025-03-17 09:31:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-17 09:31:01,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:31:01,595 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 09:31:01,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 09:31:01,595 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-17 09:31:01,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:31:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash 953374235, now seen corresponding path program 1 times [2025-03-17 09:31:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:31:01,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166060560] [2025-03-17 09:31:01,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:31:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:31:01,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 09:31:01,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 09:31:01,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:31:01,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:31:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-03-17 09:31:02,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:31:02,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166060560] [2025-03-17 09:31:02,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166060560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:31:02,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:31:02,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:31:02,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191702219] [2025-03-17 09:31:02,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:31:02,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:31:02,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:31:02,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:31:02,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:31:02,058 INFO L87 Difference]: Start difference. First operand 23126 states and 31644 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 09:31:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:31:02,883 INFO L93 Difference]: Finished difference Result 23132 states and 31649 transitions. [2025-03-17 09:31:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 09:31:02,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 212 [2025-03-17 09:31:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:31:03,018 INFO L225 Difference]: With dead ends: 23132 [2025-03-17 09:31:03,019 INFO L226 Difference]: Without dead ends: 23130 [2025-03-17 09:31:03,034 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-17 09:31:03,035 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 1270 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 09:31:03,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 3945 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 09:31:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23130 states. [2025-03-17 09:31:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23130 to 23130. [2025-03-17 09:31:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23130 states, 16316 states have (on average 1.2569257170875214) internal successors, (20508), 16736 states have internal predecessors, (20508), 5344 states have call successors, (5344), 1502 states have call predecessors, (5344), 1467 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-03-17 09:31:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23130 states to 23130 states and 31647 transitions. [2025-03-17 09:31:04,510 INFO L78 Accepts]: Start accepts. Automaton has 23130 states and 31647 transitions. Word has length 212 [2025-03-17 09:31:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:31:04,511 INFO L471 AbstractCegarLoop]: Abstraction has 23130 states and 31647 transitions. [2025-03-17 09:31:04,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 09:31:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 23130 states and 31647 transitions. [2025-03-17 09:31:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-17 09:31:04,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:31:04,519 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 09:31:04,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 09:31:04,519 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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-17 09:31:04,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:31:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash -925826895, now seen corresponding path program 1 times [2025-03-17 09:31:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:31:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055352034] [2025-03-17 09:31:04,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:31:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:31:04,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-17 09:31:04,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-17 09:31:04,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:31:04,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:31:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-03-17 09:31:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:31:04,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055352034] [2025-03-17 09:31:04,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055352034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:31:04,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:31:04,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 09:31:04,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839851871] [2025-03-17 09:31:04,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:31:04,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 09:31:04,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:31:04,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 09:31:04,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 09:31:04,781 INFO L87 Difference]: Start difference. First operand 23130 states and 31647 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-17 09:31:05,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 09:31:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:31:07,716 INFO L93 Difference]: Finished difference Result 55997 states and 76768 transitions. [2025-03-17 09:31:07,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 09:31:07,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 223 [2025-03-17 09:31:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:31:07,946 INFO L225 Difference]: With dead ends: 55997 [2025-03-17 09:31:07,946 INFO L226 Difference]: Without dead ends: 33808 [2025-03-17 09:31:08,045 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-17 09:31:08,046 INFO L435 NwaCegarLoop]: 2492 mSDtfsCounter, 1210 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 09:31:08,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 3782 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 09:31:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33808 states. [2025-03-17 09:31:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33808 to 33774. [2025-03-17 09:31:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33774 states, 23896 states have (on average 1.256193505189153) internal successors, (30018), 24476 states have internal predecessors, (30018), 7740 states have call successors, (7740), 2186 states have call predecessors, (7740), 2135 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-03-17 09:31:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33774 states to 33774 states and 46175 transitions. [2025-03-17 09:31:09,401 INFO L78 Accepts]: Start accepts. Automaton has 33774 states and 46175 transitions. Word has length 223 [2025-03-17 09:31:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:31:09,403 INFO L471 AbstractCegarLoop]: Abstraction has 33774 states and 46175 transitions. [2025-03-17 09:31:09,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-17 09:31:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 33774 states and 46175 transitions. [2025-03-17 09:31:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-17 09:31:09,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:31:09,407 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 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] [2025-03-17 09:31:09,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 09:31:09,407 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-17 09:31:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:31:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash -637261289, now seen corresponding path program 1 times [2025-03-17 09:31:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:31:09,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704464471] [2025-03-17 09:31:09,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:31:09,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:31:09,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-17 09:31:09,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-17 09:31:09,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:31:09,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:31:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-03-17 09:31:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:31:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704464471] [2025-03-17 09:31:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704464471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:31:09,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:31:09,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:31:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296630598] [2025-03-17 09:31:09,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:31:09,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:31:09,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:31:09,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:31:09,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:31:09,672 INFO L87 Difference]: Start difference. First operand 33774 states and 46175 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 09:31:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:31:10,836 INFO L93 Difference]: Finished difference Result 33780 states and 46180 transitions. [2025-03-17 09:31:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 09:31:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 217 [2025-03-17 09:31:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:31:11,035 INFO L225 Difference]: With dead ends: 33780 [2025-03-17 09:31:11,035 INFO L226 Difference]: Without dead ends: 33778 [2025-03-17 09:31:11,058 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-17 09:31:11,059 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 1269 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 09:31:11,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 3945 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 09:31:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33778 states. [2025-03-17 09:31:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33778 to 33778. [2025-03-17 09:31:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33778 states, 23899 states have (on average 1.2561613456629985) internal successors, (30021), 24479 states have internal predecessors, (30021), 7740 states have call successors, (7740), 2187 states have call predecessors, (7740), 2136 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-03-17 09:31:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33778 states to 33778 states and 46178 transitions. [2025-03-17 09:31:13,136 INFO L78 Accepts]: Start accepts. Automaton has 33778 states and 46178 transitions. Word has length 217 [2025-03-17 09:31:13,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:31:13,136 INFO L471 AbstractCegarLoop]: Abstraction has 33778 states and 46178 transitions. [2025-03-17 09:31:13,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 09:31:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 33778 states and 46178 transitions. [2025-03-17 09:31:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-17 09:31:13,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:31:13,141 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 5, 4, 4, 4, 4, 4, 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-17 09:31:13,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 09:31:13,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-17 09:31:13,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:31:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 860314587, now seen corresponding path program 1 times [2025-03-17 09:31:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:31:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74258785] [2025-03-17 09:31:13,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:31:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:31:13,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-17 09:31:13,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-17 09:31:13,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:31:13,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:31:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2025-03-17 09:31:13,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:31:13,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74258785] [2025-03-17 09:31:13,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74258785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:31:13,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:31:13,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:31:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118655155] [2025-03-17 09:31:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:31:13,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:31:13,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:31:13,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:31:13,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:31:13,430 INFO L87 Difference]: Start difference. First operand 33778 states and 46178 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 09:31:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:31:14,410 INFO L93 Difference]: Finished difference Result 33784 states and 46183 transitions. [2025-03-17 09:31:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 09:31:14,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 222 [2025-03-17 09:31:14,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:31:14,680 INFO L225 Difference]: With dead ends: 33784 [2025-03-17 09:31:14,680 INFO L226 Difference]: Without dead ends: 33782 [2025-03-17 09:31:14,713 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-17 09:31:14,714 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 1268 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 09:31:14,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 3945 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 09:31:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33782 states. [2025-03-17 09:31:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33782 to 33782. [2025-03-17 09:31:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33782 states, 23902 states have (on average 1.2561291942096895) internal successors, (30024), 24482 states have internal predecessors, (30024), 7740 states have call successors, (7740), 2188 states have call predecessors, (7740), 2137 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-03-17 09:31:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33782 states to 33782 states and 46181 transitions. [2025-03-17 09:31:16,530 INFO L78 Accepts]: Start accepts. Automaton has 33782 states and 46181 transitions. Word has length 222 [2025-03-17 09:31:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:31:16,530 INFO L471 AbstractCegarLoop]: Abstraction has 33782 states and 46181 transitions. [2025-03-17 09:31:16,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 09:31:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 33782 states and 46181 transitions. [2025-03-17 09:31:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-17 09:31:16,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:31:16,538 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 6, 5, 5, 4, 4, 4, 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] [2025-03-17 09:31:16,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 09:31:16,538 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-17 09:31:16,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:31:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash 397642967, now seen corresponding path program 1 times [2025-03-17 09:31:16,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:31:16,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705072018] [2025-03-17 09:31:16,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:31:16,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:31:16,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 09:31:16,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 09:31:16,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:31:16,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:31:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-17 09:31:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:31:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705072018] [2025-03-17 09:31:16,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705072018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:31:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:31:16,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:31:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473778368] [2025-03-17 09:31:16,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:31:16,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:31:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:31:16,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:31:16,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:31:16,950 INFO L87 Difference]: Start difference. First operand 33782 states and 46181 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 09:31:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:31:18,503 INFO L93 Difference]: Finished difference Result 33788 states and 46186 transitions. [2025-03-17 09:31:18,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 09:31:18,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 227 [2025-03-17 09:31:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:31:18,713 INFO L225 Difference]: With dead ends: 33788 [2025-03-17 09:31:18,713 INFO L226 Difference]: Without dead ends: 33786 [2025-03-17 09:31:18,738 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-17 09:31:18,740 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 1267 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 09:31:18,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 3945 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 09:31:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33786 states. [2025-03-17 09:31:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33786 to 33786. [2025-03-17 09:31:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33786 states, 23905 states have (on average 1.256097050826187) internal successors, (30027), 24485 states have internal predecessors, (30027), 7740 states have call successors, (7740), 2189 states have call predecessors, (7740), 2138 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-03-17 09:31:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33786 states to 33786 states and 46184 transitions. [2025-03-17 09:31:20,431 INFO L78 Accepts]: Start accepts. Automaton has 33786 states and 46184 transitions. Word has length 227 [2025-03-17 09:31:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:31:20,432 INFO L471 AbstractCegarLoop]: Abstraction has 33786 states and 46184 transitions. [2025-03-17 09:31:20,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 09:31:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 33786 states and 46184 transitions. [2025-03-17 09:31:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-17 09:31:20,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:31:20,436 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 7, 6, 6, 4, 4, 4, 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] [2025-03-17 09:31:20,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 09:31:20,436 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-17 09:31:20,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:31:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1387429477, now seen corresponding path program 1 times [2025-03-17 09:31:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:31:20,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666729330] [2025-03-17 09:31:20,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:31:20,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:31:20,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-17 09:31:20,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-17 09:31:20,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:31:20,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:31:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2025-03-17 09:31:20,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:31:20,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666729330] [2025-03-17 09:31:20,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666729330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:31:20,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:31:20,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:31:20,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347312707] [2025-03-17 09:31:20,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:31:20,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:31:20,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:31:20,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:31:20,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:31:20,688 INFO L87 Difference]: Start difference. First operand 33786 states and 46184 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 09:31:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:31:22,603 INFO L93 Difference]: Finished difference Result 34308 states and 46619 transitions. [2025-03-17 09:31:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 09:31:22,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 232 [2025-03-17 09:31:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:31:22,745 INFO L225 Difference]: With dead ends: 34308 [2025-03-17 09:31:22,745 INFO L226 Difference]: Without dead ends: 34306 [2025-03-17 09:31:22,760 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-17 09:31:22,760 INFO L435 NwaCegarLoop]: 1319 mSDtfsCounter, 1216 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 3991 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 09:31:22,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 3991 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 09:31:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34306 states. [2025-03-17 09:31:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34306 to 34306. [2025-03-17 09:31:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34306 states, 24338 states have (on average 1.2515408003944448) internal successors, (30460), 24918 states have internal predecessors, (30460), 7740 states have call successors, (7740), 2276 states have call predecessors, (7740), 2225 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-03-17 09:31:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34306 states to 34306 states and 46617 transitions. [2025-03-17 09:31:25,046 INFO L78 Accepts]: Start accepts. Automaton has 34306 states and 46617 transitions. Word has length 232 [2025-03-17 09:31:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:31:25,047 INFO L471 AbstractCegarLoop]: Abstraction has 34306 states and 46617 transitions. [2025-03-17 09:31:25,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 09:31:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 34306 states and 46617 transitions. [2025-03-17 09:31:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 09:31:25,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:31:25,052 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 8, 7, 7, 4, 4, 4, 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] [2025-03-17 09:31:25,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 09:31:25,052 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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-17 09:31:25,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:31:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1545916311, now seen corresponding path program 1 times [2025-03-17 09:31:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:31:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66918839] [2025-03-17 09:31:25,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:31:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:31:25,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 09:31:25,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 09:31:25,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:31:25,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:31:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2025-03-17 09:31:25,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:31:25,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66918839] [2025-03-17 09:31:25,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66918839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:31:25,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:31:25,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:31:25,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168549571] [2025-03-17 09:31:25,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:31:25,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:31:25,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:31:25,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:31:25,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:31:25,293 INFO L87 Difference]: Start difference. First operand 34306 states and 46617 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 09:31:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:31:26,665 INFO L93 Difference]: Finished difference Result 34312 states and 46622 transitions. [2025-03-17 09:31:26,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 09:31:26,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 237 [2025-03-17 09:31:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:31:26,780 INFO L225 Difference]: With dead ends: 34312 [2025-03-17 09:31:26,781 INFO L226 Difference]: Without dead ends: 34310 [2025-03-17 09:31:26,796 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-17 09:31:26,797 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 1265 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 09:31:26,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 3945 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 09:31:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2025-03-17 09:31:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34310. [2025-03-17 09:31:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34310 states, 24341 states have (on average 1.2515097982827328) internal successors, (30463), 24921 states have internal predecessors, (30463), 7740 states have call successors, (7740), 2277 states have call predecessors, (7740), 2226 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-03-17 09:31:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34310 states to 34310 states and 46620 transitions. [2025-03-17 09:31:28,175 INFO L78 Accepts]: Start accepts. Automaton has 34310 states and 46620 transitions. Word has length 237 [2025-03-17 09:31:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:31:28,175 INFO L471 AbstractCegarLoop]: Abstraction has 34310 states and 46620 transitions. [2025-03-17 09:31:28,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 09:31:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 34310 states and 46620 transitions. [2025-03-17 09:31:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-17 09:31:28,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:31:28,181 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 9, 8, 8, 4, 4, 4, 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] [2025-03-17 09:31:28,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 09:31:28,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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-17 09:31:28,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:31:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1857931099, now seen corresponding path program 1 times [2025-03-17 09:31:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:31:28,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748901763] [2025-03-17 09:31:28,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:31:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:31:28,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-17 09:31:28,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-17 09:31:28,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:31:28,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:31:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2025-03-17 09:31:28,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:31:28,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748901763] [2025-03-17 09:31:28,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748901763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:31:28,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:31:28,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:31:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575894558] [2025-03-17 09:31:28,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:31:28,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:31:28,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:31:28,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:31:28,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:31:28,387 INFO L87 Difference]: Start difference. First operand 34310 states and 46620 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 09:31:29,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 09:31:29,626 INFO L93 Difference]: Finished difference Result 34316 states and 46625 transitions. [2025-03-17 09:31:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 09:31:29,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 242 [2025-03-17 09:31:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 09:31:29,759 INFO L225 Difference]: With dead ends: 34316 [2025-03-17 09:31:29,759 INFO L226 Difference]: Without dead ends: 34314 [2025-03-17 09:31:29,779 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-17 09:31:29,780 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 1264 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 09:31:29,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 3945 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 09:31:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2025-03-17 09:31:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34314. [2025-03-17 09:31:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34314 states, 24344 states have (on average 1.2514788038120277) internal successors, (30466), 24924 states have internal predecessors, (30466), 7740 states have call successors, (7740), 2278 states have call predecessors, (7740), 2227 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-03-17 09:31:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34314 states to 34314 states and 46623 transitions. [2025-03-17 09:31:31,370 INFO L78 Accepts]: Start accepts. Automaton has 34314 states and 46623 transitions. Word has length 242 [2025-03-17 09:31:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 09:31:31,371 INFO L471 AbstractCegarLoop]: Abstraction has 34314 states and 46623 transitions. [2025-03-17 09:31:31,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 09:31:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 34314 states and 46623 transitions. [2025-03-17 09:31:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-17 09:31:31,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 09:31:31,377 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 10, 9, 9, 4, 4, 4, 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] [2025-03-17 09:31:31,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 09:31:31,377 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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-17 09:31:31,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 09:31:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash 109048407, now seen corresponding path program 1 times [2025-03-17 09:31:31,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 09:31:31,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365556008] [2025-03-17 09:31:31,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 09:31:31,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 09:31:31,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 09:31:31,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 09:31:31,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 09:31:31,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 09:31:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2025-03-17 09:31:31,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 09:31:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365556008] [2025-03-17 09:31:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365556008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 09:31:31,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 09:31:31,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 09:31:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887721395] [2025-03-17 09:31:31,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 09:31:31,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 09:31:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 09:31:31,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 09:31:31,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 09:31:31,637 INFO L87 Difference]: Start difference. First operand 34314 states and 46623 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (31), 3 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)