./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.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_inb_p.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 ee91797f6143b4fe80e7c90b0707f35813b28455783da5eca6bad66702efa7d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:38:57,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:38:57,291 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:38:57,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:38:57,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:38:57,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:38:57,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:38:57,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:38:57,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:38:57,325 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:38:57,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:38:57,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:38:57,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:38:57,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:38:57,326 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:38:57,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:38:57,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:38:57,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:38:57,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:38:57,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:38:57,328 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:38:57,328 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:38:57,328 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:38:57,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:38:57,328 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:38:57,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:38:57,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:38:57,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:38:57,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:38:57,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:38:57,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:38:57,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:38:57,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:38:57,330 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 -> ee91797f6143b4fe80e7c90b0707f35813b28455783da5eca6bad66702efa7d7 [2025-02-08 06:38:57,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:38:57,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:38:57,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:38:57,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:38:57,590 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:38:57,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i [2025-02-08 06:38:58,783 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a75002ff3/ce5017b2ad444b15adde3a3ddd150c42/FLAG5d802ce20 [2025-02-08 06:38:59,194 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:38:59,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inb_p.i [2025-02-08 06:38:59,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a75002ff3/ce5017b2ad444b15adde3a3ddd150c42/FLAG5d802ce20 [2025-02-08 06:38:59,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a75002ff3/ce5017b2ad444b15adde3a3ddd150c42 [2025-02-08 06:38:59,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:38:59,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:38:59,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:38:59,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:38:59,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:38:59,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:38:59" (1/1) ... [2025-02-08 06:38:59,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9b6b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:38:59, skipping insertion in model container [2025-02-08 06:38:59,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:38:59" (1/1) ... [2025-02-08 06:38:59,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:38:59,974 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:39:00,006 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:39:00,032 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:39:00,088 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:39:00,114 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:39:00,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:39:00,154 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:39:00,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:39:00,408 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:39:00,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00 WrapperNode [2025-02-08 06:39:00,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:39:00,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:39:00,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:39:00,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:39:00,415 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:39:00" (1/1) ... [2025-02-08 06:39:00,468 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:39:00" (1/1) ... [2025-02-08 06:39:00,596 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 37, statements flattened = 3342 [2025-02-08 06:39:00,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:39:00,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:39:00,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:39:00,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:39:00,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,716 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 3, 35, 1040, 480, 59, 35, 11, 5, 15, 120, 2, 67, 2, 37, 2, 20, 4, 3, 2, 16, 18, 12, 21, 5, 0, 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, 1, 10, 120, 0, 67, 0, 25, 2, 4, 4, 0, 0, 5, 18, 6, 0, 1, 0, 4]. The 58 writes are split as follows [0, 0, 6, 0, 0, 0, 0, 5, 1, 2, 0, 1, 0, 2, 0, 0, 4, 0, 0, 0, 8, 0, 6, 21, 2, 0, 0]. [2025-02-08 06:39:00,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,795 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:39:00,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:39:00,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:39:00,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:39:00,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (1/1) ... [2025-02-08 06:39:00,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:39:00,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:39:00,892 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:39:00,896 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:39:00,917 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-02-08 06:39:00,918 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 06:39:00,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-02-08 06:39:00,918 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-02-08 06:39:00,918 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 06:39:00,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-02-08 06:39:00,918 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 06:39:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 06:39:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-02-08 06:39:00,920 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 06:39:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-02-08 06:39:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-02-08 06:39:00,923 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 06:39:00,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-08 06:39:00,924 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-02-08 06:39:00,924 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-02-08 06:39:00,924 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-08 06:39:00,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-08 06:39:00,924 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-02-08 06:39:00,924 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-02-08 06:39:00,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:39:00,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:39:00,925 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-02-08 06:39:00,925 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-02-08 06:39:00,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 06:39:00,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 06:39:00,925 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-02-08 06:39:00,925 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-02-08 06:39:00,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:39:00,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:39:00,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-02-08 06:39:00,926 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-02-08 06:39:00,926 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-02-08 06:39:00,927 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-02-08 06:39:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-08 06:39:00,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-02-08 06:39:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:39:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:39:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:39:00,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 06:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-08 06:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-02-08 06:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-02-08 06:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-02-08 06:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-02-08 06:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-02-08 06:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 06:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 06:39:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 06:39:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 06:39:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 06:39:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 06:39:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 06:39:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 06:39:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 06:39:00,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-02-08 06:39:00,934 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-02-08 06:39:00,934 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-08 06:39:00,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-02-08 06:39:00,934 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 06:39:00,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-08 06:39:00,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-08 06:39:01,335 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:39:01,337 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:39:01,564 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: havoc get_user_#t~nondet671#1;zf_write_#t~ret212#1 := get_user_#res#1;havoc get_user_#t~nondet671#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~ret212#1 && zf_write_#t~ret212#1 <= 2147483647; [2025-02-08 06:39:01,564 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: assume 86 == zf_write_~c~0#1;~zf_expect_close~0 := 42; [2025-02-08 06:39:01,564 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: assume !(86 == zf_write_~c~0#1); [2025-02-08 06:39:01,564 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1644: assume 0 != zf_write_#t~ret212#1;havoc zf_write_#t~ret212#1;zf_write_#res#1 := -14; [2025-02-08 06:39:01,564 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1644: assume !(0 != zf_write_#t~ret212#1);havoc zf_write_#t~ret212#1; [2025-02-08 06:39:01,564 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1642-1: havoc zf_write_~c~0#1;zf_write_#t~post213#1 := zf_write_~ofs~0#1;zf_write_~ofs~0#1 := 1 + zf_write_#t~post213#1;havoc zf_write_#t~post213#1; [2025-02-08 06:39:01,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: havoc #t~ret200; [2025-02-08 06:39:01,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1470: havoc #t~ret199#1; [2025-02-08 06:39:01,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3962: havoc inw_#t~nondet753#1; [2025-02-08 06:39:01,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3262: havoc put_user_#t~nondet673#1;zf_ioctl_#t~ret216#1 := put_user_#res#1;havoc put_user_#t~nondet673#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~ret216#1 && zf_ioctl_#t~ret216#1 <= 2147483647;zf_ioctl_#res#1 := zf_ioctl_#t~ret216#1;havoc zf_ioctl_#t~ret216#1; [2025-02-08 06:39:01,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1671-1: assume 0 != zf_ioctl_#t~ret215#1 % 4294967296;havoc zf_ioctl_#t~ret215#1;zf_ioctl_#res#1 := -14; [2025-02-08 06:39:01,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1671-1: assume !(0 != zf_ioctl_#t~ret215#1 % 4294967296);havoc zf_ioctl_#t~ret215#1; [2025-02-08 06:39:01,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: havoc copy_to_user_#t~nondet674#1;zf_ioctl_#t~ret215#1 := copy_to_user_#res#1;havoc copy_to_user_#t~nondet674#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:39:01,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4511: havoc test_and_set_bit_#t~bitwise794#1;zf_open_#t~ret217#1 := test_and_set_bit_#res#1;havoc test_and_set_bit_#t~bitwise791#1, test_and_set_bit_#t~mem792#1, test_and_set_bit_#t~bitwise793#1, test_and_set_bit_#t~bitwise794#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~ret217#1 && zf_open_#t~ret217#1 <= 2147483647; [2025-02-08 06:39:01,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1580: zf_timer_on_~ctrl_reg~1#1 := zf_timer_on_#t~ret205#1 % 65536;havoc zf_timer_on_#t~ret205#1; [2025-02-08 06:39:01,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1580-1: SUMMARY for call zf_timer_on_#t~ret205#1 := zf_get_control(); srcloc: null [2025-02-08 06:39:01,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581: zf_timer_on_~ctrl_reg~1#1 := zf_timer_on_#t~bitwise206#1;havoc zf_timer_on_#t~bitwise206#1; [2025-02-08 06:39:01,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-1: [2025-02-08 06:39:01,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-2: havoc zf_timer_on_#t~bitwise206#1;assume (zf_timer_on_#t~bitwise206#1 % 4294967296 >= zf_timer_on_~ctrl_reg~1#1 % 4294967296 && zf_timer_on_#t~bitwise206#1 % 4294967296 >= (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296) && zf_timer_on_#t~bitwise206#1 % 4294967296 <= zf_timer_on_~ctrl_reg~1#1 % 4294967296 + (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296; [2025-02-08 06:39:01,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-3: assume 0 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296;zf_timer_on_#t~bitwise206#1 := zf_timer_on_~ctrl_reg~1#1; [2025-02-08 06:39:01,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-3: assume !(0 == (1 + ~zf_action~0 - ~zf_action~0 % 2) % 4294967296); [2025-02-08 06:39:01,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc zf_open_#t~ret218#1;#t~ret805#1 := zf_open_#res#1;havoc zf_open_#t~ret217#1, zf_open_#t~ret218#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~ret805#1 && #t~ret805#1 <= 2147483647;#t~funptrres804#1 := #t~ret805#1; [2025-02-08 06:39:01,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-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~bitwise206#1 := 1 + ~zf_action~0 - ~zf_action~0 % 2; [2025-02-08 06:39:01,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581-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:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705-2: zf_open_#t~ret218#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~ret218#1 && zf_open_#t~ret218#1 <= 2147483647;zf_open_#res#1 := zf_open_#t~ret218#1;havoc zf_open_#t~ret218#1; [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: 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:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: SUMMARY for call zf_set_control(zf_timer_on_~ctrl_reg~1#1); srcloc: null [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1698: 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:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1698: assume !(0 != ~nowayout~0); [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525: assume zf_set_timer_#t~switch201#1; [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525: assume !zf_set_timer_#t~switch201#1; [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ##fun~$Pointer$~X~$Pointer$~TO~intFINAL: assume true; [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1583: 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:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1575: SUMMARY for call write~int#20(50 + ~jiffies~0, ~#zf_timer~0.base, ~#zf_timer~0.offset, 4); srcloc: null [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1575: assume !(1 == #valid[~#zf_timer~0.base]); [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1575: assume !(4 + ~#zf_timer~0.offset <= #length[~#zf_timer~0.base] && 0 <= ~#zf_timer~0.offset); [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: 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~switch201#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~switch201#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:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567-1: SUMMARY for call outb(255, 537); srcloc: null [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567-2: SUMMARY for call outb(15, 536); srcloc: null [2025-02-08 06:39:01,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526: SUMMARY for call outw(zf_set_timer_~new#1, 538); srcloc: null [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526-1: SUMMARY for call outb(12, 536); srcloc: null [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #res#1 := #t~funptrres804#1;havoc #t~funptrres804#1;havoc #t~ret805#1;havoc #t~ret806#1; [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: #t~ret806#1 := zf_close_#res#1;havoc zf_close_#t~ret219#1, zf_close_#t~ret220#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~ret806#1 && #t~ret806#1 <= 2147483647;#t~funptrres804#1 := #t~ret806#1; [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527: assume zf_set_timer_#t~switch201#1; [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527: assume !zf_set_timer_#t~switch201#1; [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527-1: zf_set_timer_#t~switch201#1 := zf_set_timer_#t~switch201#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:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1585: assume -2147483648 <= zf_timer_on_#t~ret207#1 && zf_timer_on_#t~ret207#1 <= 2147483647;havoc zf_timer_on_#t~ret207#1;havoc zf_timer_on_#t~ret205#1, zf_timer_on_#t~bitwise206#1, zf_timer_on_#t~ret207#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:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1585-1: SUMMARY for call zf_timer_on_#t~ret207#1 := printk(11, 0); srcloc: null [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1577: SUMMARY for call add_timer(~#zf_timer~0.base, ~#zf_timer~0.offset); srcloc: null [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701: assume { :begin_inline_zf_timer_on } true;havoc zf_timer_on_#t~ret205#1, zf_timer_on_#t~bitwise206#1, zf_timer_on_#t~ret207#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:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701-1: SUMMARY for call spin_unlock(~#zf_lock~0.base, ~#zf_lock~0.offset); srcloc: null [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693: assume 0 != zf_open_#t~ret217#1;havoc zf_open_#t~ret217#1; [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693: assume !(0 != zf_open_#t~ret217#1);havoc zf_open_#t~ret217#1; [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528: 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:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528-1: SUMMARY for call outb(14, 536); srcloc: null [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1694: zf_open_#res#1 := -16; [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1694-1: SUMMARY for call spin_unlock(~#zf_lock~0.base, ~#zf_lock~0.offset); srcloc: null [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529: assume zf_set_timer_#t~switch201#1; [2025-02-08 06:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529: assume !zf_set_timer_#t~switch201#1;havoc zf_set_timer_#t~switch201#1;havoc zf_set_timer_#t~switch201#1;havoc zf_set_timer_#t~switch201#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:39:01,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529-1: zf_set_timer_#t~switch201#1 := true; [2025-02-08 06:39:05,927 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc misc_register_#t~ret713#1;zf_init_#t~ret227#1 := misc_register_#res#1;havoc misc_register_#t~post709#1, misc_register_#t~mem710#1.base, misc_register_#t~mem710#1.offset, misc_register_#t~mem711#1, misc_register_#t~bitwise712#1, misc_register_#t~ret713#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~ret227#1 && zf_init_#t~ret227#1 <= 2147483647;zf_init_~ret~3#1 := zf_init_#t~ret227#1;havoc zf_init_#t~ret227#1; [2025-02-08 06:39:05,927 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1821: havoc init_timer_#t~post766#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:39:05,927 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: 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:39:05,927 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: assume !(1 == #valid[~#zf_timer~0.base]); [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: assume !(4 + (4 + ~#zf_timer~0.offset) <= #length[~#zf_timer~0.base] && 0 <= 4 + ~#zf_timer~0.offset); [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823: zf_init_#res#1 := 0; [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-1: SUMMARY for call write~int#20(0, ~#zf_timer~0.base, 8 + ~#zf_timer~0.offset, 4); srcloc: null [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-1: assume !(1 == #valid[~#zf_timer~0.base]); [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823-1: assume !(4 + (8 + ~#zf_timer~0.offset) <= #length[~#zf_timer~0.base] && 0 <= 8 + ~#zf_timer~0.offset); [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: SUMMARY for call release_region(536, 3); srcloc: null [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830: assume -2147483648 <= zf_init_#t~ret233#1 && zf_init_#t~ret233#1 <= 2147483647;zf_init_#res#1 := zf_init_~ret~3#1; [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-1: SUMMARY for call zf_init_#t~ret233#1 := misc_deregister(~#zf_miscdev~0.base, ~#zf_miscdev~0.offset); srcloc: null [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1797: assume 0 != zf_init_~ret~3#1; [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1797: assume !(0 != zf_init_~ret~3#1); [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: havoc zf_set_status_~new#1;havoc zf_set_status_#in~new#1;assume { :end_inline_zf_set_status } true; [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500-1: SUMMARY for call outb(zf_set_status_~new#1, 537); srcloc: null [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500-2: SUMMARY for call outb(18, 536); srcloc: null [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1798: assume -2147483648 <= zf_init_#t~ret228#1 && zf_init_#t~ret228#1 <= 2147483647;havoc zf_init_#t~ret228#1; [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1798-1: SUMMARY for call zf_init_#t~ret228#1 := printk(22, 0); srcloc: null [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4246: assume ~number_timer_registered~0 < 1; [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4246: assume !(~number_timer_registered~0 < 1); [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: 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:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: assume !(1 == #valid[init_timer_~timer#1.base]); [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: 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:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803: assume zf_init_#t~ret229#1.base == 0 && zf_init_#t~ret229#1.offset == 0;havoc zf_init_#t~ret229#1.base, zf_init_#t~ret229#1.offset; [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803: assume !(zf_init_#t~ret229#1.base == 0 && zf_init_#t~ret229#1.offset == 0);havoc zf_init_#t~ret229#1.base, zf_init_#t~ret229#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~ret231#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~ret231#1 && zf_init_#t~ret231#1 <= 2147483647;zf_init_~ret~3#1 := zf_init_#t~ret231#1;havoc zf_init_#t~ret231#1; [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803-1: SUMMARY for call zf_init_#t~ret229#1.base, zf_init_#t~ret229#1.offset := request_region(536, 3, 23, 0); srcloc: null [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4248: 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:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4248: assume !(1 == #valid[init_timer_~timer#1.base]); [2025-02-08 06:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4248: 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:39:05,928 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1804: assume -2147483648 <= zf_init_#t~ret230#1 && zf_init_#t~ret230#1 <= 2147483647;havoc zf_init_#t~ret230#1;zf_init_~ret~3#1 := -16; [2025-02-08 06:39:05,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1804-1: SUMMARY for call zf_init_#t~ret230#1 := printk(24, 0); srcloc: null [2025-02-08 06:39:05,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4249: init_timer_#t~post766#1 := ~number_timer_registered~0;~number_timer_registered~0 := 1 + init_timer_#t~post766#1;havoc init_timer_#t~post766#1; [2025-02-08 06:39:05,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4249-1: SUMMARY for call write~$Pointer$#8(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:39:05,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4249-1: assume !(1 == #valid[~#timer_registered~0.base]); [2025-02-08 06:39:05,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4249-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:39:05,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1811: assume 0 != zf_init_~ret~3#1; [2025-02-08 06:39:05,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1811: 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:39:05,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812: assume -2147483648 <= zf_init_#t~ret232#1 && zf_init_#t~ret232#1 <= 2147483647;havoc zf_init_#t~ret232#1; [2025-02-08 06:39:05,929 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-1: SUMMARY for call zf_init_#t~ret232#1 := printk(25, 0); srcloc: null [2025-02-08 06:39:05,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772: call_cdev_functions_#t~ret327#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_#~320#1.base, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~320#1.offset, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#~321#1, ##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_#t~ret801#1;havoc ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~320#1.base, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~320#1.offset, ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#in~321#1, ##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~#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~ret327#1 && call_cdev_functions_#t~ret327#1 <= 9223372036854775807;havoc call_cdev_functions_#t~mem323#1;havoc call_cdev_functions_#t~mem324#1.base, call_cdev_functions_#t~mem324#1.offset;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~ret327#1; [2025-02-08 06:39:05,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret801#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~ret801#1 && ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret801#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~ret801#1;havoc ##fun~$Pointer$~X~~loff_t~0~X~int~TO~~loff_t~0_#t~ret801#1; [2025-02-08 06:39:05,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1818: 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~post766#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:39:05,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1818-1: SUMMARY for call zf_set_control(0); srcloc: null [2025-02-08 06:39:06,045 INFO L? ?]: Removed 585 outVars from TransFormulas that were not future-live. [2025-02-08 06:39:06,045 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:39:06,083 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:39:06,085 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:39:06,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:39:06 BoogieIcfgContainer [2025-02-08 06:39:06,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:39:06,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:39:06,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:39:06,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:39:06,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:38:59" (1/3) ... [2025-02-08 06:39:06,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529b536d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:39:06, skipping insertion in model container [2025-02-08 06:39:06,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:39:00" (2/3) ... [2025-02-08 06:39:06,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@529b536d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:39:06, skipping insertion in model container [2025-02-08 06:39:06,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:39:06" (3/3) ... [2025-02-08 06:39:06,094 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inb_p.i [2025-02-08 06:39:06,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:39:06,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_inb_p.i that has 29 procedures, 606 locations, 1 initial locations, 4 loop locations, and 205 error locations. [2025-02-08 06:39:06,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:39:06,164 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;@1cce39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:39:06,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2025-02-08 06:39:06,168 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:39:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:39:06,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:39:06,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:39:06,173 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:39:06,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:39:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash 29167501, now seen corresponding path program 1 times [2025-02-08 06:39:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:39:06,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021019706] [2025-02-08 06:39:06,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:39:06,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:39:08,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:39:08,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:39:08,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:39:08,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:39:09,560 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:39:09,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:39:09,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021019706] [2025-02-08 06:39:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021019706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:39:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:39:09,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:39:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805768479] [2025-02-08 06:39:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:39:09,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:39:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:39:09,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:39:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:39:09,590 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:39:11,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:13,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:39:14,173 INFO L93 Difference]: Finished difference Result 600 states and 693 transitions. [2025-02-08 06:39:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:39:14,175 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:39:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:39:14,183 INFO L225 Difference]: With dead ends: 600 [2025-02-08 06:39:14,184 INFO L226 Difference]: Without dead ends: 526 [2025-02-08 06:39:14,189 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:39:14,191 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 622 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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, 4.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:39:14,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1282 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-08 06:39:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-08 06:39:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2025-02-08 06:39:14,236 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:39:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 571 transitions. [2025-02-08 06:39:14,240 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 571 transitions. Word has length 4 [2025-02-08 06:39:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:39:14,241 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 571 transitions. [2025-02-08 06:39:14,241 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:39:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 571 transitions. [2025-02-08 06:39:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:39:14,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:39:14,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:39:14,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:39:14,241 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:39:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:39:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash 29167502, now seen corresponding path program 1 times [2025-02-08 06:39:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:39:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823626728] [2025-02-08 06:39:14,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:39:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:39:15,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:39:16,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:39:16,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:39:16,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:39:16,964 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:39:16,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:39:16,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823626728] [2025-02-08 06:39:16,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823626728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:39:16,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:39:16,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:39:16,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093226354] [2025-02-08 06:39:16,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:39:16,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:39:16,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:39:16,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:39:16,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:39:16,966 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:39:18,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:19,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:39:20,541 INFO L93 Difference]: Finished difference Result 614 states and 669 transitions. [2025-02-08 06:39:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:39:20,541 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:39:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:39:20,543 INFO L225 Difference]: With dead ends: 614 [2025-02-08 06:39:20,543 INFO L226 Difference]: Without dead ends: 608 [2025-02-08 06:39:20,544 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:39:20,544 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 261 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:39:20,544 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.5s Time] [2025-02-08 06:39:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-02-08 06:39:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 598. [2025-02-08 06:39:20,559 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:39:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 661 transitions. [2025-02-08 06:39:20,562 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 661 transitions. Word has length 4 [2025-02-08 06:39:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:39:20,562 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 661 transitions. [2025-02-08 06:39:20,562 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:39:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 661 transitions. [2025-02-08 06:39:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:39:20,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:39:20,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:39:20,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:39:20,563 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:39:20,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:39:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1839273248, now seen corresponding path program 1 times [2025-02-08 06:39:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:39:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935860886] [2025-02-08 06:39:20,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:39:20,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:39:22,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:39:22,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:39:22,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:39:22,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:39:22,700 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:39:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:39:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935860886] [2025-02-08 06:39:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935860886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:39:22,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:39:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:39:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802972171] [2025-02-08 06:39:22,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:39:22,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:39:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:39:22,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:39:22,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:39:22,701 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:39:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:39:22,909 INFO L93 Difference]: Finished difference Result 593 states and 656 transitions. [2025-02-08 06:39:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:39:22,909 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:39:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:39:22,911 INFO L225 Difference]: With dead ends: 593 [2025-02-08 06:39:22,911 INFO L226 Difference]: Without dead ends: 593 [2025-02-08 06:39:22,911 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:39:22,912 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:39:22,912 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:39:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-08 06:39:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-02-08 06:39:22,932 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:39:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 656 transitions. [2025-02-08 06:39:22,935 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 656 transitions. Word has length 10 [2025-02-08 06:39:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:39:22,935 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 656 transitions. [2025-02-08 06:39:22,935 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:39:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 656 transitions. [2025-02-08 06:39:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:39:22,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:39:22,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:39:22,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:39:22,936 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:39:22,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:39:22,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1839273249, now seen corresponding path program 1 times [2025-02-08 06:39:22,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:39:22,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887302534] [2025-02-08 06:39:22,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:39:22,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:39:24,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:39:24,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:39:24,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:39:24,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:39:25,261 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:39:25,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:39:25,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887302534] [2025-02-08 06:39:25,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887302534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:39:25,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:39:25,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:39:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906915191] [2025-02-08 06:39:25,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:39:25,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:39:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:39:25,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:39:25,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:39:25,262 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:39:29,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:39:29,907 INFO L93 Difference]: Finished difference Result 612 states and 667 transitions. [2025-02-08 06:39:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:39:29,907 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:39:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:39:29,910 INFO L225 Difference]: With dead ends: 612 [2025-02-08 06:39:29,910 INFO L226 Difference]: Without dead ends: 612 [2025-02-08 06:39:29,910 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:39:29,910 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 259 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:39:29,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1087 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 490 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-08 06:39:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-08 06:39:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 596. [2025-02-08 06:39:29,923 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:39:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 659 transitions. [2025-02-08 06:39:29,927 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 659 transitions. Word has length 10 [2025-02-08 06:39:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:39:29,927 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 659 transitions. [2025-02-08 06:39:29,927 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:39:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 659 transitions. [2025-02-08 06:39:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:39:29,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:39:29,927 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:39:29,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:39:29,928 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:39:29,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:39:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1402559220, now seen corresponding path program 1 times [2025-02-08 06:39:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:39:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38836716] [2025-02-08 06:39:29,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:39:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:39:31,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:39:31,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:39:31,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:39:31,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:39:32,366 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:39:32,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:39:32,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38836716] [2025-02-08 06:39:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38836716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:39:32,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894066468] [2025-02-08 06:39:32,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:39:32,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:39:32,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:39:32,370 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:39:32,371 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:39:34,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:39:34,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:39:34,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:39:34,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:39:34,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 5604 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 06:39:34,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:39:35,062 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:39:35,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:39:35,158 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:39:35,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894066468] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:39:35,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:39:35,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-02-08 06:39:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676035578] [2025-02-08 06:39:35,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:39:35,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:39:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:39:35,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:39:35,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:39:35,159 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:39:37,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:40,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:42,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:44,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:46,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:39:47,867 INFO L93 Difference]: Finished difference Result 616 states and 667 transitions. [2025-02-08 06:39:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:39:47,867 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:39:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:39:47,869 INFO L225 Difference]: With dead ends: 616 [2025-02-08 06:39:47,869 INFO L226 Difference]: Without dead ends: 616 [2025-02-08 06:39:47,870 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:39:47,870 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 468 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s 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, 12.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:39:47,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2346 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2025-02-08 06:39:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-08 06:39:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 606. [2025-02-08 06:39:47,889 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:39:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 667 transitions. [2025-02-08 06:39:47,891 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 667 transitions. Word has length 13 [2025-02-08 06:39:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:39:47,892 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 667 transitions. [2025-02-08 06:39:47,892 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:39:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 667 transitions. [2025-02-08 06:39:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:39:47,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:39:47,893 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:39:47,914 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:39:48,097 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:39:48,097 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:39:48,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:39:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2005780761, now seen corresponding path program 1 times [2025-02-08 06:39:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:39:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626745213] [2025-02-08 06:39:48,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:39:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:39:49,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:39:49,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:39:49,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:39:49,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:39:50,237 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:39:50,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:39:50,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626745213] [2025-02-08 06:39:50,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626745213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:39:50,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:39:50,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:39:50,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973839283] [2025-02-08 06:39:50,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:39:50,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:39:50,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:39:50,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:39:50,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:39:50,238 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:39:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:39:50,469 INFO L93 Difference]: Finished difference Result 597 states and 658 transitions. [2025-02-08 06:39:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:39:50,469 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:39:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:39:50,471 INFO L225 Difference]: With dead ends: 597 [2025-02-08 06:39:50,471 INFO L226 Difference]: Without dead ends: 597 [2025-02-08 06:39:50,471 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:39:50,471 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:39:50,471 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:39:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-08 06:39:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-02-08 06:39:50,490 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:39:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 658 transitions. [2025-02-08 06:39:50,492 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 658 transitions. Word has length 23 [2025-02-08 06:39:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:39:50,492 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 658 transitions. [2025-02-08 06:39:50,492 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:39:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 658 transitions. [2025-02-08 06:39:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:39:50,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:39:50,492 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:39:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:39:50,493 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:39:50,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:39:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2005780760, now seen corresponding path program 1 times [2025-02-08 06:39:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:39:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809818505] [2025-02-08 06:39:50,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:39:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:39:52,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:39:52,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:39:52,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:39:52,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:39:52,606 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:39:52,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:39:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809818505] [2025-02-08 06:39:52,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809818505] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:39:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138337867] [2025-02-08 06:39:52,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:39:52,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:39:52,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:39:52,611 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:39:52,614 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:39:54,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:39:55,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:39:55,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:39:55,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:39:55,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 5664 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:39:55,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:39:55,131 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:39:55,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:39:55,205 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:39:55,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138337867] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:39:55,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:39:55,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 06:39:55,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004574585] [2025-02-08 06:39:55,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:39:55,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:39:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:39:55,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:39:55,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:39:55,206 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:39:58,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:39:59,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:02,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:02,314 INFO L93 Difference]: Finished difference Result 615 states and 676 transitions. [2025-02-08 06:40:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:40:02,315 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:40:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:02,316 INFO L225 Difference]: With dead ends: 615 [2025-02-08 06:40:02,316 INFO L226 Difference]: Without dead ends: 615 [2025-02-08 06:40:02,317 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:40:02,317 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 10 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.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, 7.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:02,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2083 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-02-08 06:40:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-02-08 06:40:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-02-08 06:40:02,326 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:40:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 676 transitions. [2025-02-08 06:40:02,329 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 676 transitions. Word has length 23 [2025-02-08 06:40:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:02,329 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 676 transitions. [2025-02-08 06:40:02,329 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:40:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 676 transitions. [2025-02-08 06:40:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:40:02,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:02,330 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:02,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:40:02,535 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:40:02,535 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:40:02,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 559267464, now seen corresponding path program 2 times [2025-02-08 06:40:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:02,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941078724] [2025-02-08 06:40:02,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:40:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:04,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-08 06:40:04,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 41 statements. [2025-02-08 06:40:04,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:40:04,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:04,669 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:40:04,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:04,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941078724] [2025-02-08 06:40:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941078724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:04,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:40:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348631924] [2025-02-08 06:40:04,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:04,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:40:04,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:04,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:40:04,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:40:04,670 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:40:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:06,030 INFO L93 Difference]: Finished difference Result 623 states and 674 transitions. [2025-02-08 06:40:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:40:06,030 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:40:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:06,032 INFO L225 Difference]: With dead ends: 623 [2025-02-08 06:40:06,032 INFO L226 Difference]: Without dead ends: 623 [2025-02-08 06:40:06,032 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:06,033 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 235 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:06,033 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.3s Time] [2025-02-08 06:40:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-02-08 06:40:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 613. [2025-02-08 06:40:06,040 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:40:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 674 transitions. [2025-02-08 06:40:06,042 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 674 transitions. Word has length 41 [2025-02-08 06:40:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:06,042 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 674 transitions. [2025-02-08 06:40:06,042 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:40:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 674 transitions. [2025-02-08 06:40:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 06:40:06,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:06,043 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:40:06,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:40:06,044 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:40:06,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -74686921, now seen corresponding path program 1 times [2025-02-08 06:40:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:06,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512233809] [2025-02-08 06:40:06,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:06,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:07,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 06:40:07,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 06:40:07,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:07,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:08,349 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:40:08,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:08,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512233809] [2025-02-08 06:40:08,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512233809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:08,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:08,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:40:08,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44158924] [2025-02-08 06:40:08,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:08,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:08,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:08,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:08,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:08,351 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:40:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:08,412 INFO L93 Difference]: Finished difference Result 612 states and 671 transitions. [2025-02-08 06:40:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:08,413 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:40:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:08,417 INFO L225 Difference]: With dead ends: 612 [2025-02-08 06:40:08,417 INFO L226 Difference]: Without dead ends: 612 [2025-02-08 06:40:08,417 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:40:08,419 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:08,419 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.1s Time] [2025-02-08 06:40:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-08 06:40:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2025-02-08 06:40:08,429 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:40:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 671 transitions. [2025-02-08 06:40:08,430 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 671 transitions. Word has length 64 [2025-02-08 06:40:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:08,431 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 671 transitions. [2025-02-08 06:40:08,431 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:40:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 671 transitions. [2025-02-08 06:40:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:40:08,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:08,433 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:40:08,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:40:08,434 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:40:08,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1241326167, now seen corresponding path program 1 times [2025-02-08 06:40:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:08,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305651485] [2025-02-08 06:40:08,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:10,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:40:10,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:40:10,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:10,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:10,913 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:40:10,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:10,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305651485] [2025-02-08 06:40:10,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305651485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:10,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:10,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:40:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816628754] [2025-02-08 06:40:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:10,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:40:10,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:10,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:40:10,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:40:10,915 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:40:12,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:12,521 INFO L93 Difference]: Finished difference Result 611 states and 670 transitions. [2025-02-08 06:40:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:40:12,521 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:40:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:12,523 INFO L225 Difference]: With dead ends: 611 [2025-02-08 06:40:12,523 INFO L226 Difference]: Without dead ends: 611 [2025-02-08 06:40:12,523 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:40:12,524 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 521 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:12,524 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.6s Time] [2025-02-08 06:40:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-02-08 06:40:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2025-02-08 06:40:12,532 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:40:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 670 transitions. [2025-02-08 06:40:12,534 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 670 transitions. Word has length 66 [2025-02-08 06:40:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:12,534 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 670 transitions. [2025-02-08 06:40:12,534 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:40:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 670 transitions. [2025-02-08 06:40:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:40:12,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:12,535 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:40:12,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:40:12,535 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:40:12,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1241326166, now seen corresponding path program 1 times [2025-02-08 06:40:12,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:12,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923989395] [2025-02-08 06:40:12,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:14,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 06:40:14,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:40:14,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:14,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:14,580 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:40:14,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:14,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923989395] [2025-02-08 06:40:14,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923989395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:14,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:14,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:40:14,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357378818] [2025-02-08 06:40:14,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:14,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:14,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:14,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:14,582 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:40:16,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:16,628 INFO L93 Difference]: Finished difference Result 610 states and 669 transitions. [2025-02-08 06:40:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:16,628 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:40:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:16,630 INFO L225 Difference]: With dead ends: 610 [2025-02-08 06:40:16,630 INFO L226 Difference]: Without dead ends: 610 [2025-02-08 06:40:16,630 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:16,631 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:16,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 884 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-08 06:40:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-02-08 06:40:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2025-02-08 06:40:16,644 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:40:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 669 transitions. [2025-02-08 06:40:16,653 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 669 transitions. Word has length 66 [2025-02-08 06:40:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:16,653 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 669 transitions. [2025-02-08 06:40:16,654 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:40:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 669 transitions. [2025-02-08 06:40:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 06:40:16,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:16,654 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:40:16,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:40:16,654 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:40:16,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:16,655 INFO L85 PathProgramCache]: Analyzing trace with hash -972134402, now seen corresponding path program 1 times [2025-02-08 06:40:16,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:16,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847887319] [2025-02-08 06:40:16,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:16,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:18,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 06:40:18,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 06:40:18,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:18,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:19,389 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:40:19,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847887319] [2025-02-08 06:40:19,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847887319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:19,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:19,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:40:19,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113589435] [2025-02-08 06:40:19,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:19,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:40:19,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:19,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:40:19,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:40:19,395 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:40:20,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:23,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 06:40:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:24,613 INFO L93 Difference]: Finished difference Result 616 states and 674 transitions. [2025-02-08 06:40:24,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:40:24,613 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:40:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:24,615 INFO L225 Difference]: With dead ends: 616 [2025-02-08 06:40:24,615 INFO L226 Difference]: Without dead ends: 616 [2025-02-08 06:40:24,616 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:40:24,616 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 945 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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, 5.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:24,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 1156 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-02-08 06:40:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-08 06:40:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2025-02-08 06:40:24,623 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:40:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 674 transitions. [2025-02-08 06:40:24,624 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 674 transitions. Word has length 74 [2025-02-08 06:40:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:24,624 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 674 transitions. [2025-02-08 06:40:24,624 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:40:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 674 transitions. [2025-02-08 06:40:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 06:40:24,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:24,625 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:40:24,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:40:24,625 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:40:24,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash -972134401, now seen corresponding path program 1 times [2025-02-08 06:40:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:24,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80395459] [2025-02-08 06:40:24,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:26,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 06:40:26,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 06:40:26,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:26,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:27,574 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:40:27,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80395459] [2025-02-08 06:40:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80395459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:40:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670412253] [2025-02-08 06:40:27,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:27,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:40:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:27,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:40:27,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:40:27,575 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:40:30,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []