./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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_inw_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 cd6b300b335accb35f3a48bfd0f387908f589dfb4e32ea4d19ee0b855e6625b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:38:36,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:38:36,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:38:36,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:38:36,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:38:36,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:38:36,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:38:36,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:38:36,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:38:36,436 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:38:36,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:38:36,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:38:36,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:38:36,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:38:36,438 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:38:36,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:38:36,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:38:36,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:38:36,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:38:36,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:38:36,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:38:36,439 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:38:36,439 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:38:36,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:38:36,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:38:36,440 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:38:36,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:38:36,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:38:36,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:38:36,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:38:36,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:38:36,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:38:36,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:38:36,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:38:36,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:38:36,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:38:36,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:38:36,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:38:36,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:38:36,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:38:36,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:38:36,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:38:36,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:38:36,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:38:36,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:38:36,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:38:36,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:38:36,442 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 -> cd6b300b335accb35f3a48bfd0f387908f589dfb4e32ea4d19ee0b855e6625b4 [2025-01-09 22:38:36,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:38:36,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:38:36,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:38:36,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:38:36,730 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:38:36,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i [2025-01-09 22:38:38,017 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1c855fae/f7f3e97bda5841178a0d25d93a89fc46/FLAG7555b2058 [2025-01-09 22:38:38,409 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:38:38,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw_p.i [2025-01-09 22:38:38,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1c855fae/f7f3e97bda5841178a0d25d93a89fc46/FLAG7555b2058 [2025-01-09 22:38:38,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1c855fae/f7f3e97bda5841178a0d25d93a89fc46 [2025-01-09 22:38:38,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:38:38,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:38:38,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:38:38,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:38:38,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:38:38,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:38:38" (1/1) ... [2025-01-09 22:38:38,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:38, skipping insertion in model container [2025-01-09 22:38:38,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:38:38" (1/1) ... [2025-01-09 22:38:38,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:38:39,323 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:39,343 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:39,369 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:39,446 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:39,481 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:38:39,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:38:39,551 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:38:39,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:38:39,933 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:38:39,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39 WrapperNode [2025-01-09 22:38:39,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:38:39,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:38:39,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:38:39,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:38:39,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,148 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 37, statements flattened = 3342 [2025-01-09 22:38:40,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:38:40,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:38:40,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:38:40,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:38:40,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,338 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [12, 5, 37, 3, 35, 1040, 2, 480, 59, 35, 11, 5, 15, 120, 67, 2, 20, 4, 18, 2, 0, 21, 2, 16, 5, 3, 5]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [6, 3, 25, 3, 15, 1040, 0, 480, 59, 32, 2, 1, 10, 120, 67, 2, 4, 4, 18, 0, 0, 0, 0, 5, 1, 0, 4]. The 58 writes are split as follows [6, 0, 0, 0, 6, 0, 0, 0, 0, 0, 5, 1, 2, 0, 0, 0, 4, 0, 0, 1, 0, 21, 2, 8, 2, 0, 0]. [2025-01-09 22:38:40,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:38:40,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:38:40,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:38:40,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:38:40,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (1/1) ... [2025-01-09 22:38:40,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:38:40,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:38:40,549 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-01-09 22:38:40,555 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-01-09 22:38:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-01-09 22:38:40,574 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-01-09 22:38:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 22:38:40,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-01-09 22:38:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-09 22:38:40,574 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-09 22:38:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:38:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 22:38:40,574 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 22:38:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 22:38:40,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-01-09 22:38:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-01-09 22:38:40,575 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-01-09 22:38:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 22:38:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 22:38:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 22:38:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 22:38:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 22:38:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 22:38:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-01-09 22:38:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-01-09 22:38:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-01-09 22:38:40,578 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 22:38:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 22:38:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-01-09 22:38:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-01-09 22:38:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-01-09 22:38:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-01-09 22:38:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-01-09 22:38:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 22:38:40,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 22:38:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-01-09 22:38:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-01-09 22:38:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-01-09 22:38:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-01-09 22:38:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-01-09 22:38:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-01-09 22:38:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:38:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:38:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-01-09 22:38:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-01-09 22:38:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 22:38:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 22:38:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-01-09 22:38:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 22:38:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-01-09 22:38:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-01-09 22:38:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-01-09 22:38:40,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 22:38:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 22:38:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-01-09 22:38:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-01-09 22:38:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-01-09 22:38:40,584 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-01-09 22:38:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-01-09 22:38:40,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-01-09 22:38:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-01-09 22:38:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 22:38:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-01-09 22:38:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-01-09 22:38:40,587 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-01-09 22:38:40,588 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-01-09 22:38:40,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 22:38:40,588 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 22:38:40,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-01-09 22:38:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-01-09 22:38:41,062 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:38:41,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:38:47,585 INFO L? ?]: Removed 648 outVars from TransFormulas that were not future-live. [2025-01-09 22:38:47,586 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:38:47,632 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:38:47,632 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:38:47,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:38:47 BoogieIcfgContainer [2025-01-09 22:38:47,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:38:47,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:38:47,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:38:47,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:38:47,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:38:38" (1/3) ... [2025-01-09 22:38:47,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a917f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:38:47, skipping insertion in model container [2025-01-09 22:38:47,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:38:39" (2/3) ... [2025-01-09 22:38:47,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a917f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:38:47, skipping insertion in model container [2025-01-09 22:38:47,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:38:47" (3/3) ... [2025-01-09 22:38:47,647 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inw_p.i [2025-01-09 22:38:47,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:38:47,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_inw_p.i that has 29 procedures, 701 locations, 1 initial locations, 4 loop locations, and 205 error locations. [2025-01-09 22:38:47,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:38:47,733 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;@6be097da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:38:47,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 205 error locations. [2025-01-09 22:38:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 697 states, 387 states have (on average 1.7881136950904393) internal successors, (692), 598 states have internal predecessors, (692), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 22:38:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:38:47,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:38:47,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:38:47,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:38:47,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:38:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash 451259655, now seen corresponding path program 1 times [2025-01-09 22:38:47,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:38:47,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611417805] [2025-01-09 22:38:47,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:47,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:38:50,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:38:50,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:38:50,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:50,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:51,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:51,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611417805] [2025-01-09 22:38:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611417805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:38:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:38:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:38:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551870923] [2025-01-09 22:38:51,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:38:51,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:38:51,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:51,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:38:51,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:38:51,635 INFO L87 Difference]: Start difference. First operand has 697 states, 387 states have (on average 1.7881136950904393) internal successors, (692), 598 states have internal predecessors, (692), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:38:52,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:38:54,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:38:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:38:56,129 INFO L93 Difference]: Finished difference Result 1261 states and 1525 transitions. [2025-01-09 22:38:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:38:56,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-01-09 22:38:56,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:38:56,152 INFO L225 Difference]: With dead ends: 1261 [2025-01-09 22:38:56,153 INFO L226 Difference]: Without dead ends: 1257 [2025-01-09 22:38:56,154 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-01-09 22:38:56,159 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 723 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:38:56,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 2543 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 22:38:56,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-01-09 22:38:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1044. [2025-01-09 22:38:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 651 states have (on average 1.771121351766513) internal successors, (1153), 873 states have internal predecessors, (1153), 138 states have call successors, (138), 50 states have call predecessors, (138), 50 states have return successors, (138), 131 states have call predecessors, (138), 138 states have call successors, (138) [2025-01-09 22:38:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1429 transitions. [2025-01-09 22:38:56,273 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1429 transitions. Word has length 5 [2025-01-09 22:38:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:38:56,273 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1429 transitions. [2025-01-09 22:38:56,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:38:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1429 transitions. [2025-01-09 22:38:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:38:56,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:38:56,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:38:56,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:38:56,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:38:56,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:38:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash 451259656, now seen corresponding path program 1 times [2025-01-09 22:38:56,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:38:56,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505609286] [2025-01-09 22:38:56,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:38:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:38:58,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:38:58,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:38:58,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:38:58,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:38:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:38:59,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:38:59,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505609286] [2025-01-09 22:38:59,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505609286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:38:59,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:38:59,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:38:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30877474] [2025-01-09 22:38:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:38:59,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:38:59,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:38:59,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:38:59,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:38:59,903 INFO L87 Difference]: Start difference. First operand 1044 states and 1429 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:39:01,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:02,838 INFO L93 Difference]: Finished difference Result 1183 states and 1531 transitions. [2025-01-09 22:39:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:39:02,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-01-09 22:39:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:02,846 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 22:39:02,846 INFO L226 Difference]: Without dead ends: 1183 [2025-01-09 22:39:02,846 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-01-09 22:39:02,847 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 279 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:02,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 2807 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 22:39:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-01-09 22:39:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1124. [2025-01-09 22:39:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 699 states have (on average 1.7353361945636623) internal successors, (1213), 922 states have internal predecessors, (1213), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 22:39:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1527 transitions. [2025-01-09 22:39:02,902 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1527 transitions. Word has length 5 [2025-01-09 22:39:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:02,902 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1527 transitions. [2025-01-09 22:39:02,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:39:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1527 transitions. [2025-01-09 22:39:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:39:02,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:02,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:02,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:39:02,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:02,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:02,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2014150784, now seen corresponding path program 1 times [2025-01-09 22:39:02,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:02,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873577267] [2025-01-09 22:39:02,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:02,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:04,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:39:04,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:39:04,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:04,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:05,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:05,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873577267] [2025-01-09 22:39:05,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873577267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:05,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:05,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:39:05,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516249903] [2025-01-09 22:39:05,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:05,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:05,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:05,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:05,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:05,452 INFO L87 Difference]: Start difference. First operand 1124 states and 1527 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-01-09 22:39:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:06,054 INFO L93 Difference]: Finished difference Result 1330 states and 1614 transitions. [2025-01-09 22:39:06,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:06,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2025-01-09 22:39:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:06,063 INFO L225 Difference]: With dead ends: 1330 [2025-01-09 22:39:06,065 INFO L226 Difference]: Without dead ends: 1330 [2025-01-09 22:39:06,065 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-01-09 22:39:06,066 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 705 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:06,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1336 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:39:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-01-09 22:39:06,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1123. [2025-01-09 22:39:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 699 states have (on average 1.7281831187410586) internal successors, (1208), 921 states have internal predecessors, (1208), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 22:39:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1522 transitions. [2025-01-09 22:39:06,126 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1522 transitions. Word has length 11 [2025-01-09 22:39:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:06,126 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1522 transitions. [2025-01-09 22:39:06,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-01-09 22:39:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1522 transitions. [2025-01-09 22:39:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 22:39:06,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:06,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:06,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:39:06,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:06,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2014150785, now seen corresponding path program 1 times [2025-01-09 22:39:06,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:06,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313921325] [2025-01-09 22:39:06,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:06,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:07,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 22:39:07,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 22:39:07,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:07,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313921325] [2025-01-09 22:39:08,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313921325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:08,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:08,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:08,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938930685] [2025-01-09 22:39:08,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:08,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:39:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:08,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:39:08,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:39:08,736 INFO L87 Difference]: Start difference. First operand 1123 states and 1522 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-01-09 22:39:10,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:10,938 INFO L93 Difference]: Finished difference Result 1187 states and 1537 transitions. [2025-01-09 22:39:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:39:10,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-01-09 22:39:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:10,946 INFO L225 Difference]: With dead ends: 1187 [2025-01-09 22:39:10,946 INFO L226 Difference]: Without dead ends: 1187 [2025-01-09 22:39:10,947 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-01-09 22:39:10,948 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 277 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:10,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2127 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 22:39:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-01-09 22:39:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1126. [2025-01-09 22:39:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 702 states have (on average 1.725071225071225) internal successors, (1211), 924 states have internal predecessors, (1211), 157 states have call successors, (157), 63 states have call predecessors, (157), 63 states have return successors, (157), 150 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 22:39:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1525 transitions. [2025-01-09 22:39:10,986 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1525 transitions. Word has length 11 [2025-01-09 22:39:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:10,986 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1525 transitions. [2025-01-09 22:39:10,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-01-09 22:39:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1525 transitions. [2025-01-09 22:39:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:39:10,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:10,987 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:10,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:39:10,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1421665366, now seen corresponding path program 1 times [2025-01-09 22:39:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826346106] [2025-01-09 22:39:10,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:12,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:39:12,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:39:12,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:12,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:13,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:13,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826346106] [2025-01-09 22:39:13,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826346106] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:39:13,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119684823] [2025-01-09 22:39:13,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:13,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:39:13,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:39:13,767 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-01-09 22:39:13,768 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-01-09 22:39:15,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:39:16,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:39:16,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:16,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:16,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 5614 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:39:16,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:39:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:16,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:39:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119684823] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:39:16,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:39:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-01-09 22:39:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137868833] [2025-01-09 22:39:16,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:39:16,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:39:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:16,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:39:16,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:39:16,753 INFO L87 Difference]: Start difference. First operand 1126 states and 1525 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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-01-09 22:39:19,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:20,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:22,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:23,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:25,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:27,889 INFO L93 Difference]: Finished difference Result 1402 states and 1775 transitions. [2025-01-09 22:39:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:39:27,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 14 [2025-01-09 22:39:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:27,895 INFO L225 Difference]: With dead ends: 1402 [2025-01-09 22:39:27,896 INFO L226 Difference]: Without dead ends: 1402 [2025-01-09 22:39:27,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 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-01-09 22:39:27,897 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 745 mSDsluCounter, 4326 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 5213 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:27,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 5213 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2475 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2025-01-09 22:39:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-01-09 22:39:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1278. [2025-01-09 22:39:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 812 states have (on average 1.7105911330049262) internal successors, (1389), 1035 states have internal predecessors, (1389), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1757 transitions. [2025-01-09 22:39:27,935 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1757 transitions. Word has length 14 [2025-01-09 22:39:27,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:27,936 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1757 transitions. [2025-01-09 22:39:27,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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-01-09 22:39:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1757 transitions. [2025-01-09 22:39:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:39:27,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:27,938 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:27,961 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-01-09 22:39:28,138 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-01-09 22:39:28,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:28,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1317601804, now seen corresponding path program 1 times [2025-01-09 22:39:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481467892] [2025-01-09 22:39:28,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:29,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:39:29,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:39:29,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:29,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:39:30,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:30,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481467892] [2025-01-09 22:39:30,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481467892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:30,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:30,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:39:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777515926] [2025-01-09 22:39:30,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:30,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:30,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:30,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:30,323 INFO L87 Difference]: Start difference. First operand 1278 states and 1757 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 22:39:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:30,844 INFO L93 Difference]: Finished difference Result 1486 states and 1850 transitions. [2025-01-09 22:39:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:30,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 24 [2025-01-09 22:39:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:30,850 INFO L225 Difference]: With dead ends: 1486 [2025-01-09 22:39:30,850 INFO L226 Difference]: Without dead ends: 1486 [2025-01-09 22:39:30,851 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-01-09 22:39:30,851 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 691 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:30,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1340 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:39:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-01-09 22:39:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1276. [2025-01-09 22:39:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 812 states have (on average 1.6995073891625616) internal successors, (1380), 1033 states have internal predecessors, (1380), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1748 transitions. [2025-01-09 22:39:30,884 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1748 transitions. Word has length 24 [2025-01-09 22:39:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:30,884 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1748 transitions. [2025-01-09 22:39:30,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 22:39:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1748 transitions. [2025-01-09 22:39:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:39:30,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:30,885 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:39:30,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:30,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1317601805, now seen corresponding path program 1 times [2025-01-09 22:39:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:30,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250041700] [2025-01-09 22:39:30,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:32,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:39:32,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:39:32,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:32,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250041700] [2025-01-09 22:39:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250041700] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:39:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514468224] [2025-01-09 22:39:33,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:33,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:39:33,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:39:33,194 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-01-09 22:39:33,196 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-01-09 22:39:35,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:39:35,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:39:35,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:35,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:35,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:39:35,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:39:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:35,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:39:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:39:36,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514468224] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:39:36,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:39:36,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:39:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254916091] [2025-01-09 22:39:36,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:39:36,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:39:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:36,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:39:36,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:39:36,075 INFO L87 Difference]: Start difference. First operand 1276 states and 1748 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-01-09 22:39:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:36,187 INFO L93 Difference]: Finished difference Result 1294 states and 1766 transitions. [2025-01-09 22:39:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:39:36,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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 24 [2025-01-09 22:39:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:36,193 INFO L225 Difference]: With dead ends: 1294 [2025-01-09 22:39:36,193 INFO L226 Difference]: Without dead ends: 1294 [2025-01-09 22:39:36,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 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-01-09 22:39:36,195 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 13 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4094 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:36,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4094 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:39:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-01-09 22:39:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-01-09 22:39:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 830 states have (on average 1.6843373493975904) internal successors, (1398), 1051 states have internal predecessors, (1398), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1766 transitions. [2025-01-09 22:39:36,229 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1766 transitions. Word has length 24 [2025-01-09 22:39:36,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:36,229 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1766 transitions. [2025-01-09 22:39:36,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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-01-09 22:39:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1766 transitions. [2025-01-09 22:39:36,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:39:36,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:36,231 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:36,255 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-01-09 22:39:36,431 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-01-09 22:39:36,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:36,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1524319213, now seen corresponding path program 2 times [2025-01-09 22:39:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137616737] [2025-01-09 22:39:36,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:39:36,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:38,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:39:38,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-01-09 22:39:38,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:39:38,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:39:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137616737] [2025-01-09 22:39:38,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137616737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:38,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:38,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455861155] [2025-01-09 22:39:38,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:38,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:39:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:38,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:39:38,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:39:38,799 INFO L87 Difference]: Start difference. First operand 1294 states and 1766 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-01-09 22:39:40,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:41,049 INFO L93 Difference]: Finished difference Result 1350 states and 1778 transitions. [2025-01-09 22:39:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:39:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 42 [2025-01-09 22:39:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:41,056 INFO L225 Difference]: With dead ends: 1350 [2025-01-09 22:39:41,056 INFO L226 Difference]: Without dead ends: 1350 [2025-01-09 22:39:41,056 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-01-09 22:39:41,057 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 255 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:41,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1593 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 22:39:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-01-09 22:39:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1292. [2025-01-09 22:39:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 830 states have (on average 1.6819277108433734) internal successors, (1396), 1049 states have internal predecessors, (1396), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1764 transitions. [2025-01-09 22:39:41,084 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1764 transitions. Word has length 42 [2025-01-09 22:39:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:41,086 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1764 transitions. [2025-01-09 22:39:41,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-01-09 22:39:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1764 transitions. [2025-01-09 22:39:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 22:39:41,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:41,087 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-01-09 22:39:41,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:39:41,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:41,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash 79929795, now seen corresponding path program 1 times [2025-01-09 22:39:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:41,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207745168] [2025-01-09 22:39:41,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:42,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 22:39:42,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 22:39:42,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:42,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 22:39:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:43,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207745168] [2025-01-09 22:39:43,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207745168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:43,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854032608] [2025-01-09 22:39:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:43,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:43,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:43,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:43,354 INFO L87 Difference]: Start difference. First operand 1292 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-01-09 22:39:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:43,382 INFO L93 Difference]: Finished difference Result 1291 states and 1761 transitions. [2025-01-09 22:39:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:43,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-01-09 22:39:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:43,387 INFO L225 Difference]: With dead ends: 1291 [2025-01-09 22:39:43,387 INFO L226 Difference]: Without dead ends: 1291 [2025-01-09 22:39:43,387 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-01-09 22:39:43,387 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 814 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:43,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 824 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:39:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-01-09 22:39:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2025-01-09 22:39:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 829 states have (on average 1.6803377563329311) internal successors, (1393), 1048 states have internal predecessors, (1393), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1761 transitions. [2025-01-09 22:39:43,417 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1761 transitions. Word has length 66 [2025-01-09 22:39:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:43,417 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1761 transitions. [2025-01-09 22:39:43,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 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-01-09 22:39:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1761 transitions. [2025-01-09 22:39:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 22:39:43,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:43,421 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, 1, 1] [2025-01-09 22:39:43,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:39:43,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:43,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash -506371522, now seen corresponding path program 1 times [2025-01-09 22:39:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482779534] [2025-01-09 22:39:43,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:45,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 22:39:45,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 22:39:45,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:45,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 22:39:45,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482779534] [2025-01-09 22:39:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482779534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:45,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:39:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874058948] [2025-01-09 22:39:45,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:45,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:45,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:45,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:45,702 INFO L87 Difference]: Start difference. First operand 1291 states and 1761 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-01-09 22:39:47,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:47,625 INFO L93 Difference]: Finished difference Result 1290 states and 1760 transitions. [2025-01-09 22:39:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 68 [2025-01-09 22:39:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:47,630 INFO L225 Difference]: With dead ends: 1290 [2025-01-09 22:39:47,630 INFO L226 Difference]: Without dead ends: 1290 [2025-01-09 22:39:47,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-01-09 22:39:47,631 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 1 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:47,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1438 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 22:39:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-01-09 22:39:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2025-01-09 22:39:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 829 states have (on average 1.6791314837153197) internal successors, (1392), 1047 states have internal predecessors, (1392), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1760 transitions. [2025-01-09 22:39:47,658 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1760 transitions. Word has length 68 [2025-01-09 22:39:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:47,658 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1760 transitions. [2025-01-09 22:39:47,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-01-09 22:39:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1760 transitions. [2025-01-09 22:39:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 22:39:47,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:47,660 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, 1, 1] [2025-01-09 22:39:47,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:39:47,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:47,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash -506371521, now seen corresponding path program 1 times [2025-01-09 22:39:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012945470] [2025-01-09 22:39:47,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:47,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:49,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 22:39:49,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 22:39:49,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:49,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 22:39:50,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:50,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012945470] [2025-01-09 22:39:50,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012945470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:50,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:50,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:39:50,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740015947] [2025-01-09 22:39:50,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:50,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:39:50,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:50,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:39:50,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:39:50,590 INFO L87 Difference]: Start difference. First operand 1290 states and 1760 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-01-09 22:39:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:51,823 INFO L93 Difference]: Finished difference Result 1289 states and 1759 transitions. [2025-01-09 22:39:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:39:51,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 68 [2025-01-09 22:39:51,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:51,827 INFO L225 Difference]: With dead ends: 1289 [2025-01-09 22:39:51,827 INFO L226 Difference]: Without dead ends: 1289 [2025-01-09 22:39:51,827 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-01-09 22:39:51,827 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 809 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:51,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1441 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 22:39:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2025-01-09 22:39:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2025-01-09 22:39:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 829 states have (on average 1.677925211097708) internal successors, (1391), 1046 states have internal predecessors, (1391), 184 states have call successors, (184), 79 states have call predecessors, (184), 79 states have return successors, (184), 176 states have call predecessors, (184), 184 states have call successors, (184) [2025-01-09 22:39:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1759 transitions. [2025-01-09 22:39:51,851 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1759 transitions. Word has length 68 [2025-01-09 22:39:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:51,851 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1759 transitions. [2025-01-09 22:39:51,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-01-09 22:39:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1759 transitions. [2025-01-09 22:39:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 22:39:51,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:51,852 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:39:51,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:39:51,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr164ASSERT_VIOLATIONMEMORY_LEAK === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:51,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1842524180, now seen corresponding path program 1 times [2025-01-09 22:39:51,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:51,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643100072] [2025-01-09 22:39:51,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:51,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:53,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 22:39:53,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 22:39:53,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:53,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:39:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-01-09 22:39:53,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:39:53,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643100072] [2025-01-09 22:39:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643100072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:39:53,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:39:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:39:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964476927] [2025-01-09 22:39:53,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:39:53,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:39:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:39:53,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:39:53,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:39:53,981 INFO L87 Difference]: Start difference. First operand 1289 states and 1759 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:39:55,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:39:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:39:55,634 INFO L93 Difference]: Finished difference Result 1330 states and 1768 transitions. [2025-01-09 22:39:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:39:55,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2025-01-09 22:39:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:39:55,640 INFO L225 Difference]: With dead ends: 1330 [2025-01-09 22:39:55,640 INFO L226 Difference]: Without dead ends: 1318 [2025-01-09 22:39:55,640 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-01-09 22:39:55,641 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 95 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:39:55,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1396 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 22:39:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-01-09 22:39:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1285. [2025-01-09 22:39:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 827 states have (on average 1.6783555018137848) internal successors, (1388), 1044 states have internal predecessors, (1388), 183 states have call successors, (183), 79 states have call predecessors, (183), 78 states have return successors, (181), 174 states have call predecessors, (181), 181 states have call successors, (181) [2025-01-09 22:39:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1752 transitions. [2025-01-09 22:39:55,669 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1752 transitions. Word has length 73 [2025-01-09 22:39:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:39:55,669 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1752 transitions. [2025-01-09 22:39:55,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:39:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1752 transitions. [2025-01-09 22:39:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 22:39:55,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:39:55,671 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, 1, 1, 1] [2025-01-09 22:39:55,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:39:55,671 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [spin_lock_initErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, spin_lock_initErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 202 more)] === [2025-01-09 22:39:55,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:39:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1000086965, now seen corresponding path program 1 times [2025-01-09 22:39:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:39:55,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565126690] [2025-01-09 22:39:55,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:39:55,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:39:57,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 22:39:57,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 22:39:57,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:39:57,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat