./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_pthread_mutex_unlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_pthread_mutex_unlock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4aba0d481dbad425b1cb3ce4949768f5bfa91a070fed6a0c2b192c70ad920fc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:40:12,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:40:12,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:40:12,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:40:12,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:40:12,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:40:12,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:40:12,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:40:12,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:40:12,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:40:12,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:40:12,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:40:12,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:40:12,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:40:12,161 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:40:12,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:40:12,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:40:12,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:40:12,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:40:12,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:40:12,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:40:12,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:40:12,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:40:12,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:40:12,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:40:12,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:40:12,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:40:12,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:40:12,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:40:12,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:40:12,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:40:12,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:40:12,164 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-jdk21/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4aba0d481dbad425b1cb3ce4949768f5bfa91a070fed6a0c2b192c70ad920fc2 [2025-02-08 06:40:12,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:40:12,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:40:12,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:40:12,403 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:40:12,403 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:40:12,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_pthread_mutex_unlock.i [2025-02-08 06:40:13,647 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd3f8de5a/9172994c6cb24db1962c1c178c79af67/FLAG629108e93 [2025-02-08 06:40:14,031 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:40:14,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_pthread_mutex_unlock.i [2025-02-08 06:40:14,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd3f8de5a/9172994c6cb24db1962c1c178c79af67/FLAG629108e93 [2025-02-08 06:40:14,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd3f8de5a/9172994c6cb24db1962c1c178c79af67 [2025-02-08 06:40:14,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:40:14,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:40:14,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:40:14,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:40:14,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:40:14,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:40:14" (1/1) ... [2025-02-08 06:40:14,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c51d833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:14, skipping insertion in model container [2025-02-08 06:40:14,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:40:14" (1/1) ... [2025-02-08 06:40:14,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:40:14,755 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:40:14,773 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:40:14,789 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:40:14,842 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:40:14,879 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:40:14,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:40:14,926 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:40:15,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:40:15,270 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:40:15,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15 WrapperNode [2025-02-08 06:40:15,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:40:15,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:40:15,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:40:15,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:40:15,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,442 INFO L138 Inliner]: procedures = 473, calls = 2668, calls flagged for inlining = 55, calls inlined = 37, statements flattened = 3342 [2025-02-08 06:40:15,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:40:15,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:40:15,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:40:15,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:40:15,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,543 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 3, 35, 1040, 480, 59, 35, 11, 2, 5, 15, 120, 67, 2, 0, 5, 2, 20, 4, 12, 16, 2, 18, 37, 3, 21, 5]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 3, 15, 1040, 480, 59, 32, 2, 0, 1, 10, 120, 67, 0, 0, 4, 2, 4, 4, 6, 5, 0, 18, 25, 0, 0, 1]. The 58 writes are split as follows [0, 0, 6, 0, 0, 0, 0, 5, 1, 1, 2, 0, 0, 2, 0, 0, 0, 4, 0, 6, 8, 0, 0, 0, 0, 21, 2]. [2025-02-08 06:40:15,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:40:15,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:40:15,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:40:15,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:40:15,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (1/1) ... [2025-02-08 06:40:15,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:40:15,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:15,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:40:15,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:40:15,740 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-02-08 06:40:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-02-08 06:40:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 06:40:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-02-08 06:40:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-02-08 06:40:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-02-08 06:40:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:40:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-02-08 06:40:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-02-08 06:40:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 06:40:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-02-08 06:40:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-02-08 06:40:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-02-08 06:40:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 06:40:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 06:40:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 06:40:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 06:40:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 06:40:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 06:40:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 06:40:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 06:40:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 06:40:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 06:40:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 06:40:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 06:40:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 06:40:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-08 06:40:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 06:40:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-02-08 06:40:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-02-08 06:40:15,747 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 06:40:15,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-02-08 06:40:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-08 06:40:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-02-08 06:40:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:40:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-02-08 06:40:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 06:40:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-02-08 06:40:15,748 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:40:15,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-02-08 06:40:15,751 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-02-08 06:40:15,751 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-02-08 06:40:15,752 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-08 06:40:15,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 06:40:15,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-08 06:40:15,754 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-02-08 06:40:15,754 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-02-08 06:40:15,754 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-02-08 06:40:15,754 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-02-08 06:40:15,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-02-08 06:40:15,754 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 06:40:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-02-08 06:40:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-02-08 06:40:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-08 06:40:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-02-08 06:40:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 06:40:15,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 06:40:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-08 06:40:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-08 06:40:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-08 06:40:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-08 06:40:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-08 06:40:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-08 06:40:16,097 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:40:16,098 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:40:16,265 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1648: assume 86 == zf_write_~c~0#1;~zf_expect_close~0 := 42; [2025-02-08 06:40:16,265 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1648: assume !(86 == zf_write_~c~0#1); [2025-02-08 06:40:16,265 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: assume 0 != zf_write_#t~ret213#1;havoc zf_write_#t~ret213#1;zf_write_#res#1 := -14; [2025-02-08 06:40:16,266 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: assume !(0 != zf_write_#t~ret213#1);havoc zf_write_#t~ret213#1; [2025-02-08 06:40:16,266 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247: havoc get_user_#t~nondet672#1;zf_write_#t~ret213#1 := get_user_#res#1;havoc get_user_#t~nondet672#1, get_user_~size#1, get_user_~ptr#1.base, get_user_~ptr#1.offset;havoc get_user_#in~size#1, get_user_#in~ptr#1.base, get_user_#in~ptr#1.offset;assume { :end_inline_get_user } true;assume -2147483648 <= zf_write_#t~ret213#1 && zf_write_#t~ret213#1 <= 2147483647; [2025-02-08 06:40:16,266 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1644-1: havoc zf_write_~c~0#1;zf_write_#t~post214#1 := zf_write_~ofs~0#1;zf_write_~ofs~0#1 := 1 + zf_write_#t~post214#1;havoc zf_write_#t~post214#1; [2025-02-08 06:40:16,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1510: havoc #t~ret201; [2025-02-08 06:40:16,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1472: havoc #t~ret200#1; [2025-02-08 06:40:16,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3963: havoc inw_#t~nondet754#1; [2025-02-08 06:40:16,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1673-1: assume 0 != zf_ioctl_#t~ret216#1 % 4294967296;havoc zf_ioctl_#t~ret216#1;zf_ioctl_#res#1 := -14; [2025-02-08 06:40:16,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1673-1: assume !(0 != zf_ioctl_#t~ret216#1 % 4294967296);havoc zf_ioctl_#t~ret216#1; [2025-02-08 06:40:16,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3271: havoc copy_to_user_#t~nondet675#1;zf_ioctl_#t~ret216#1 := copy_to_user_#res#1;havoc copy_to_user_#t~nondet675#1, copy_to_user_~to#1.base, copy_to_user_~to#1.offset, copy_to_user_~from#1.base, copy_to_user_~from#1.offset, copy_to_user_~n#1;havoc copy_to_user_#in~to#1.base, copy_to_user_#in~to#1.offset, copy_to_user_#in~from#1.base, copy_to_user_#in~from#1.offset, copy_to_user_#in~n#1;assume { :end_inline_copy_to_user } true; [2025-02-08 06:40:16,357 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3263: havoc put_user_#t~nondet674#1;zf_ioctl_#t~ret217#1 := put_user_#res#1;havoc put_user_#t~nondet674#1, put_user_~size#1, put_user_~ptr#1.base, put_user_~ptr#1.offset;havoc put_user_#in~size#1, put_user_#in~ptr#1.base, put_user_#in~ptr#1.offset;assume { :end_inline_put_user } true;assume -2147483648 <= zf_ioctl_#t~ret217#1 && zf_ioctl_#t~ret217#1 <= 2147483647;zf_ioctl_#res#1 := zf_ioctl_#t~ret217#1;havoc zf_ioctl_#t~ret217#1; [2025-02-08 06:40:16,453 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1695: assume 0 != zf_open_#t~ret218#1;havoc zf_open_#t~ret218#1; [2025-02-08 06:40:16,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1695: assume !(0 != zf_open_#t~ret218#1);havoc zf_open_#t~ret218#1; [2025-02-08 06:40:16,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1530: SUMMARY for call outb((if (if zf_set_timer_~new#1 % 65536 % 4294967296 <= 2147483647 then zf_set_timer_~new#1 % 65536 % 4294967296 else zf_set_timer_~new#1 % 65536 % 4294967296 - 4294967296) > 255 then 255 else (if zf_set_timer_~new#1 % 65536 % 4294967296 <= 2147483647 then zf_set_timer_~new#1 % 65536 % 4294967296 else zf_set_timer_~new#1 % 65536 % 4294967296 - 4294967296)), 537); srcloc: null [2025-02-08 06:40:16,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1530-1: SUMMARY for call outb(14, 536); srcloc: null [2025-02-08 06:40:16,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: zf_open_#res#1 := -16; [2025-02-08 06:40:16,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696-1: SUMMARY for call spin_unlock(~#zf_lock~0.base, ~#zf_lock~0.offset); srcloc: null [2025-02-08 06:40:16,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1531: assume zf_set_timer_#t~switch202#1; [2025-02-08 06:40:16,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1531: assume !zf_set_timer_#t~switch202#1;havoc zf_set_timer_#t~switch202#1;havoc zf_set_timer_#t~switch202#1;havoc zf_set_timer_#t~switch202#1, zf_set_timer_~new#1, zf_set_timer_~n#1;havoc zf_set_timer_#in~new#1, zf_set_timer_#in~n#1;assume { :end_inline_zf_set_timer } true;~next_heartbeat~0 := 1000 + ~jiffies~0; [2025-02-08 06:40:16,454 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1531-1: zf_set_timer_#t~switch202#1 := true; [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: zf_timer_on_~ctrl_reg~1#1 := zf_timer_on_#t~ret206#1 % 65536;havoc zf_timer_on_#t~ret206#1; [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582-1: SUMMARY for call zf_timer_on_#t~ret206#1 := zf_get_control(); srcloc: null [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ##fun~$Pointer$~X~$Pointer$~TO~intFINAL: assume true; [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583: zf_timer_on_~ctrl_reg~1#1 := zf_timer_on_#t~bitwise207#1;havoc zf_timer_on_#t~bitwise207#1; [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583-1: [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583-2: havoc zf_timer_on_#t~bitwise207#1;assume (zf_timer_on_#t~bitwise207#1 % 4294967296 >= zf_timer_on_~ctrl_reg~1#1 % 4294967296 && zf_timer_on_#t~bitwise207#1 % 4294967296 >= (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296) && zf_timer_on_#t~bitwise207#1 % 4294967296 <= zf_timer_on_~ctrl_reg~1#1 % 4294967296 + (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296; [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583-3: assume 0 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296;zf_timer_on_#t~bitwise207#1 := zf_timer_on_~ctrl_reg~1#1; [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583-3: assume !(0 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296); [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1707: havoc zf_open_#t~ret219#1;#t~ret806#1 := zf_open_#res#1;havoc zf_open_#t~ret218#1, zf_open_#t~ret219#1, zf_open_~inode#1.base, zf_open_~inode#1.offset, zf_open_~file#1.base, zf_open_~file#1.offset;havoc zf_open_#in~inode#1.base, zf_open_#in~inode#1.offset, zf_open_#in~file#1.base, zf_open_#in~file#1.offset;assume { :end_inline_zf_open } true;assume -2147483648 <= #t~ret806#1 && #t~ret806#1 <= 2147483647;#t~funptrres805#1 := #t~ret806#1; [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583-4: assume 0 == zf_timer_on_~ctrl_reg~1#1 % 4294967296 || zf_timer_on_~ctrl_reg~1#1 % 4294967296 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296;zf_timer_on_#t~bitwise207#1 := 1 + ~zf_action~0 - ~zf_action~0 % 2; [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583-4: assume !(0 == zf_timer_on_~ctrl_reg~1#1 % 4294967296 || zf_timer_on_~ctrl_reg~1#1 % 4294967296 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296); [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1707-2: zf_open_#t~ret219#1 := nonseekable_open_#res#1;havoc nonseekable_open_~inode#1.base, nonseekable_open_~inode#1.offset, nonseekable_open_~filp#1.base, nonseekable_open_~filp#1.offset, nonseekable_open_~i~16#1;havoc nonseekable_open_#in~inode#1.base, nonseekable_open_#in~inode#1.offset, nonseekable_open_#in~filp#1.base, nonseekable_open_#in~filp#1.offset;assume { :end_inline_nonseekable_open } true;assume -2147483648 <= zf_open_#t~ret219#1 && zf_open_#t~ret219#1 <= 2147483647;zf_open_#res#1 := zf_open_#t~ret219#1;havoc zf_open_#t~ret219#1; [2025-02-08 06:40:16,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: SUMMARY for call spin_lock_irqsave(~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, zf_timer_on_~flags~1#1); srcloc: null [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1584: SUMMARY for call zf_set_control(zf_timer_on_~ctrl_reg~1#1); srcloc: null [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: assume 0 != ~nowayout~0;assume { :begin_inline___module_get } true;__module_get_#in~module#1.base, __module_get_#in~module#1.offset := 0, 0;havoc __module_get_~module#1.base, __module_get_~module#1.offset;__module_get_~module#1.base, __module_get_~module#1.offset := __module_get_#in~module#1.base, __module_get_#in~module#1.offset;havoc __module_get_~module#1.base, __module_get_~module#1.offset;havoc __module_get_#in~module#1.base, __module_get_#in~module#1.offset;assume { :end_inline___module_get } true; [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: assume !(0 != ~nowayout~0); [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #res#1 := #t~funptrres805#1;havoc #t~funptrres805#1;havoc #t~ret806#1;havoc #t~ret807#1; [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: #t~ret807#1 := zf_close_#res#1;havoc zf_close_#t~ret220#1, zf_close_#t~ret221#1, zf_close_~inode#1.base, zf_close_~inode#1.offset, zf_close_~file#1.base, zf_close_~file#1.offset;havoc zf_close_#in~inode#1.base, zf_close_#in~inode#1.offset, zf_close_#in~file#1.base, zf_close_#in~file#1.offset;assume { :end_inline_zf_close } true;assume -2147483648 <= #t~ret807#1 && #t~ret807#1 <= 2147483647;#t~funptrres805#1 := #t~ret807#1; [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527: assume zf_set_timer_#t~switch202#1; [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527: assume !zf_set_timer_#t~switch202#1; [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1585: SUMMARY for call spin_unlock_irqrestore(~#zf_port_lock~0.base, ~#zf_port_lock~0.offset, zf_timer_on_~flags~1#1); srcloc: null [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1577: SUMMARY for call write~int#20(50 + ~jiffies~0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4); srcloc: null [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1577: assume !(1 == #valid[~#zf_timer~0.base]); [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1577: assume !(4 + ~#zf_timer~0.offset <= #length[~#zf_timer~0.base] && 0 <= ~#zf_timer~0.offset); [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1569: assume { :begin_inline_zf_set_timer } true;zf_set_timer_#in~new#1, zf_set_timer_#in~n#1 := 65535, 0;havoc zf_set_timer_#t~switch202#1, zf_set_timer_~new#1, zf_set_timer_~n#1;zf_set_timer_~new#1 := zf_set_timer_#in~new#1;zf_set_timer_~n#1 := zf_set_timer_#in~n#1;zf_set_timer_#t~switch202#1 := 0 == (if zf_set_timer_~n#1 % 256 % 4294967296 <= 2147483647 then zf_set_timer_~n#1 % 256 % 4294967296 else zf_set_timer_~n#1 % 256 % 4294967296 - 4294967296); [2025-02-08 06:40:16,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1569-1: SUMMARY for call outb(255, 537); srcloc: null [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1569-2: SUMMARY for call outb(15, 536); srcloc: null [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528: SUMMARY for call outw(zf_set_timer_~new#1, 538); srcloc: null [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528-1: SUMMARY for call outb(12, 536); srcloc: null [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4510: havoc test_and_set_bit_#t~bitwise795#1;zf_open_#t~ret218#1 := test_and_set_bit_#res#1;havoc test_and_set_bit_#t~bitwise792#1, test_and_set_bit_#t~mem793#1, test_and_set_bit_#t~bitwise794#1, test_and_set_bit_#t~bitwise795#1, test_and_set_bit_~nr#1, test_and_set_bit_~addr#1.base, test_and_set_bit_~addr#1.offset, test_and_set_bit_~bit~0#1, test_and_set_bit_~old~0#1;havoc test_and_set_bit_#in~nr#1, test_and_set_bit_#in~addr#1.base, test_and_set_bit_#in~addr#1.offset;assume { :end_inline_test_and_set_bit } true;assume -2147483648 <= zf_open_#t~ret218#1 && zf_open_#t~ret218#1 <= 2147483647; [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529: assume zf_set_timer_#t~switch202#1; [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529: assume !zf_set_timer_#t~switch202#1; [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529-1: zf_set_timer_#t~switch202#1 := zf_set_timer_#t~switch202#1 || 1 == (if zf_set_timer_~n#1 % 256 % 4294967296 <= 2147483647 then zf_set_timer_~n#1 % 256 % 4294967296 else zf_set_timer_~n#1 % 256 % 4294967296 - 4294967296); [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1587: assume -2147483648 <= zf_timer_on_#t~ret208#1 && zf_timer_on_#t~ret208#1 <= 2147483647;havoc zf_timer_on_#t~ret208#1;havoc zf_timer_on_#t~ret206#1, zf_timer_on_#t~bitwise207#1, zf_timer_on_#t~ret208#1, zf_timer_on_~ctrl_reg~1#1, zf_timer_on_~flags~1#1;assume { :end_inline_zf_timer_on } true;assume { :begin_inline_nonseekable_open } true;nonseekable_open_#in~inode#1.base, nonseekable_open_#in~inode#1.offset, nonseekable_open_#in~filp#1.base, nonseekable_open_#in~filp#1.offset := zf_open_~inode#1.base, zf_open_~inode#1.offset, zf_open_~file#1.base, zf_open_~file#1.offset;havoc nonseekable_open_#res#1;havoc nonseekable_open_~inode#1.base, nonseekable_open_~inode#1.offset, nonseekable_open_~filp#1.base, nonseekable_open_~filp#1.offset, nonseekable_open_~i~16#1;nonseekable_open_~inode#1.base, nonseekable_open_~inode#1.offset := nonseekable_open_#in~inode#1.base, nonseekable_open_#in~inode#1.offset;nonseekable_open_~filp#1.base, nonseekable_open_~filp#1.offset := nonseekable_open_#in~filp#1.base, nonseekable_open_#in~filp#1.offset;havoc nonseekable_open_~i~16#1;nonseekable_open_#res#1 := nonseekable_open_~i~16#1; [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1587-1: SUMMARY for call zf_timer_on_#t~ret208#1 := printk(12, 0); srcloc: null [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1579: SUMMARY for call add_timer(~#zf_timer~0.base, ~#zf_timer~0.offset); srcloc: null [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1703: assume { :begin_inline_zf_timer_on } true;havoc zf_timer_on_#t~ret206#1, zf_timer_on_#t~bitwise207#1, zf_timer_on_#t~ret208#1, zf_timer_on_~ctrl_reg~1#1, zf_timer_on_~flags~1#1;zf_timer_on_~ctrl_reg~1#1 := 0;havoc zf_timer_on_~flags~1#1; [2025-02-08 06:40:16,457 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1703-1: SUMMARY for call spin_unlock(~#zf_lock~0.base, ~#zf_lock~0.offset); srcloc: null [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820: assume { :begin_inline_init_timer } true;init_timer_#in~timer#1.base, init_timer_#in~timer#1.offset := ~#zf_timer~0.base, ~#zf_timer~0.offset;havoc init_timer_#t~post767#1, init_timer_~timer#1.base, init_timer_~timer#1.offset;init_timer_~timer#1.base, init_timer_~timer#1.offset := init_timer_#in~timer#1.base, init_timer_#in~timer#1.offset; [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-1: SUMMARY for call zf_set_control(0); srcloc: null [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3506: havoc misc_register_#t~ret714#1;zf_init_#t~ret228#1 := misc_register_#res#1;havoc misc_register_#t~post710#1, misc_register_#t~mem711#1.base, misc_register_#t~mem711#1.offset, misc_register_#t~mem712#1, misc_register_#t~bitwise713#1, misc_register_#t~ret714#1, misc_register_~misc#1.base, misc_register_~misc#1.offset, misc_register_~i~9#1, misc_register_~dev~0#1;havoc misc_register_#in~misc#1.base, misc_register_#in~misc#1.offset;assume { :end_inline_misc_register } true;assume -2147483648 <= zf_init_#t~ret228#1 && zf_init_#t~ret228#1 <= 2147483647;zf_init_~ret~3#1 := zf_init_#t~ret228#1;havoc zf_init_#t~ret228#1; [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823: havoc init_timer_#t~post767#1, init_timer_~timer#1.base, init_timer_~timer#1.offset;havoc init_timer_#in~timer#1.base, init_timer_#in~timer#1.offset;assume { :end_inline_init_timer } true; [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1824: SUMMARY for call write~$Pointer$#20(#funAddr~zf_ping.base, #funAddr~zf_ping.offset, ~#zf_timer~0.base, 4 + ~#zf_timer~0.offset, 4); srcloc: null [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1824: assume !(1 == #valid[~#zf_timer~0.base]); [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1824: assume !(4 + (4 + ~#zf_timer~0.offset) <= #length[~#zf_timer~0.base] && 0 <= 4 + ~#zf_timer~0.offset); [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825: zf_init_#res#1 := 0; [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: SUMMARY for call write~int#20(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4); srcloc: null [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: assume !(1 == #valid[~#zf_timer~0.base]); [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: assume !(4 + (8 + ~#zf_timer~0.offset) <= #length[~#zf_timer~0.base] && 0 <= 8 + ~#zf_timer~0.offset); [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830: SUMMARY for call release_region(536, 3); srcloc: null [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1832: assume -2147483648 <= zf_init_#t~ret234#1 && zf_init_#t~ret234#1 <= 2147483647;zf_init_#res#1 := zf_init_~ret~3#1; [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1832-1: SUMMARY for call zf_init_#t~ret234#1 := misc_deregister(~#zf_miscdev~0.base, ~#zf_miscdev~0.offset); srcloc: null [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1799: assume 0 != zf_init_~ret~3#1; [2025-02-08 06:40:20,651 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1799: assume !(0 != zf_init_~ret~3#1); [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1502: havoc zf_set_status_~new#1;havoc zf_set_status_#in~new#1;assume { :end_inline_zf_set_status } true; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1502-1: SUMMARY for call outb(zf_set_status_~new#1, 537); srcloc: null [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1502-2: SUMMARY for call outb(18, 536); srcloc: null [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1800: assume -2147483648 <= zf_init_#t~ret229#1 && zf_init_#t~ret229#1 <= 2147483647;havoc zf_init_#t~ret229#1; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1800-1: SUMMARY for call zf_init_#t~ret229#1 := printk(23, 0); srcloc: null [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4245: assume ~number_timer_registered~0 < 1; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4245: assume !(~number_timer_registered~0 < 1); [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4246: SUMMARY for call write~int#20(0, init_timer_~timer#1.base, 12 + init_timer_~timer#1.offset, 2); srcloc: null [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4246: assume !(1 == #valid[init_timer_~timer#1.base]); [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4246: assume !(2 + (12 + init_timer_~timer#1.offset) <= #length[init_timer_~timer#1.base] && 0 <= 12 + init_timer_~timer#1.offset); [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: SUMMARY for call write~int#20(1, init_timer_~timer#1.base, 14 + init_timer_~timer#1.offset, 2); srcloc: null [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: assume !(1 == #valid[init_timer_~timer#1.base]); [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: assume !(2 + (14 + init_timer_~timer#1.offset) <= #length[init_timer_~timer#1.base] && 0 <= 14 + init_timer_~timer#1.offset); [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4248-1: SUMMARY for call write~$Pointer$#9(init_timer_~timer#1.base, init_timer_~timer#1.offset, ~#timer_registered~0.base, ~#timer_registered~0.offset + 4 * ~number_timer_registered~0, 4); srcloc: null [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4248-1: assume !(1 == #valid[~#timer_registered~0.base]); [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4248-1: assume !(4 + (~#timer_registered~0.offset + 4 * ~number_timer_registered~0) <= #length[~#timer_registered~0.base] && 0 <= ~#timer_registered~0.offset + 4 * ~number_timer_registered~0); [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4248: init_timer_#t~post767#1 := ~number_timer_registered~0;~number_timer_registered~0 := 1 + init_timer_#t~post767#1;havoc init_timer_#t~post767#1; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: assume zf_init_#t~ret230#1.base == 0 && zf_init_#t~ret230#1.offset == 0;havoc zf_init_#t~ret230#1.base, zf_init_#t~ret230#1.offset; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: assume !(zf_init_#t~ret230#1.base == 0 && zf_init_#t~ret230#1.offset == 0);havoc zf_init_#t~ret230#1.base, zf_init_#t~ret230#1.offset;assume { :begin_inline_register_reboot_notifier } true;register_reboot_notifier_#in~dummy#1.base, register_reboot_notifier_#in~dummy#1.offset := ~#zf_notifier~0.base, ~#zf_notifier~0.offset;havoc register_reboot_notifier_#res#1;havoc register_reboot_notifier_~dummy#1.base, register_reboot_notifier_~dummy#1.offset, register_reboot_notifier_~i~17#1;register_reboot_notifier_~dummy#1.base, register_reboot_notifier_~dummy#1.offset := register_reboot_notifier_#in~dummy#1.base, register_reboot_notifier_#in~dummy#1.offset;havoc register_reboot_notifier_~i~17#1;register_reboot_notifier_#res#1 := register_reboot_notifier_~i~17#1;zf_init_#t~ret232#1 := register_reboot_notifier_#res#1;havoc register_reboot_notifier_~dummy#1.base, register_reboot_notifier_~dummy#1.offset, register_reboot_notifier_~i~17#1;havoc register_reboot_notifier_#in~dummy#1.base, register_reboot_notifier_#in~dummy#1.offset;assume { :end_inline_register_reboot_notifier } true;assume -2147483648 <= zf_init_#t~ret232#1 && zf_init_#t~ret232#1 <= 2147483647;zf_init_~ret~3#1 := zf_init_#t~ret232#1;havoc zf_init_#t~ret232#1; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805-1: SUMMARY for call zf_init_#t~ret230#1.base, zf_init_#t~ret230#1.offset := request_region(536, 3, 24, 0); srcloc: null [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806: assume -2147483648 <= zf_init_#t~ret231#1 && zf_init_#t~ret231#1 <= 2147483647;havoc zf_init_#t~ret231#1;zf_init_~ret~3#1 := -16; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-1: SUMMARY for call zf_init_#t~ret231#1 := printk(25, 0); srcloc: null [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813: assume 0 != zf_init_~ret~3#1; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813: assume !(0 != zf_init_~ret~3#1);assume { :begin_inline_zf_set_status } true;zf_set_status_#in~new#1 := 0;havoc zf_set_status_~new#1;zf_set_status_~new#1 := zf_set_status_#in~new#1; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814: assume -2147483648 <= zf_init_#t~ret233#1 && zf_init_#t~ret233#1 <= 2147483647;havoc zf_init_#t~ret233#1; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814-1: SUMMARY for call zf_init_#t~ret233#1 := printk(26, 0); srcloc: null [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: call_cdev_functions_#t~ret328#1 := ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#res#1;havoc ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~321#1.base, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~321#1.offset, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~322#1, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~323#1, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1;havoc ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~321#1.base, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~321#1.offset, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~322#1, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~323#1, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~#fp#1.base, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~#fp#1.offset;assume { :end_inline_##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0 } true;assume -9223372036854775808 <= call_cdev_functions_#t~ret328#1 && call_cdev_functions_#t~ret328#1 <= 9223372036854775807;havoc call_cdev_functions_#t~mem324#1;havoc call_cdev_functions_#t~mem325#1.base, call_cdev_functions_#t~mem325#1.offset;havoc call_cdev_functions_#t~mem326#1.base, call_cdev_functions_#t~mem326#1.offset;havoc call_cdev_functions_#t~mem327#1.base, call_cdev_functions_#t~mem327#1.offset;havoc call_cdev_functions_#t~ret328#1; [2025-02-08 06:40:20,652 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1 := no_llseek_#res#1;havoc no_llseek_~file#1.base, no_llseek_~file#1.offset, no_llseek_~offset#1, no_llseek_~origin#1, no_llseek_~l~0#1;havoc no_llseek_#in~file#1.base, no_llseek_#in~file#1.offset, no_llseek_#in~offset#1, no_llseek_#in~origin#1;assume { :end_inline_no_llseek } true;assume -9223372036854775808 <= ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1 && ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1 <= 9223372036854775807;##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#res#1 := ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1;havoc ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret802#1; [2025-02-08 06:40:20,722 INFO L? ?]: Removed 585 outVars from TransFormulas that were not future-live. [2025-02-08 06:40:20,722 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:40:20,765 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:40:20,765 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:40:20,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:40:20 BoogieIcfgContainer [2025-02-08 06:40:20,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:40:20,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:40:20,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:40:20,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:40:20,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:40:14" (1/3) ... [2025-02-08 06:40:20,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cde796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:40:20, skipping insertion in model container [2025-02-08 06:40:20,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:15" (2/3) ... [2025-02-08 06:40:20,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cde796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:40:20, skipping insertion in model container [2025-02-08 06:40:20,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:40:20" (3/3) ... [2025-02-08 06:40:20,775 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_pthread_mutex_unlock.i [2025-02-08 06:40:20,785 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:40:20,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_pthread_mutex_unlock.i that has 29 procedures, 606 locations, 1 initial locations, 4 loop locations, and 205 error locations. [2025-02-08 06:40:20,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:40:20,833 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=None, 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;@5f1b15bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:40:20,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2025-02-08 06:40:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 598 states, 312 states have (on average 1.8942307692307692) internal successors, (591), 519 states have internal predecessors, (591), 55 states have call successors, (55), 25 states have call predecessors, (55), 24 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-08 06:40:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:40:20,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:20,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:40:20,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:40:20,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash 29167501, now seen corresponding path program 1 times [2025-02-08 06:40:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863060860] [2025-02-08 06:40:20,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:22,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:40:23,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:40:23,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:23,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:24,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:24,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863060860] [2025-02-08 06:40:24,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863060860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:24,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:24,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:40:24,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174290659] [2025-02-08 06:40:24,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:24,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:40:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:24,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:40:24,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:40:24,600 INFO L87 Difference]: Start difference. First operand has 598 states, 312 states have (on average 1.8942307692307692) internal successors, (591), 519 states have internal predecessors, (591), 55 states have call successors, (55), 25 states have call predecessors, (55), 24 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:40:26,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:29,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:29,816 INFO L93 Difference]: Finished difference Result 600 states and 693 transitions. [2025-02-08 06:40:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:40:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:40:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:29,829 INFO L225 Difference]: With dead ends: 600 [2025-02-08 06:40:29,829 INFO L226 Difference]: Without dead ends: 526 [2025-02-08 06:40:29,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:40:29,832 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 622 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:29,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1282 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-08 06:40:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-08 06:40:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2025-02-08 06:40:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 264 states have (on average 1.8106060606060606) internal successors, (478), 457 states have internal predecessors, (478), 50 states have call successors, (50), 25 states have call predecessors, (50), 21 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-08 06:40:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 571 transitions. [2025-02-08 06:40:29,894 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 571 transitions. Word has length 4 [2025-02-08 06:40:29,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:29,894 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 571 transitions. [2025-02-08 06:40:29,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:40:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 571 transitions. [2025-02-08 06:40:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:40:29,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:29,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:40:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:40:29,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting spin_lock_initErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:40:29,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash 29167502, now seen corresponding path program 1 times [2025-02-08 06:40:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129531756] [2025-02-08 06:40:29,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:31,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:40:31,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:40:31,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:31,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:33,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129531756] [2025-02-08 06:40:33,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129531756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:33,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:33,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:40:33,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597095485] [2025-02-08 06:40:33,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:33,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:40:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:33,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:40:33,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:40:33,007 INFO L87 Difference]: Start difference. First operand 524 states and 571 transitions. Second operand has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:40:34,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:35,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:36,516 INFO L93 Difference]: Finished difference Result 614 states and 669 transitions. [2025-02-08 06:40:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:40:36,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:40:36,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:36,519 INFO L225 Difference]: With dead ends: 614 [2025-02-08 06:40:36,519 INFO L226 Difference]: Without dead ends: 608 [2025-02-08 06:40:36,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-02-08 06:40:36,520 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 261 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:36,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1461 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-08 06:40:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-02-08 06:40:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 598. [2025-02-08 06:40:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 309 states have (on average 1.7249190938511327) internal successors, (533), 501 states have internal predecessors, (533), 68 states have call successors, (68), 38 states have call predecessors, (68), 32 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:40:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 661 transitions. [2025-02-08 06:40:36,543 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 661 transitions. Word has length 4 [2025-02-08 06:40:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:36,543 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 661 transitions. [2025-02-08 06:40:36,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:40:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 661 transitions. [2025-02-08 06:40:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:40:36,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:36,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:36,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:40:36,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:40:36,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1839273248, now seen corresponding path program 1 times [2025-02-08 06:40:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:36,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985403112] [2025-02-08 06:40:36,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:38,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:40:38,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:40:38,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:38,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985403112] [2025-02-08 06:40:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985403112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:40:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589741112] [2025-02-08 06:40:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:38,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:38,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:38,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:38,771 INFO L87 Difference]: Start difference. First operand 598 states and 661 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:40:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:38,992 INFO L93 Difference]: Finished difference Result 593 states and 656 transitions. [2025-02-08 06:40:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-02-08 06:40:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:38,995 INFO L225 Difference]: With dead ends: 593 [2025-02-08 06:40:38,996 INFO L226 Difference]: Without dead ends: 593 [2025-02-08 06:40:38,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 06:40:38,997 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 496 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:38,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 420 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:40:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-08 06:40:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-02-08 06:40:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 309 states have (on average 1.7087378640776698) internal successors, (528), 496 states have internal predecessors, (528), 68 states have call successors, (68), 38 states have call predecessors, (68), 32 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:40:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 656 transitions. [2025-02-08 06:40:39,016 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 656 transitions. Word has length 10 [2025-02-08 06:40:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:39,016 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 656 transitions. [2025-02-08 06:40:39,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:40:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 656 transitions. [2025-02-08 06:40:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:40:39,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:39,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:39,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:40:39,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:40:39,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1839273249, now seen corresponding path program 1 times [2025-02-08 06:40:39,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:39,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864154254] [2025-02-08 06:40:39,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:39,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:41,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:40:41,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:40:41,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:41,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:41,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:41,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864154254] [2025-02-08 06:40:41,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864154254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:41,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:41,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:40:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414457592] [2025-02-08 06:40:41,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:41,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:40:41,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:41,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:40:41,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:40:41,569 INFO L87 Difference]: Start difference. First operand 593 states and 656 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:40:42,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:43,432 INFO L93 Difference]: Finished difference Result 612 states and 667 transitions. [2025-02-08 06:40:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:40:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-02-08 06:40:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:43,435 INFO L225 Difference]: With dead ends: 612 [2025-02-08 06:40:43,435 INFO L226 Difference]: Without dead ends: 612 [2025-02-08 06:40:43,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:40:43,435 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 259 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:43,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1087 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 06:40:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-08 06:40:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 596. [2025-02-08 06:40:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 312 states have (on average 1.7019230769230769) internal successors, (531), 499 states have internal predecessors, (531), 68 states have call successors, (68), 38 states have call predecessors, (68), 32 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:40:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 659 transitions. [2025-02-08 06:40:43,446 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 659 transitions. Word has length 10 [2025-02-08 06:40:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:43,447 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 659 transitions. [2025-02-08 06:40:43,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:40:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 659 transitions. [2025-02-08 06:40:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:40:43,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:43,447 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:40:43,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:40:43,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1402559220, now seen corresponding path program 1 times [2025-02-08 06:40:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106153107] [2025-02-08 06:40:43,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:45,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:40:45,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:40:45,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:45,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:45,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:45,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106153107] [2025-02-08 06:40:45,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106153107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:45,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950020375] [2025-02-08 06:40:45,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:45,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:45,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:45,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:40:46,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:40:48,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:40:48,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:40:48,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:48,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:48,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 5604 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 06:40:48,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:48,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:48,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950020375] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:40:48,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:40:48,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-02-08 06:40:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15968864] [2025-02-08 06:40:48,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:48,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:40:48,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:48,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:40:48,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:40:48,960 INFO L87 Difference]: Start difference. First operand 596 states and 659 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:40:50,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:52,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:54,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:57,092 INFO L93 Difference]: Finished difference Result 616 states and 667 transitions. [2025-02-08 06:40:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:40:57,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 13 [2025-02-08 06:40:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:57,095 INFO L225 Difference]: With dead ends: 616 [2025-02-08 06:40:57,095 INFO L226 Difference]: Without dead ends: 616 [2025-02-08 06:40:57,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:40:57,095 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 468 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:57,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2346 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-02-08 06:40:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-08 06:40:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 606. [2025-02-08 06:40:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 322 states have (on average 1.673913043478261) internal successors, (539), 508 states have internal predecessors, (539), 68 states have call successors, (68), 39 states have call predecessors, (68), 33 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:40:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 667 transitions. [2025-02-08 06:40:57,109 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 667 transitions. Word has length 13 [2025-02-08 06:40:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:57,110 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 667 transitions. [2025-02-08 06:40:57,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:40:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 667 transitions. [2025-02-08 06:40:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:40:57,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:57,111 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:57,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:40:57,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:57,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:40:57,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2005780761, now seen corresponding path program 1 times [2025-02-08 06:40:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949754165] [2025-02-08 06:40:57,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:59,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:40:59,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:40:59,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:59,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:40:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:59,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949754165] [2025-02-08 06:40:59,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949754165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:59,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:59,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:40:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421992326] [2025-02-08 06:40:59,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:59,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:59,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:59,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:59,465 INFO L87 Difference]: Start difference. First operand 606 states and 667 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:40:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:59,668 INFO L93 Difference]: Finished difference Result 597 states and 658 transitions. [2025-02-08 06:40:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-08 06:40:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:59,671 INFO L225 Difference]: With dead ends: 597 [2025-02-08 06:40:59,671 INFO L226 Difference]: Without dead ends: 597 [2025-02-08 06:40:59,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 06:40:59,671 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 482 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:59,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 415 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:40:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-08 06:40:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-02-08 06:40:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 322 states have (on average 1.6459627329192548) internal successors, (530), 499 states have internal predecessors, (530), 68 states have call successors, (68), 39 states have call predecessors, (68), 33 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:40:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 658 transitions. [2025-02-08 06:40:59,682 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 658 transitions. Word has length 23 [2025-02-08 06:40:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:59,682 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 658 transitions. [2025-02-08 06:40:59,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:40:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 658 transitions. [2025-02-08 06:40:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:40:59,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:59,682 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:59,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:40:59,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:40:59,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2005780760, now seen corresponding path program 1 times [2025-02-08 06:40:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:59,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640385753] [2025-02-08 06:40:59,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:01,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:41:01,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:41:01,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:01,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:01,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:01,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640385753] [2025-02-08 06:41:01,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640385753] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:01,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999834673] [2025-02-08 06:41:01,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:01,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:01,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:01,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:01,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:41:03,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:41:04,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:41:04,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:04,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:04,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 5664 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:41:04,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:04,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:04,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999834673] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:04,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:04,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 06:41:04,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743916903] [2025-02-08 06:41:04,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:04,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:41:04,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:04,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:41:04,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:41:04,450 INFO L87 Difference]: Start difference. First operand 597 states and 658 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:07,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:09,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:10,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:10,533 INFO L93 Difference]: Finished difference Result 615 states and 676 transitions. [2025-02-08 06:41:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:41:10,533 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-08 06:41:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:10,535 INFO L225 Difference]: With dead ends: 615 [2025-02-08 06:41:10,535 INFO L226 Difference]: Without dead ends: 615 [2025-02-08 06:41:10,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:41:10,536 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 10 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:10,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2083 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-02-08 06:41:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-02-08 06:41:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-02-08 06:41:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 340 states have (on average 1.611764705882353) internal successors, (548), 517 states have internal predecessors, (548), 68 states have call successors, (68), 39 states have call predecessors, (68), 33 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:41:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 676 transitions. [2025-02-08 06:41:10,546 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 676 transitions. Word has length 23 [2025-02-08 06:41:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:10,546 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 676 transitions. [2025-02-08 06:41:10,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 676 transitions. [2025-02-08 06:41:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:41:10,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:10,547 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:10,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:10,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:10,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:41:10,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:10,751 INFO L85 PathProgramCache]: Analyzing trace with hash 559267464, now seen corresponding path program 2 times [2025-02-08 06:41:10,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:10,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437414258] [2025-02-08 06:41:10,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:41:10,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:12,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-08 06:41:12,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 41 statements. [2025-02-08 06:41:12,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:41:12,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 06:41:13,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:13,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437414258] [2025-02-08 06:41:13,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437414258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:13,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:13,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:41:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766639579] [2025-02-08 06:41:13,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:13,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:41:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:13,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:41:13,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:41:13,010 INFO L87 Difference]: Start difference. First operand 615 states and 676 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:14,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:14,764 INFO L93 Difference]: Finished difference Result 623 states and 674 transitions. [2025-02-08 06:41:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:41:14,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2025-02-08 06:41:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:14,767 INFO L225 Difference]: With dead ends: 623 [2025-02-08 06:41:14,767 INFO L226 Difference]: Without dead ends: 623 [2025-02-08 06:41:14,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:41:14,767 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 235 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:14,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1069 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 06:41:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-02-08 06:41:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 613. [2025-02-08 06:41:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 340 states have (on average 1.6058823529411765) internal successors, (546), 515 states have internal predecessors, (546), 68 states have call successors, (68), 39 states have call predecessors, (68), 33 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:41:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 674 transitions. [2025-02-08 06:41:14,783 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 674 transitions. Word has length 41 [2025-02-08 06:41:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 674 transitions. [2025-02-08 06:41:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 674 transitions. [2025-02-08 06:41:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 06:41:14,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:14,784 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:41:14,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:41:14,785 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:41:14,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:14,785 INFO L85 PathProgramCache]: Analyzing trace with hash -74686921, now seen corresponding path program 1 times [2025-02-08 06:41:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:14,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784255197] [2025-02-08 06:41:14,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:14,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:16,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 06:41:16,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 06:41:16,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:16,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 06:41:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784255197] [2025-02-08 06:41:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784255197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:17,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:17,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:41:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570166907] [2025-02-08 06:41:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:17,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:41:17,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:17,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:41:17,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:41:17,154 INFO L87 Difference]: Start difference. First operand 613 states and 674 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:17,178 INFO L93 Difference]: Finished difference Result 612 states and 671 transitions. [2025-02-08 06:41:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:41:17,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2025-02-08 06:41:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:17,180 INFO L225 Difference]: With dead ends: 612 [2025-02-08 06:41:17,180 INFO L226 Difference]: Without dead ends: 612 [2025-02-08 06:41:17,180 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-02-08 06:41:17,181 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 525 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:17,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 526 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:41:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-08 06:41:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2025-02-08 06:41:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 339 states have (on average 1.6017699115044248) internal successors, (543), 514 states have internal predecessors, (543), 68 states have call successors, (68), 39 states have call predecessors, (68), 33 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:41:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 671 transitions. [2025-02-08 06:41:17,189 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 671 transitions. Word has length 64 [2025-02-08 06:41:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:17,190 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 671 transitions. [2025-02-08 06:41:17,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 671 transitions. [2025-02-08 06:41:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:41:17,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:17,191 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:41:17,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:41:17,191 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:41:17,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1241326167, now seen corresponding path program 1 times [2025-02-08 06:41:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:17,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325218556] [2025-02-08 06:41:17,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:18,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:41:18,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:41:18,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:18,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 06:41:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325218556] [2025-02-08 06:41:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325218556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:19,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:41:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757140506] [2025-02-08 06:41:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:19,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:41:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:19,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:41:19,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:41:19,624 INFO L87 Difference]: Start difference. First operand 612 states and 671 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:21,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:21,588 INFO L93 Difference]: Finished difference Result 611 states and 670 transitions. [2025-02-08 06:41:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:41:21,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2025-02-08 06:41:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:21,591 INFO L225 Difference]: With dead ends: 611 [2025-02-08 06:41:21,591 INFO L226 Difference]: Without dead ends: 611 [2025-02-08 06:41:21,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:41:21,592 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 521 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:21,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 872 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 06:41:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-02-08 06:41:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2025-02-08 06:41:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 339 states have (on average 1.59882005899705) internal successors, (542), 513 states have internal predecessors, (542), 68 states have call successors, (68), 39 states have call predecessors, (68), 33 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:41:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 670 transitions. [2025-02-08 06:41:21,603 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 670 transitions. Word has length 66 [2025-02-08 06:41:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:21,605 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 670 transitions. [2025-02-08 06:41:21,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:41:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 670 transitions. [2025-02-08 06:41:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:41:21,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:21,606 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:41:21,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:41:21,607 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:41:21,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1241326166, now seen corresponding path program 1 times [2025-02-08 06:41:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:21,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434841333] [2025-02-08 06:41:21,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:23,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:41:23,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:41:23,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:23,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 06:41:23,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:23,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434841333] [2025-02-08 06:41:23,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434841333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:23,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:23,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:41:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90166611] [2025-02-08 06:41:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:23,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:41:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:23,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:41:23,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:41:23,650 INFO L87 Difference]: Start difference. First operand 611 states and 670 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:41:25,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:25,324 INFO L93 Difference]: Finished difference Result 610 states and 669 transitions. [2025-02-08 06:41:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:41:25,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2025-02-08 06:41:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:25,326 INFO L225 Difference]: With dead ends: 610 [2025-02-08 06:41:25,327 INFO L226 Difference]: Without dead ends: 610 [2025-02-08 06:41:25,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 06:41:25,327 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:25,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 884 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 06:41:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-02-08 06:41:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2025-02-08 06:41:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 339 states have (on average 1.5958702064896755) internal successors, (541), 512 states have internal predecessors, (541), 68 states have call successors, (68), 39 states have call predecessors, (68), 33 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:41:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 669 transitions. [2025-02-08 06:41:25,337 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 669 transitions. Word has length 66 [2025-02-08 06:41:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:25,338 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 669 transitions. [2025-02-08 06:41:25,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:41:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 669 transitions. [2025-02-08 06:41:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 06:41:25,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:25,339 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-02-08 06:41:25,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:41:25,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:41:25,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash -972134402, now seen corresponding path program 1 times [2025-02-08 06:41:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:25,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937529599] [2025-02-08 06:41:25,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:25,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:27,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 06:41:27,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 06:41:27,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:27,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 06:41:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937529599] [2025-02-08 06:41:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937529599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:28,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:28,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:41:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552298069] [2025-02-08 06:41:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:28,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:41:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:28,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:41:28,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:41:28,267 INFO L87 Difference]: Start difference. First operand 610 states and 669 transitions. Second operand has 7 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:41:30,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:33,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:37,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:38,247 INFO L93 Difference]: Finished difference Result 616 states and 674 transitions. [2025-02-08 06:41:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:41:38,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 74 [2025-02-08 06:41:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:38,248 INFO L225 Difference]: With dead ends: 616 [2025-02-08 06:41:38,249 INFO L226 Difference]: Without dead ends: 616 [2025-02-08 06:41:38,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:41:38,249 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 945 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:38,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 1156 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2025-02-08 06:41:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-08 06:41:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2025-02-08 06:41:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 343 states have (on average 1.5918367346938775) internal successors, (546), 515 states have internal predecessors, (546), 68 states have call successors, (68), 40 states have call predecessors, (68), 34 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:41:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 674 transitions. [2025-02-08 06:41:38,257 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 674 transitions. Word has length 74 [2025-02-08 06:41:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:38,257 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 674 transitions. [2025-02-08 06:41:38,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:41:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 674 transitions. [2025-02-08 06:41:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 06:41:38,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:38,258 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-02-08 06:41:38,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:41:38,259 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting spin_lock_initErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:41:38,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash -972134401, now seen corresponding path program 1 times [2025-02-08 06:41:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:38,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938002178] [2025-02-08 06:41:38,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:40,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 06:41:40,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 06:41:40,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:40,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 06:41:41,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:41,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938002178] [2025-02-08 06:41:41,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938002178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:41,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:41,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:41:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075448707] [2025-02-08 06:41:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:41,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:41:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:41,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:41:41,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:41:41,472 INFO L87 Difference]: Start difference. First operand 614 states and 674 transitions. Second operand has 7 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:41:44,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:45,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:41:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:46,528 INFO L93 Difference]: Finished difference Result 614 states and 672 transitions. [2025-02-08 06:41:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:46,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 74 [2025-02-08 06:41:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:46,530 INFO L225 Difference]: With dead ends: 614 [2025-02-08 06:41:46,530 INFO L226 Difference]: Without dead ends: 614 [2025-02-08 06:41:46,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:41:46,531 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 942 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:46,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 811 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-02-08 06:41:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-02-08 06:41:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2025-02-08 06:41:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 343 states have (on average 1.58600583090379) internal successors, (544), 515 states have internal predecessors, (544), 68 states have call successors, (68), 40 states have call predecessors, (68), 34 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-08 06:41:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 672 transitions. [2025-02-08 06:41:46,539 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 672 transitions. Word has length 74 [2025-02-08 06:41:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:46,539 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 672 transitions. [2025-02-08 06:41:46,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:41:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 672 transitions. [2025-02-08 06:41:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-08 06:41:46,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:46,540 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-02-08 06:41:46,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:41:46,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-02-08 06:41:46,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:46,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1964829183, now seen corresponding path program 1 times [2025-02-08 06:41:46,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:46,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559236852] [2025-02-08 06:41:46,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms