./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/bounded_spsc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/bounded_spsc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-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 ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:46:18,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:46:18,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:46:18,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:46:18,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:46:18,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:46:18,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:46:18,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:46:18,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:46:18,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:46:18,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:46:18,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:46:18,760 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:46:18,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:46:18,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:46:18,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:46:18,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:46:18,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:46:18,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:46:18,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:46:18,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:18,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:46:18,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:46:18,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:46:18,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:46:18,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:46:18,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:46:18,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:46:18,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:46:18,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:46:18,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:46:18,763 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 ! data-race) ) 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 -> 93808a150a8803e907bade039c6d51db8f9a81931409074d169ee410e6e3b34e [2025-02-08 05:46:18,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:46:18,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:46:18,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:46:18,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:46:18,987 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:46:18,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_spsc.i [2025-02-08 05:46:20,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08fec9827/0ac9235df73f4ada95e1d6126edf53f2/FLAG1f22b2a1e [2025-02-08 05:46:20,552 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:46:20,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_spsc.i [2025-02-08 05:46:20,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08fec9827/0ac9235df73f4ada95e1d6126edf53f2/FLAG1f22b2a1e [2025-02-08 05:46:20,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08fec9827/0ac9235df73f4ada95e1d6126edf53f2 [2025-02-08 05:46:20,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:46:20,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:46:20,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:20,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:46:20,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:46:20,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:20" (1/1) ... [2025-02-08 05:46:20,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3909bc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:20, skipping insertion in model container [2025-02-08 05:46:20,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:20" (1/1) ... [2025-02-08 05:46:20,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:46:22,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:22,280 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:46:22,364 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4397] [2025-02-08 05:46:22,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4399] [2025-02-08 05:46:22,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4404] [2025-02-08 05:46:22,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4406] [2025-02-08 05:46:22,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4412] [2025-02-08 05:46:22,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-02-08 05:46:22,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4420] [2025-02-08 05:46:22,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4422] [2025-02-08 05:46:22,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4428] [2025-02-08 05:46:22,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4430] [2025-02-08 05:46:22,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4436] [2025-02-08 05:46:22,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4438] [2025-02-08 05:46:22,371 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-02-08 05:46:22,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4446] [2025-02-08 05:46:22,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4452] [2025-02-08 05:46:22,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4454] [2025-02-08 05:46:22,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4459] [2025-02-08 05:46:22,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4461] [2025-02-08 05:46:22,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4466] [2025-02-08 05:46:22,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4468] [2025-02-08 05:46:22,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-02-08 05:46:22,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4475] [2025-02-08 05:46:22,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-02-08 05:46:22,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4482] [2025-02-08 05:46:22,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4487] [2025-02-08 05:46:22,376 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4489] [2025-02-08 05:46:22,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4494] [2025-02-08 05:46:22,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4497] [2025-02-08 05:46:22,377 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-02-08 05:46:22,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4506] [2025-02-08 05:46:22,378 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4512] [2025-02-08 05:46:22,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4515] [2025-02-08 05:46:22,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4521] [2025-02-08 05:46:22,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4524] [2025-02-08 05:46:22,379 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4530] [2025-02-08 05:46:22,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4533] [2025-02-08 05:46:22,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4539] [2025-02-08 05:46:22,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4542] [2025-02-08 05:46:22,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-02-08 05:46:22,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4552] [2025-02-08 05:46:22,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4559] [2025-02-08 05:46:22,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4562] [2025-02-08 05:46:22,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4569] [2025-02-08 05:46:22,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4572] [2025-02-08 05:46:22,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4579] [2025-02-08 05:46:22,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-02-08 05:46:22,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4589] [2025-02-08 05:46:22,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4592] [2025-02-08 05:46:22,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4599] [2025-02-08 05:46:22,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4602] [2025-02-08 05:46:22,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4608] [2025-02-08 05:46:22,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4611] [2025-02-08 05:46:22,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4617] [2025-02-08 05:46:22,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4620] [2025-02-08 05:46:22,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4626] [2025-02-08 05:46:22,391 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4629] [2025-02-08 05:46:22,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4635] [2025-02-08 05:46:22,393 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4638] [2025-02-08 05:46:22,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4644] [2025-02-08 05:46:22,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4647] [2025-02-08 05:46:22,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4653] [2025-02-08 05:46:22,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-02-08 05:46:22,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-02-08 05:46:22,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4665] [2025-02-08 05:46:22,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4671] [2025-02-08 05:46:22,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4674] [2025-02-08 05:46:22,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-02-08 05:46:22,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4683] [2025-02-08 05:46:22,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4689] [2025-02-08 05:46:22,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4692] [2025-02-08 05:46:22,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4698] [2025-02-08 05:46:22,402 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4701] [2025-02-08 05:46:22,402 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4707] [2025-02-08 05:46:22,402 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-02-08 05:46:22,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4716] [2025-02-08 05:46:22,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4719] [2025-02-08 05:46:22,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4725] [2025-02-08 05:46:22,404 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-02-08 05:46:22,404 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4734] [2025-02-08 05:46:22,404 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4737] [2025-02-08 05:46:22,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4743] [2025-02-08 05:46:22,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4745] [2025-02-08 05:46:22,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4751] [2025-02-08 05:46:22,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4753] [2025-02-08 05:46:22,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4759] [2025-02-08 05:46:22,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4761] [2025-02-08 05:46:22,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4767] [2025-02-08 05:46:22,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4769] [2025-02-08 05:46:22,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4775] [2025-02-08 05:46:22,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4777] [2025-02-08 05:46:22,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4783] [2025-02-08 05:46:22,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4785] [2025-02-08 05:46:22,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4791] [2025-02-08 05:46:22,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4793] [2025-02-08 05:46:22,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4799] [2025-02-08 05:46:22,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4801] [2025-02-08 05:46:22,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4807] [2025-02-08 05:46:22,411 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4809] [2025-02-08 05:46:22,411 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4815] [2025-02-08 05:46:22,412 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4817] [2025-02-08 05:46:22,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:22,652 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:46:22,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22 WrapperNode [2025-02-08 05:46:22,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:22,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:22,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:46:22,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:46:22,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,767 INFO L138 Inliner]: procedures = 948, calls = 963, calls flagged for inlining = 823, calls inlined = 39, statements flattened = 571 [2025-02-08 05:46:22,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:22,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:46:22,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:46:22,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:46:22,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:46:22,830 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:46:22,830 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:46:22,830 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:46:22,830 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (1/1) ... [2025-02-08 05:46:22,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:22,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:22,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:46:22,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:46:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:46:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-08 05:46:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:46:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:46:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:46:22,878 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:46:23,004 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:46:23,006 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:46:23,339 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6110: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 05:46:23,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6110-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 05:46:23,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-5: havoc #t~ite823#1; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-6: havoc #t~ite823#1; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-9: havoc #t~ret822#1; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-10: assume { :end_inline_verification_spin_end } true;#t~ite823#1 := 0; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-7: assume 0 != #t~ite823#1; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-7: assume !(0 != #t~ite823#1); [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-8: havoc #t~ret822#1; [2025-02-08 05:46:23,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-14: assume 0 != #t~ret822#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-14: assume !(0 != #t~ret822#1); [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-17: assume { :end_inline_bounded_spsc_enq } true;assume -2147483648 <= #t~ret822#1 && #t~ret822#1 <= 2147483647; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-18: havoc bounded_spsc_enq_#in~q#1.base, bounded_spsc_enq_#in~q#1.offset, bounded_spsc_enq_#in~v#1.base, bounded_spsc_enq_#in~v#1.offset; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-15: #t~ite823#1 := 1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-19: havoc bounded_spsc_enq_#t~ret807#1, bounded_spsc_enq_#t~ret808#1, bounded_spsc_enq_#t~mem809#1, bounded_spsc_enq_#t~mem811#1.base, bounded_spsc_enq_#t~mem811#1.offset, bounded_spsc_enq_#t~mem810#1, bounded_spsc_enq_#t~nondet812#1, bounded_spsc_enq_~q#1.base, bounded_spsc_enq_~q#1.offset, bounded_spsc_enq_~v#1.base, bounded_spsc_enq_~v#1.offset, bounded_spsc_enq_~tail~0#1, bounded_spsc_enq_~head~0#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6080-20: #t~ret822#1 := bounded_spsc_enq_#res#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4463: vatomic32_write_~v#1 := vatomic32_write_#in~v#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4463-1: vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset := vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4463-2: vatomic32_write_~v#1 := vatomic32_write_#in~v#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4463-3: vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset := vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467: havoc vatomic32_write_#t~nondet442#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-1: havoc vatomic32_write_#t~nondet442#1; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-4: #race := #race[vatomic32_write_~a#1.base,3 + vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet442#1]; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-5: #race := #race[vatomic32_write_~a#1.base,2 + vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet442#1]; [2025-02-08 05:46:23,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-2: [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-3: assume ((#race[vatomic32_write_~a#1.base,vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1 && #race[vatomic32_write_~a#1.base,1 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1) && #race[vatomic32_write_~a#1.base,2 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1) && #race[vatomic32_write_~a#1.base,3 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-3: assume !(((#race[vatomic32_write_~a#1.base,vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1 && #race[vatomic32_write_~a#1.base,1 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1) && #race[vatomic32_write_~a#1.base,2 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1) && #race[vatomic32_write_~a#1.base,3 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1); [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-8: havoc vatomic32_write_#t~nondet442#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-9: SUMMARY for call write~int(vatomic32_write_~v#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-6: #race := #race[vatomic32_write_~a#1.base,1 + vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet442#1]; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-7: #race := #race[vatomic32_write_~a#1.base,vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet442#1]; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-12: havoc vatomic32_write_#t~nondet442#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-13: [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-10: [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-11: havoc vatomic32_write_#t~nondet442#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-16: #race := #race[vatomic32_write_~a#1.base,2 + vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet442#1]; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-17: #race := #race[vatomic32_write_~a#1.base,1 + vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet442#1]; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-14: assume ((#race[vatomic32_write_~a#1.base,vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1 && #race[vatomic32_write_~a#1.base,1 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1) && #race[vatomic32_write_~a#1.base,2 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1) && #race[vatomic32_write_~a#1.base,3 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-14: assume !(((#race[vatomic32_write_~a#1.base,vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1 && #race[vatomic32_write_~a#1.base,1 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1) && #race[vatomic32_write_~a#1.base,2 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1) && #race[vatomic32_write_~a#1.base,3 + vatomic32_write_~a#1.offset] == vatomic32_write_#t~nondet442#1); [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-15: #race := #race[vatomic32_write_~a#1.base,3 + vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet442#1]; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-7: assume 0 != #t~ite826#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-7: assume !(0 != #t~ite826#1); [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-20: SUMMARY for call write~int(vatomic32_write_~v#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-8: havoc #t~ret825#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-21: [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-5: havoc #t~ite826#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-18: #race := #race[vatomic32_write_~a#1.base,vatomic32_write_~a#1.offset := vatomic32_write_#t~nondet442#1]; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-6: havoc #t~ite826#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-19: havoc vatomic32_write_#t~nondet442#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:23,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-9: havoc #t~ret825#1; [2025-02-08 05:46:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-10: assume { :end_inline_verification_spin_end } true;#t~ite826#1 := 0; [2025-02-08 05:46:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-15: #t~ite826#1 := 1; [2025-02-08 05:46:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:23,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-14: assume 0 != #t~ret825#1; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-14: assume !(0 != #t~ret825#1); [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-19: havoc bounded_spsc_deq_#t~ret813#1, bounded_spsc_deq_#t~ret814#1, bounded_spsc_deq_#t~mem816#1.base, bounded_spsc_deq_#t~mem816#1.offset, bounded_spsc_deq_#t~mem815#1, bounded_spsc_deq_#t~mem817#1.base, bounded_spsc_deq_#t~mem817#1.offset, bounded_spsc_deq_#t~nondet818#1, bounded_spsc_deq_~q#1.base, bounded_spsc_deq_~q#1.offset, bounded_spsc_deq_~v#1.base, bounded_spsc_deq_~v#1.offset, bounded_spsc_deq_~head~1#1, bounded_spsc_deq_~tail~1#1; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-20: #t~ret825#1 := bounded_spsc_deq_#res#1; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-17: assume { :end_inline_bounded_spsc_deq } true;assume -2147483648 <= #t~ret825#1 && #t~ret825#1 <= 2147483647; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6086-18: havoc bounded_spsc_deq_#in~q#1.base, bounded_spsc_deq_#in~q#1.offset, bounded_spsc_deq_#in~v#1.base, bounded_spsc_deq_#in~v#1.offset; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6054: havoc bounded_spsc_deq_#t~ret813#1; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6054-3: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6054-4: bounded_spsc_deq_#t~ret813#1 := vatomic32_read_rlx_#res#1; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6054-1: assume { :end_inline_vatomic32_read_rlx } true;bounded_spsc_deq_~head~1#1 := bounded_spsc_deq_#t~ret813#1; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6054-2: havoc vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055: havoc bounded_spsc_deq_#t~ret814#1; [2025-02-08 05:46:23,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055-1: assume { :end_inline_vatomic32_read_acq } true;bounded_spsc_deq_~tail~1#1 := bounded_spsc_deq_#t~ret814#1; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055-4: bounded_spsc_deq_#t~ret814#1 := vatomic32_read_acq_#res#1; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055-5: havoc vatomic32_read_acq_#t~ret117#1, vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055-2: havoc vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055-3: havoc vatomic32_read_acq_#t~ret117#1, vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055-6: havoc vatomic32_read_acq_#res#1; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6055-7: assume { :begin_inline_vatomic32_read_acq } true;vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset := bounded_spsc_deq_~q#1.base, 8 + bounded_spsc_deq_~q#1.offset; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6056: assume 0 == (bounded_spsc_deq_~tail~1#1 - bounded_spsc_deq_~head~1#1) % 4294967296; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6056: assume !(0 == (bounded_spsc_deq_~tail~1#1 - bounded_spsc_deq_~head~1#1) % 4294967296); [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6057-1: bounded_spsc_deq_#res#1 := 2; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2524: vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset := vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6059: havoc vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1;assume { :end_inline_vatomic32_write_rel } true; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6059-1: havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:23,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6059-2: assume { :begin_inline_vatomic32_write_rel } true;vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1 := bounded_spsc_deq_~q#1.base, 4 + bounded_spsc_deq_~q#1.offset, 1 + bounded_spsc_deq_~head~1#1; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-1: havoc bounded_spsc_deq_#t~mem817#1.base, bounded_spsc_deq_#t~mem817#1.offset; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-2: havoc bounded_spsc_deq_#t~mem815#1; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060: havoc bounded_spsc_deq_#t~nondet818#1; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-5: #race := #race[bounded_spsc_deq_~v#1.base,3 + bounded_spsc_deq_~v#1.offset := bounded_spsc_deq_#t~nondet818#1]; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-6: #race := #race[bounded_spsc_deq_~v#1.base,2 + bounded_spsc_deq_~v#1.offset := bounded_spsc_deq_#t~nondet818#1]; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-3: assume ((#race[bounded_spsc_deq_~v#1.base,bounded_spsc_deq_~v#1.offset] == bounded_spsc_deq_#t~nondet818#1 && #race[bounded_spsc_deq_~v#1.base,1 + bounded_spsc_deq_~v#1.offset] == bounded_spsc_deq_#t~nondet818#1) && #race[bounded_spsc_deq_~v#1.base,2 + bounded_spsc_deq_~v#1.offset] == bounded_spsc_deq_#t~nondet818#1) && #race[bounded_spsc_deq_~v#1.base,3 + bounded_spsc_deq_~v#1.offset] == bounded_spsc_deq_#t~nondet818#1; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-3: assume !(((#race[bounded_spsc_deq_~v#1.base,bounded_spsc_deq_~v#1.offset] == bounded_spsc_deq_#t~nondet818#1 && #race[bounded_spsc_deq_~v#1.base,1 + bounded_spsc_deq_~v#1.offset] == bounded_spsc_deq_#t~nondet818#1) && #race[bounded_spsc_deq_~v#1.base,2 + bounded_spsc_deq_~v#1.offset] == bounded_spsc_deq_#t~nondet818#1) && #race[bounded_spsc_deq_~v#1.base,3 + bounded_spsc_deq_~v#1.offset] == bounded_spsc_deq_#t~nondet818#1); [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-4: havoc bounded_spsc_deq_#t~mem816#1.base, bounded_spsc_deq_#t~mem816#1.offset; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-9: havoc bounded_spsc_deq_#t~nondet818#1; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-10: SUMMARY for call write~$Pointer$(bounded_spsc_deq_#t~mem817#1.base, bounded_spsc_deq_#t~mem817#1.offset, bounded_spsc_deq_~v#1.base, bounded_spsc_deq_~v#1.offset, 4); srcloc: null [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-7: #race := #race[bounded_spsc_deq_~v#1.base,1 + bounded_spsc_deq_~v#1.offset := bounded_spsc_deq_#t~nondet818#1]; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-8: #race := #race[bounded_spsc_deq_~v#1.base,bounded_spsc_deq_~v#1.offset := bounded_spsc_deq_#t~nondet818#1]; [2025-02-08 05:46:23,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-13: #race := #race[bounded_spsc_deq_#t~mem816#1.base,2 + (bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)) := 0]; [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-14: #race := #race[bounded_spsc_deq_#t~mem816#1.base,1 + (bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)) := 0]; [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-11: assume ((0 == #race[bounded_spsc_deq_#t~mem816#1.base,bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)] && 0 == #race[bounded_spsc_deq_#t~mem816#1.base,1 + (bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))]) && 0 == #race[bounded_spsc_deq_#t~mem816#1.base,2 + (bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))]) && 0 == #race[bounded_spsc_deq_#t~mem816#1.base,3 + (bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))]; [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-11: assume !(((0 == #race[bounded_spsc_deq_#t~mem816#1.base,bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)] && 0 == #race[bounded_spsc_deq_#t~mem816#1.base,1 + (bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))]) && 0 == #race[bounded_spsc_deq_#t~mem816#1.base,2 + (bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))]) && 0 == #race[bounded_spsc_deq_#t~mem816#1.base,3 + (bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))]); [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-12: #race := #race[bounded_spsc_deq_#t~mem816#1.base,3 + (bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)) := 0]; [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-17: assume ((0 == #race[bounded_spsc_deq_~q#1.base,12 + bounded_spsc_deq_~q#1.offset] && 0 == #race[bounded_spsc_deq_~q#1.base,13 + bounded_spsc_deq_~q#1.offset]) && 0 == #race[bounded_spsc_deq_~q#1.base,14 + bounded_spsc_deq_~q#1.offset]) && 0 == #race[bounded_spsc_deq_~q#1.base,15 + bounded_spsc_deq_~q#1.offset]; [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-17: assume !(((0 == #race[bounded_spsc_deq_~q#1.base,12 + bounded_spsc_deq_~q#1.offset] && 0 == #race[bounded_spsc_deq_~q#1.base,13 + bounded_spsc_deq_~q#1.offset]) && 0 == #race[bounded_spsc_deq_~q#1.base,14 + bounded_spsc_deq_~q#1.offset]) && 0 == #race[bounded_spsc_deq_~q#1.base,15 + bounded_spsc_deq_~q#1.offset]); [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-18: #race := #race[bounded_spsc_deq_~q#1.base,15 + bounded_spsc_deq_~q#1.offset := 0]; [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-15: #race := #race[bounded_spsc_deq_#t~mem816#1.base,bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296) := 0]; [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-16: SUMMARY for call bounded_spsc_deq_#t~mem817#1.base, bounded_spsc_deq_#t~mem817#1.offset := read~$Pointer$(bounded_spsc_deq_#t~mem816#1.base, bounded_spsc_deq_#t~mem816#1.offset + 4 * (if bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_deq_~head~1#1 % 4294967296 % (bounded_spsc_deq_#t~mem815#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296), 4); srcloc: null [2025-02-08 05:46:23,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-21: #race := #race[bounded_spsc_deq_~q#1.base,12 + bounded_spsc_deq_~q#1.offset := 0]; [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-22: SUMMARY for call bounded_spsc_deq_#t~mem815#1 := read~int(bounded_spsc_deq_~q#1.base, 12 + bounded_spsc_deq_~q#1.offset, 4); srcloc: null [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-19: #race := #race[bounded_spsc_deq_~q#1.base,14 + bounded_spsc_deq_~q#1.offset := 0]; [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-20: #race := #race[bounded_spsc_deq_~q#1.base,13 + bounded_spsc_deq_~q#1.offset := 0]; [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-25: #race := #race[bounded_spsc_deq_~q#1.base,2 + bounded_spsc_deq_~q#1.offset := 0]; [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-26: #race := #race[bounded_spsc_deq_~q#1.base,1 + bounded_spsc_deq_~q#1.offset := 0]; [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-23: assume ((0 == #race[bounded_spsc_deq_~q#1.base,bounded_spsc_deq_~q#1.offset] && 0 == #race[bounded_spsc_deq_~q#1.base,1 + bounded_spsc_deq_~q#1.offset]) && 0 == #race[bounded_spsc_deq_~q#1.base,2 + bounded_spsc_deq_~q#1.offset]) && 0 == #race[bounded_spsc_deq_~q#1.base,3 + bounded_spsc_deq_~q#1.offset]; [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-23: assume !(((0 == #race[bounded_spsc_deq_~q#1.base,bounded_spsc_deq_~q#1.offset] && 0 == #race[bounded_spsc_deq_~q#1.base,1 + bounded_spsc_deq_~q#1.offset]) && 0 == #race[bounded_spsc_deq_~q#1.base,2 + bounded_spsc_deq_~q#1.offset]) && 0 == #race[bounded_spsc_deq_~q#1.base,3 + bounded_spsc_deq_~q#1.offset]); [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-24: #race := #race[bounded_spsc_deq_~q#1.base,3 + bounded_spsc_deq_~q#1.offset := 0]; [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-27: #race := #race[bounded_spsc_deq_~q#1.base,bounded_spsc_deq_~q#1.offset := 0]; [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6060-28: SUMMARY for call bounded_spsc_deq_#t~mem816#1.base, bounded_spsc_deq_#t~mem816#1.offset := read~$Pointer$(bounded_spsc_deq_~q#1.base, bounded_spsc_deq_~q#1.offset, 4); srcloc: null [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6061-1: bounded_spsc_deq_#res#1 := 0; [2025-02-08 05:46:23,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_rlx_#res#1 := vatomic32_read_rlx_#t~ret116#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-2: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-5: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-7: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-6: vatomic32_read_rlx_#t~ret116#1 := vatomic32_read_#res#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-9: assume { :begin_inline_vatomic32_read } true;vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset := vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-8: havoc vatomic32_read_#res#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-10: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-13: assume { :end_inline_vatomic32_read } true;vatomic32_read_rlx_#res#1 := vatomic32_read_rlx_#t~ret116#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-12: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-15: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-14: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-16: vatomic32_read_rlx_#t~ret116#1 := vatomic32_read_#res#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-20: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-23: assume { :end_inline_vatomic32_read } true;vatomic32_read_rlx_#res#1 := vatomic32_read_rlx_#t~ret116#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-22: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-25: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-24: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-26: vatomic32_read_rlx_#t~ret116#1 := vatomic32_read_#res#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1207: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1207-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1207-2: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1207-3: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2529: vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset := vatomic32_read_acq_#in~a#1.base, vatomic32_read_acq_#in~a#1.offset; [2025-02-08 05:46:23,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210: assume true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210: assume !true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-1: assume false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-1: assume !false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-2: assume true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-2: assume !true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-3: assume false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-3: assume !false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-4: assume true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-4: assume !true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-5: assume false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-5: assume !false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-6: assume true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-6: assume !true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-7: assume false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-7: assume !false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-8: assume true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-8: assume !true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-9: assume false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-9: assume !false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-10: assume true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-10: assume !true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-11: assume false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-11: assume !false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-12: assume true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-12: assume !true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-13: assume false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-13: assume !false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-14: assume true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-14: assume !true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-15: assume false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-15: assume !false; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-16: assume true; [2025-02-08 05:46:23,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-16: assume !true; [2025-02-08 05:46:23,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-17: assume false; [2025-02-08 05:46:23,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-17: assume !false; [2025-02-08 05:46:23,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-18: assume true; [2025-02-08 05:46:23,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-18: assume !true; [2025-02-08 05:46:23,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-19: assume false; [2025-02-08 05:46:23,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-19: assume !false; [2025-02-08 05:46:23,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-20: assume true; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-20: assume !true; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-21: assume false; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-21: assume !false; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-22: assume true; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-22: assume !true; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-23: assume false; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-23: assume !false; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532-2: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532-4: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532-3: assume { :end_inline_vatomic32_read } true;vatomic32_read_acq_#res#1 := vatomic32_read_acq_#t~ret117#1; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532-6: vatomic32_read_acq_#t~ret117#1 := vatomic32_read_#res#1; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532-5: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:23,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532-8: havoc vatomic32_read_#res#1; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532-7: havoc vatomic32_read_#t~mem436#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532-9: assume { :begin_inline_vatomic32_read } true;vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset := vatomic32_read_acq_~a#1.base, vatomic32_read_acq_~a#1.offset; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4417-2: vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset := vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4417: vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset := vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-2: [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-3: SUMMARY for call vatomic32_read_#t~mem436#1 := read~int(vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421: havoc vatomic32_read_#t~mem436#1; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-1: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem436#1; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-6: #race := #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-7: #race := #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-4: assume ((0 == #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset] && 0 == #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset]; [2025-02-08 05:46:23,754 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-4: assume !(((0 == #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset] && 0 == #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset]); [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-5: #race := #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-8: #race := #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6040-1: assume { :end_inline_vatomic32_read_rlx } true;bounded_spsc_enq_~tail~0#1 := bounded_spsc_enq_#t~ret807#1; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6040-2: havoc vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6040: havoc bounded_spsc_enq_#t~ret807#1; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-18: havoc vatomic32_read_#t~mem436#1; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-19: vatomic32_read_~tmp~2#1 := vatomic32_read_#t~mem436#1; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6040-3: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6040-4: bounded_spsc_enq_#t~ret807#1 := vatomic32_read_rlx_#res#1; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-22: assume ((0 == #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset] && 0 == #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset]; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-22: assume !(((0 == #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset] && 0 == #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset]) && 0 == #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset]); [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-23: #race := #race[vatomic32_read_~a#1.base,3 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:23,755 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-20: [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-21: SUMMARY for call vatomic32_read_#t~mem436#1 := read~int(vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-26: #race := #race[vatomic32_read_~a#1.base,vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539-1: vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset := vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-24: #race := #race[vatomic32_read_~a#1.base,2 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539: vatomic32_write_rel_~v#1 := vatomic32_write_rel_#in~v#1; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4421-25: #race := #race[vatomic32_read_~a#1.base,1 + vatomic32_read_~a#1.offset := 0]; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539-3: vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset := vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539-2: vatomic32_write_rel_~v#1 := vatomic32_write_rel_#in~v#1; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041-2: havoc vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041-3: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041: havoc bounded_spsc_enq_#t~ret808#1; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041-1: assume { :end_inline_vatomic32_read_rlx } true;bounded_spsc_enq_~head~0#1 := bounded_spsc_enq_#t~ret808#1; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041-6: havoc vatomic32_read_rlx_#res#1; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041-7: assume { :begin_inline_vatomic32_read_rlx } true;vatomic32_read_rlx_#in~a#1.base, vatomic32_read_rlx_#in~a#1.offset := bounded_spsc_enq_~q#1.base, 4 + bounded_spsc_enq_~q#1.offset; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041-4: bounded_spsc_enq_#t~ret808#1 := vatomic32_read_rlx_#res#1; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6041-5: havoc vatomic32_read_rlx_#t~ret116#1, vatomic32_read_rlx_~a#1.base, vatomic32_read_rlx_~a#1.offset; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4423-1: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4423-5: vatomic32_read_#res#1 := vatomic32_read_~tmp~2#1; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042: assume (bounded_spsc_enq_~tail~0#1 - bounded_spsc_enq_~head~0#1) % 4294967296 == bounded_spsc_enq_#t~mem809#1 % 4294967296; [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042: assume !((bounded_spsc_enq_~tail~0#1 - bounded_spsc_enq_~head~0#1) % 4294967296 == bounded_spsc_enq_#t~mem809#1 % 4294967296); [2025-02-08 05:46:23,756 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-3: assume ((0 == #race[bounded_spsc_enq_~q#1.base,12 + bounded_spsc_enq_~q#1.offset] && 0 == #race[bounded_spsc_enq_~q#1.base,13 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,14 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,15 + bounded_spsc_enq_~q#1.offset]; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-3: assume !(((0 == #race[bounded_spsc_enq_~q#1.base,12 + bounded_spsc_enq_~q#1.offset] && 0 == #race[bounded_spsc_enq_~q#1.base,13 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,14 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,15 + bounded_spsc_enq_~q#1.offset]); [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-4: #race := #race[bounded_spsc_enq_~q#1.base,15 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-1: havoc bounded_spsc_enq_#t~mem809#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-2: havoc bounded_spsc_enq_#t~mem809#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-7: #race := #race[bounded_spsc_enq_~q#1.base,12 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-8: SUMMARY for call bounded_spsc_enq_#t~mem809#1 := read~int(bounded_spsc_enq_~q#1.base, 12 + bounded_spsc_enq_~q#1.offset, 4); srcloc: null [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-5: #race := #race[bounded_spsc_enq_~q#1.base,14 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6042-6: #race := #race[bounded_spsc_enq_~q#1.base,13 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-1: bounded_spsc_enq_#res#1 := 1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542: assume { :end_inline_vatomic32_write } true;havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-2: havoc vatomic32_write_#t~nondet442#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-1: havoc vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-4: assume { :begin_inline_vatomic32_write } true;vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1 := vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-3: havoc vatomic32_write_#t~nondet442#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-6: havoc vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-5: assume { :end_inline_vatomic32_write } true;havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-8: havoc vatomic32_write_#t~nondet442#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-7: havoc vatomic32_write_#t~nondet442#1, vatomic32_write_~a#1.base, vatomic32_write_~a#1.offset, vatomic32_write_~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-9: assume { :begin_inline_vatomic32_write } true;vatomic32_write_#in~a#1.base, vatomic32_write_#in~a#1.offset, vatomic32_write_#in~v#1 := vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:23,757 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-2: assume ((#race[bounded_spsc_enq_#t~mem811#1.base,bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)] == bounded_spsc_enq_#t~nondet812#1 && #race[bounded_spsc_enq_#t~mem811#1.base,1 + (bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))] == bounded_spsc_enq_#t~nondet812#1) && #race[bounded_spsc_enq_#t~mem811#1.base,2 + (bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))] == bounded_spsc_enq_#t~nondet812#1) && #race[bounded_spsc_enq_#t~mem811#1.base,3 + (bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))] == bounded_spsc_enq_#t~nondet812#1; [2025-02-08 05:46:23,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-2: assume !(((#race[bounded_spsc_enq_#t~mem811#1.base,bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)] == bounded_spsc_enq_#t~nondet812#1 && #race[bounded_spsc_enq_#t~mem811#1.base,1 + (bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))] == bounded_spsc_enq_#t~nondet812#1) && #race[bounded_spsc_enq_#t~mem811#1.base,2 + (bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))] == bounded_spsc_enq_#t~nondet812#1) && #race[bounded_spsc_enq_#t~mem811#1.base,3 + (bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296))] == bounded_spsc_enq_#t~nondet812#1); [2025-02-08 05:46:23,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-3: havoc bounded_spsc_enq_#t~mem811#1.base, bounded_spsc_enq_#t~mem811#1.offset; [2025-02-08 05:46:23,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045: havoc bounded_spsc_enq_#t~nondet812#1; [2025-02-08 05:46:23,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-1: havoc bounded_spsc_enq_#t~mem810#1; [2025-02-08 05:46:23,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-6: #race := #race[bounded_spsc_enq_#t~mem811#1.base,1 + (bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)) := bounded_spsc_enq_#t~nondet812#1]; [2025-02-08 05:46:23,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-7: #race := #race[bounded_spsc_enq_#t~mem811#1.base,bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296) := bounded_spsc_enq_#t~nondet812#1]; [2025-02-08 05:46:23,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-4: #race := #race[bounded_spsc_enq_#t~mem811#1.base,3 + (bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)) := bounded_spsc_enq_#t~nondet812#1]; [2025-02-08 05:46:23,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-5: #race := #race[bounded_spsc_enq_#t~mem811#1.base,2 + (bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296)) := bounded_spsc_enq_#t~nondet812#1]; [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-10: assume ((0 == #race[bounded_spsc_enq_~q#1.base,12 + bounded_spsc_enq_~q#1.offset] && 0 == #race[bounded_spsc_enq_~q#1.base,13 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,14 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,15 + bounded_spsc_enq_~q#1.offset]; [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-10: assume !(((0 == #race[bounded_spsc_enq_~q#1.base,12 + bounded_spsc_enq_~q#1.offset] && 0 == #race[bounded_spsc_enq_~q#1.base,13 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,14 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,15 + bounded_spsc_enq_~q#1.offset]); [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-11: #race := #race[bounded_spsc_enq_~q#1.base,15 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-8: havoc bounded_spsc_enq_#t~nondet812#1; [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-9: SUMMARY for call write~$Pointer$(bounded_spsc_enq_~v#1.base, bounded_spsc_enq_~v#1.offset, bounded_spsc_enq_#t~mem811#1.base, bounded_spsc_enq_#t~mem811#1.offset + 4 * (if bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 <= 2147483647 then bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 else bounded_spsc_enq_~tail~0#1 % 4294967296 % (bounded_spsc_enq_#t~mem810#1 % 4294967296) % 4294967296 % 4294967296 - 4294967296), 4); srcloc: null [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-14: #race := #race[bounded_spsc_enq_~q#1.base,12 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-15: SUMMARY for call bounded_spsc_enq_#t~mem810#1 := read~int(bounded_spsc_enq_~q#1.base, 12 + bounded_spsc_enq_~q#1.offset, 4); srcloc: null [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-12: #race := #race[bounded_spsc_enq_~q#1.base,14 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-13: #race := #race[bounded_spsc_enq_~q#1.base,13 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-18: #race := #race[bounded_spsc_enq_~q#1.base,2 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-19: #race := #race[bounded_spsc_enq_~q#1.base,1 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,759 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-16: assume ((0 == #race[bounded_spsc_enq_~q#1.base,bounded_spsc_enq_~q#1.offset] && 0 == #race[bounded_spsc_enq_~q#1.base,1 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,2 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,3 + bounded_spsc_enq_~q#1.offset]; [2025-02-08 05:46:23,760 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-16: assume !(((0 == #race[bounded_spsc_enq_~q#1.base,bounded_spsc_enq_~q#1.offset] && 0 == #race[bounded_spsc_enq_~q#1.base,1 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,2 + bounded_spsc_enq_~q#1.offset]) && 0 == #race[bounded_spsc_enq_~q#1.base,3 + bounded_spsc_enq_~q#1.offset]); [2025-02-08 05:46:23,760 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-17: #race := #race[bounded_spsc_enq_~q#1.base,3 + bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,760 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-20: #race := #race[bounded_spsc_enq_~q#1.base,bounded_spsc_enq_~q#1.offset := 0]; [2025-02-08 05:46:23,760 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6045-21: SUMMARY for call bounded_spsc_enq_#t~mem811#1.base, bounded_spsc_enq_#t~mem811#1.offset := read~$Pointer$(bounded_spsc_enq_~q#1.base, bounded_spsc_enq_~q#1.offset, 4); srcloc: null [2025-02-08 05:46:23,760 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046: assume { :end_inline_vatomic32_write_rel } true;bounded_spsc_enq_#res#1 := 0; [2025-02-08 05:46:23,760 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-3: assume { :begin_inline_vatomic32_write_rel } true;vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1 := bounded_spsc_enq_~q#1.base, 8 + bounded_spsc_enq_~q#1.offset, 1 + bounded_spsc_enq_~tail~0#1; [2025-02-08 05:46:23,760 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-1: havoc vatomic32_write_rel_#in~a#1.base, vatomic32_write_rel_#in~a#1.offset, vatomic32_write_rel_#in~v#1; [2025-02-08 05:46:23,760 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6046-2: havoc vatomic32_write_rel_~a#1.base, vatomic32_write_rel_~a#1.offset, vatomic32_write_rel_~v#1; [2025-02-08 05:46:23,761 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:46:23,761 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:46:23,809 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:46:23,809 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:46:23,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:23 BoogieIcfgContainer [2025-02-08 05:46:23,809 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:46:23,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:46:23,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:46:23,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:46:23,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:46:20" (1/3) ... [2025-02-08 05:46:23,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2746e355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:23, skipping insertion in model container [2025-02-08 05:46:23,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:22" (2/3) ... [2025-02-08 05:46:23,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2746e355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:23, skipping insertion in model container [2025-02-08 05:46:23,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:23" (3/3) ... [2025-02-08 05:46:23,817 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_spsc.i [2025-02-08 05:46:23,828 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:46:23,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_spsc.i that has 2 procedures, 365 locations, 1 initial locations, 29 loop locations, and 29 error locations. [2025-02-08 05:46:23,829 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:46:23,932 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:46:23,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 412 transitions, 831 flow [2025-02-08 05:46:24,083 INFO L124 PetriNetUnfolderBase]: 47/442 cut-off events. [2025-02-08 05:46:24,084 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:46:24,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 47/442 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1248 event pairs, 0 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 250. Up to 3 conditions per place. [2025-02-08 05:46:24,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 368 places, 412 transitions, 831 flow [2025-02-08 05:46:24,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 368 places, 412 transitions, 831 flow [2025-02-08 05:46:24,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:24,122 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7072229d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:24,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-08 05:46:24,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:24,136 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-02-08 05:46:24,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:24,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:24,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:24,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:24,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1544270428, now seen corresponding path program 1 times [2025-02-08 05:46:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751983123] [2025-02-08 05:46:24,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:24,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:46:24,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:46:24,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:24,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:24,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751983123] [2025-02-08 05:46:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751983123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:24,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:24,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144101795] [2025-02-08 05:46:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:24,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:24,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:24,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:24,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:24,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 412 [2025-02-08 05:46:24,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 412 transitions, 831 flow. Second operand has 2 states, 2 states have (on average 359.0) internal successors, (718), 2 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:24,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:24,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 412 [2025-02-08 05:46:24,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:24,452 INFO L124 PetriNetUnfolderBase]: 3/308 cut-off events. [2025-02-08 05:46:24,452 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:24,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 308 events. 3/308 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 596 event pairs, 0 based on Foata normal form. 30/312 useless extension candidates. Maximal degree in co-relation 165. Up to 7 conditions per place. [2025-02-08 05:46:24,456 INFO L140 encePairwiseOnDemand]: 378/412 looper letters, 6 selfloop transitions, 0 changer transitions 11/278 dead transitions. [2025-02-08 05:46:24,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 278 transitions, 575 flow [2025-02-08 05:46:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 756 transitions. [2025-02-08 05:46:24,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9174757281553398 [2025-02-08 05:46:24,471 INFO L175 Difference]: Start difference. First operand has 368 places, 412 transitions, 831 flow. Second operand 2 states and 756 transitions. [2025-02-08 05:46:24,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 278 transitions, 575 flow [2025-02-08 05:46:24,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 278 transitions, 575 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:24,481 INFO L231 Difference]: Finished difference. Result has 279 places, 267 transitions, 541 flow [2025-02-08 05:46:24,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=541, PETRI_PLACES=279, PETRI_TRANSITIONS=267} [2025-02-08 05:46:24,486 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -89 predicate places. [2025-02-08 05:46:24,486 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 267 transitions, 541 flow [2025-02-08 05:46:24,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 359.0) internal successors, (718), 2 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:24,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:24,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:24,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:46:24,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:24,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1463882871, now seen corresponding path program 1 times [2025-02-08 05:46:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:24,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908846439] [2025-02-08 05:46:24,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:24,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:24,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:46:24,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:46:24,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:24,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908846439] [2025-02-08 05:46:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908846439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831115740] [2025-02-08 05:46:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:25,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:25,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:25,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:25,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 412 [2025-02-08 05:46:25,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 267 transitions, 541 flow. Second operand has 6 states, 6 states have (on average 304.3333333333333) internal successors, (1826), 6 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:25,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:25,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 412 [2025-02-08 05:46:25,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:25,552 INFO L124 PetriNetUnfolderBase]: 115/861 cut-off events. [2025-02-08 05:46:25,552 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:25,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 861 events. 115/861 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4487 event pairs, 112 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1140. Up to 272 conditions per place. [2025-02-08 05:46:25,559 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 39 selfloop transitions, 5 changer transitions 0/266 dead transitions. [2025-02-08 05:46:25,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 266 transitions, 627 flow [2025-02-08 05:46:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1863 transitions. [2025-02-08 05:46:25,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7536407766990292 [2025-02-08 05:46:25,563 INFO L175 Difference]: Start difference. First operand has 279 places, 267 transitions, 541 flow. Second operand 6 states and 1863 transitions. [2025-02-08 05:46:25,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 266 transitions, 627 flow [2025-02-08 05:46:25,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 266 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:25,570 INFO L231 Difference]: Finished difference. Result has 272 places, 266 transitions, 549 flow [2025-02-08 05:46:25,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=549, PETRI_PLACES=272, PETRI_TRANSITIONS=266} [2025-02-08 05:46:25,572 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -96 predicate places. [2025-02-08 05:46:25,573 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 266 transitions, 549 flow [2025-02-08 05:46:25,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.3333333333333) internal successors, (1826), 6 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:25,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:25,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:25,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:46:25,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:25,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash -877629785, now seen corresponding path program 1 times [2025-02-08 05:46:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:25,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796110465] [2025-02-08 05:46:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:25,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:46:25,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:46:25,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:25,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:25,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:25,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796110465] [2025-02-08 05:46:25,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796110465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:25,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:25,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:25,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878336345] [2025-02-08 05:46:25,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:25,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:25,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:25,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:25,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:26,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 412 [2025-02-08 05:46:26,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 266 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 304.3333333333333) internal successors, (1826), 6 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:26,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:26,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 412 [2025-02-08 05:46:26,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:26,251 INFO L124 PetriNetUnfolderBase]: 115/860 cut-off events. [2025-02-08 05:46:26,251 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:26,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 860 events. 115/860 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4439 event pairs, 112 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1144. Up to 272 conditions per place. [2025-02-08 05:46:26,258 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 39 selfloop transitions, 5 changer transitions 0/265 dead transitions. [2025-02-08 05:46:26,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 265 transitions, 635 flow [2025-02-08 05:46:26,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1863 transitions. [2025-02-08 05:46:26,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7536407766990292 [2025-02-08 05:46:26,262 INFO L175 Difference]: Start difference. First operand has 272 places, 266 transitions, 549 flow. Second operand 6 states and 1863 transitions. [2025-02-08 05:46:26,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 265 transitions, 635 flow [2025-02-08 05:46:26,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 265 transitions, 625 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:26,266 INFO L231 Difference]: Finished difference. Result has 271 places, 265 transitions, 547 flow [2025-02-08 05:46:26,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=271, PETRI_TRANSITIONS=265} [2025-02-08 05:46:26,267 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -97 predicate places. [2025-02-08 05:46:26,267 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 265 transitions, 547 flow [2025-02-08 05:46:26,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.3333333333333) internal successors, (1826), 6 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:26,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:26,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:26,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:46:26,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:26,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1522547441, now seen corresponding path program 1 times [2025-02-08 05:46:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:26,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583475006] [2025-02-08 05:46:26,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:26,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:46:26,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:46:26,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:26,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583475006] [2025-02-08 05:46:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583475006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604335197] [2025-02-08 05:46:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:27,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:27,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:27,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:27,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 412 [2025-02-08 05:46:27,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 265 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 298.1666666666667) internal successors, (1789), 6 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:27,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:27,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 412 [2025-02-08 05:46:27,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:27,762 INFO L124 PetriNetUnfolderBase]: 129/930 cut-off events. [2025-02-08 05:46:27,763 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:46:27,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 930 events. 129/930 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5258 event pairs, 126 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1251. Up to 309 conditions per place. [2025-02-08 05:46:27,768 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 47 selfloop transitions, 5 changer transitions 0/264 dead transitions. [2025-02-08 05:46:27,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 264 transitions, 649 flow [2025-02-08 05:46:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1823 transitions. [2025-02-08 05:46:27,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7374595469255664 [2025-02-08 05:46:27,773 INFO L175 Difference]: Start difference. First operand has 271 places, 265 transitions, 547 flow. Second operand 6 states and 1823 transitions. [2025-02-08 05:46:27,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 264 transitions, 649 flow [2025-02-08 05:46:27,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 264 transitions, 639 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:27,777 INFO L231 Difference]: Finished difference. Result has 270 places, 264 transitions, 545 flow [2025-02-08 05:46:27,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=545, PETRI_PLACES=270, PETRI_TRANSITIONS=264} [2025-02-08 05:46:27,778 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -98 predicate places. [2025-02-08 05:46:27,778 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 264 transitions, 545 flow [2025-02-08 05:46:27,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.1666666666667) internal successors, (1789), 6 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:27,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:27,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:27,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:46:27,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:27,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash 536690037, now seen corresponding path program 1 times [2025-02-08 05:46:27,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:27,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799216731] [2025-02-08 05:46:27,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:27,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:27,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:46:27,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:46:27,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:27,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:27,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:27,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799216731] [2025-02-08 05:46:27,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799216731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:27,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:27,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139414660] [2025-02-08 05:46:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:27,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:27,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:27,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:27,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:27,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 412 [2025-02-08 05:46:27,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 264 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:27,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:27,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 412 [2025-02-08 05:46:27,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:27,991 INFO L124 PetriNetUnfolderBase]: 5/322 cut-off events. [2025-02-08 05:46:27,992 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:27,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 322 events. 5/322 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 572 event pairs, 2 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 353. Up to 18 conditions per place. [2025-02-08 05:46:27,993 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2025-02-08 05:46:27,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 265 transitions, 573 flow [2025-02-08 05:46:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1070 transitions. [2025-02-08 05:46:27,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656957928802589 [2025-02-08 05:46:27,995 INFO L175 Difference]: Start difference. First operand has 270 places, 264 transitions, 545 flow. Second operand 3 states and 1070 transitions. [2025-02-08 05:46:27,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 265 transitions, 573 flow [2025-02-08 05:46:27,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 265 transitions, 563 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:28,001 INFO L231 Difference]: Finished difference. Result has 268 places, 265 transitions, 547 flow [2025-02-08 05:46:28,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=268, PETRI_TRANSITIONS=265} [2025-02-08 05:46:28,002 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -100 predicate places. [2025-02-08 05:46:28,003 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 265 transitions, 547 flow [2025-02-08 05:46:28,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:28,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:28,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:28,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:46:28,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:28,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1142159708, now seen corresponding path program 1 times [2025-02-08 05:46:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841860107] [2025-02-08 05:46:28,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:28,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 05:46:28,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 05:46:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:28,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:46:28,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841860107] [2025-02-08 05:46:28,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841860107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:28,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:28,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824455055] [2025-02-08 05:46:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:28,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:28,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:28,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:29,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 412 [2025-02-08 05:46:29,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 265 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 324.8333333333333) internal successors, (1949), 6 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:29,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:29,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 412 [2025-02-08 05:46:29,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:29,467 INFO L124 PetriNetUnfolderBase]: 53/601 cut-off events. [2025-02-08 05:46:29,468 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:46:29,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 601 events. 53/601 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2449 event pairs, 50 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 767. Up to 149 conditions per place. [2025-02-08 05:46:29,470 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 37 selfloop transitions, 6 changer transitions 0/264 dead transitions. [2025-02-08 05:46:29,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 264 transitions, 631 flow [2025-02-08 05:46:29,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1969 transitions. [2025-02-08 05:46:29,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7965210355987055 [2025-02-08 05:46:29,473 INFO L175 Difference]: Start difference. First operand has 268 places, 265 transitions, 547 flow. Second operand 6 states and 1969 transitions. [2025-02-08 05:46:29,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 264 transitions, 631 flow [2025-02-08 05:46:29,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 264 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:29,476 INFO L231 Difference]: Finished difference. Result has 271 places, 264 transitions, 555 flow [2025-02-08 05:46:29,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=271, PETRI_TRANSITIONS=264} [2025-02-08 05:46:29,477 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -97 predicate places. [2025-02-08 05:46:29,477 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 264 transitions, 555 flow [2025-02-08 05:46:29,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.8333333333333) internal successors, (1949), 6 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:29,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:29,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:29,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:46:29,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:29,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 34254268, now seen corresponding path program 1 times [2025-02-08 05:46:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:29,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075152519] [2025-02-08 05:46:29,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:29,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:46:29,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:46:29,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:29,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:46:29,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:29,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075152519] [2025-02-08 05:46:29,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075152519] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:46:29,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237607019] [2025-02-08 05:46:29,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:29,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:29,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:29,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:46:29,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:46:29,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:46:29,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:46:29,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:29,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:29,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 05:46:29,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:46:29,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-02-08 05:46:29,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-02-08 05:46:29,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 05:46:29,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-02-08 05:46:29,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:29,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2025-02-08 05:46:29,942 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:29,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 27 [2025-02-08 05:46:30,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2025-02-08 05:46:30,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:30,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2025-02-08 05:46:30,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 21 [2025-02-08 05:46:30,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-02-08 05:46:30,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:30,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2025-02-08 05:46:30,266 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:30,267 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:30,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 78 [2025-02-08 05:46:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:46:30,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:46:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237607019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:30,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:46:30,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 05:46:30,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7463881] [2025-02-08 05:46:30,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:30,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:30,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:30,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:30,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:46:30,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 412 [2025-02-08 05:46:30,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 264 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:30,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:30,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 412 [2025-02-08 05:46:30,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:30,966 INFO L124 PetriNetUnfolderBase]: 271/1601 cut-off events. [2025-02-08 05:46:30,966 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:46:30,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 1601 events. 271/1601 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10718 event pairs, 138 based on Foata normal form. 0/1462 useless extension candidates. Maximal degree in co-relation 2253. Up to 541 conditions per place. [2025-02-08 05:46:30,974 INFO L140 encePairwiseOnDemand]: 391/412 looper letters, 52 selfloop transitions, 62 changer transitions 0/325 dead transitions. [2025-02-08 05:46:30,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 325 transitions, 905 flow [2025-02-08 05:46:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1885 transitions. [2025-02-08 05:46:30,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7625404530744336 [2025-02-08 05:46:30,978 INFO L175 Difference]: Start difference. First operand has 271 places, 264 transitions, 555 flow. Second operand 6 states and 1885 transitions. [2025-02-08 05:46:30,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 325 transitions, 905 flow [2025-02-08 05:46:30,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 325 transitions, 893 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:30,983 INFO L231 Difference]: Finished difference. Result has 276 places, 325 transitions, 953 flow [2025-02-08 05:46:30,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=276, PETRI_TRANSITIONS=325} [2025-02-08 05:46:30,985 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -92 predicate places. [2025-02-08 05:46:30,985 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 325 transitions, 953 flow [2025-02-08 05:46:30,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:30,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:30,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:30,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 05:46:31,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:31,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:31,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash -980421674, now seen corresponding path program 1 times [2025-02-08 05:46:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815673725] [2025-02-08 05:46:31,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:31,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:46:31,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:46:31,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:31,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:46:31,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815673725] [2025-02-08 05:46:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815673725] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:46:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942681844] [2025-02-08 05:46:31,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:31,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:31,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:31,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:46:31,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:46:31,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:46:31,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:46:31,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:31,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:31,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:46:31,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:46:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:46:31,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:46:31,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942681844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:31,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:46:31,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-08 05:46:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904890482] [2025-02-08 05:46:31,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:31,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:31,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:31,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:31,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 412 [2025-02-08 05:46:31,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 325 transitions, 953 flow. Second operand has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:31,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:31,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 412 [2025-02-08 05:46:31,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:31,626 INFO L124 PetriNetUnfolderBase]: 128/939 cut-off events. [2025-02-08 05:46:31,627 INFO L125 PetriNetUnfolderBase]: For 134/226 co-relation queries the response was YES. [2025-02-08 05:46:31,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 939 events. 128/939 cut-off events. For 134/226 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4942 event pairs, 0 based on Foata normal form. 8/889 useless extension candidates. Maximal degree in co-relation 1462. Up to 168 conditions per place. [2025-02-08 05:46:31,632 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 21 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-02-08 05:46:31,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 328 transitions, 1013 flow [2025-02-08 05:46:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2025-02-08 05:46:31,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.866504854368932 [2025-02-08 05:46:31,635 INFO L175 Difference]: Start difference. First operand has 276 places, 325 transitions, 953 flow. Second operand 3 states and 1071 transitions. [2025-02-08 05:46:31,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 328 transitions, 1013 flow [2025-02-08 05:46:31,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 328 transitions, 1013 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:31,646 INFO L231 Difference]: Finished difference. Result has 279 places, 325 transitions, 961 flow [2025-02-08 05:46:31,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=961, PETRI_PLACES=279, PETRI_TRANSITIONS=325} [2025-02-08 05:46:31,647 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -89 predicate places. [2025-02-08 05:46:31,647 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 325 transitions, 961 flow [2025-02-08 05:46:31,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.0) internal successors, (1062), 3 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:31,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:31,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:31,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 05:46:31,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:31,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting runErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:31,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:31,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1191964722, now seen corresponding path program 1 times [2025-02-08 05:46:31,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:31,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428359663] [2025-02-08 05:46:31,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:31,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:31,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-08 05:46:31,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 05:46:31,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:31,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:46:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428359663] [2025-02-08 05:46:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428359663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:46:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514424909] [2025-02-08 05:46:32,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:32,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:32,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:46:32,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:46:32,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-08 05:46:32,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 05:46:32,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:32,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:32,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 05:46:32,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:46:32,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-02-08 05:46:32,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-02-08 05:46:32,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 05:46:32,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-02-08 05:46:32,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:32,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2025-02-08 05:46:32,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:32,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 34 [2025-02-08 05:46:32,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2025-02-08 05:46:32,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:32,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2025-02-08 05:46:32,410 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:32,413 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:32,414 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:32,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 57 [2025-02-08 05:46:32,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-02-08 05:46:32,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:32,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2025-02-08 05:46:32,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 69 [2025-02-08 05:46:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 05:46:32,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:46:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514424909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:46:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 05:46:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452195700] [2025-02-08 05:46:32,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:46:33,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 412 [2025-02-08 05:46:33,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 325 transitions, 961 flow. Second operand has 6 states, 6 states have (on average 328.3333333333333) internal successors, (1970), 6 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:33,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:33,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 412 [2025-02-08 05:46:33,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:33,419 INFO L124 PetriNetUnfolderBase]: 162/1007 cut-off events. [2025-02-08 05:46:33,419 INFO L125 PetriNetUnfolderBase]: For 299/423 co-relation queries the response was YES. [2025-02-08 05:46:33,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 1007 events. 162/1007 cut-off events. For 299/423 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5331 event pairs, 11 based on Foata normal form. 5/956 useless extension candidates. Maximal degree in co-relation 1960. Up to 335 conditions per place. [2025-02-08 05:46:33,424 INFO L140 encePairwiseOnDemand]: 401/412 looper letters, 93 selfloop transitions, 36 changer transitions 0/356 dead transitions. [2025-02-08 05:46:33,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 356 transitions, 1369 flow [2025-02-08 05:46:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2005 transitions. [2025-02-08 05:46:33,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.811084142394822 [2025-02-08 05:46:33,428 INFO L175 Difference]: Start difference. First operand has 279 places, 325 transitions, 961 flow. Second operand 6 states and 2005 transitions. [2025-02-08 05:46:33,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 356 transitions, 1369 flow [2025-02-08 05:46:33,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 356 transitions, 1365 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:46:33,435 INFO L231 Difference]: Finished difference. Result has 287 places, 356 transitions, 1291 flow [2025-02-08 05:46:33,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1291, PETRI_PLACES=287, PETRI_TRANSITIONS=356} [2025-02-08 05:46:33,436 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -81 predicate places. [2025-02-08 05:46:33,436 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 356 transitions, 1291 flow [2025-02-08 05:46:33,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 328.3333333333333) internal successors, (1970), 6 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:33,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:33,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:33,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 05:46:33,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:33,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:33,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1131638000, now seen corresponding path program 1 times [2025-02-08 05:46:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967218579] [2025-02-08 05:46:33,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:33,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:46:33,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:46:33,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:33,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:46:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967218579] [2025-02-08 05:46:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967218579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:46:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418957831] [2025-02-08 05:46:33,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:33,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:33,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:33,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:46:33,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 05:46:33,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:46:33,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:46:33,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:33,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:33,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 05:46:33,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:46:33,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-02-08 05:46:33,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 05:46:33,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-02-08 05:46:34,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-02-08 05:46:34,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:34,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2025-02-08 05:46:34,044 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:34,047 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:34,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 30 [2025-02-08 05:46:34,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2025-02-08 05:46:34,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:34,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2025-02-08 05:46:34,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:34,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 51 [2025-02-08 05:46:34,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-02-08 05:46:34,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:34,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2025-02-08 05:46:34,261 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:34,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:34,266 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:34,269 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:34,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 84 [2025-02-08 05:46:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 05:46:34,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:46:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418957831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:34,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:46:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 05:46:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202123314] [2025-02-08 05:46:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:34,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:34,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:34,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:46:34,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 412 [2025-02-08 05:46:34,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 356 transitions, 1291 flow. Second operand has 6 states, 6 states have (on average 325.5) internal successors, (1953), 6 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:34,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:34,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 412 [2025-02-08 05:46:34,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:35,244 INFO L124 PetriNetUnfolderBase]: 280/1578 cut-off events. [2025-02-08 05:46:35,245 INFO L125 PetriNetUnfolderBase]: For 761/1004 co-relation queries the response was YES. [2025-02-08 05:46:35,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 1578 events. 280/1578 cut-off events. For 761/1004 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 10803 event pairs, 45 based on Foata normal form. 18/1496 useless extension candidates. Maximal degree in co-relation 3147. Up to 489 conditions per place. [2025-02-08 05:46:35,253 INFO L140 encePairwiseOnDemand]: 397/412 looper letters, 107 selfloop transitions, 37 changer transitions 13/400 dead transitions. [2025-02-08 05:46:35,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 400 transitions, 1783 flow [2025-02-08 05:46:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2014 transitions. [2025-02-08 05:46:35,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8147249190938511 [2025-02-08 05:46:35,257 INFO L175 Difference]: Start difference. First operand has 287 places, 356 transitions, 1291 flow. Second operand 6 states and 2014 transitions. [2025-02-08 05:46:35,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 400 transitions, 1783 flow [2025-02-08 05:46:35,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 400 transitions, 1765 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:35,317 INFO L231 Difference]: Finished difference. Result has 297 places, 387 transitions, 1586 flow [2025-02-08 05:46:35,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1586, PETRI_PLACES=297, PETRI_TRANSITIONS=387} [2025-02-08 05:46:35,318 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -71 predicate places. [2025-02-08 05:46:35,319 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 387 transitions, 1586 flow [2025-02-08 05:46:35,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 325.5) internal successors, (1953), 6 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:35,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:35,320 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:35,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:46:35,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 05:46:35,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:35,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash 669144879, now seen corresponding path program 1 times [2025-02-08 05:46:35,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:35,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847240872] [2025-02-08 05:46:35,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:35,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:35,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:46:35,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:46:35,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:35,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:46:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847240872] [2025-02-08 05:46:35,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847240872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:46:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106229235] [2025-02-08 05:46:35,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:35,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:46:35,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 05:46:35,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-08 05:46:35,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-08 05:46:35,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:35,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:35,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 05:46:35,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:46:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:46:35,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:46:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:46:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106229235] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:46:35,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:46:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 05:46:35,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734133888] [2025-02-08 05:46:35,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:46:35,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:46:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:35,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:46:35,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:46:36,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 412 [2025-02-08 05:46:36,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 387 transitions, 1586 flow. Second operand has 9 states, 9 states have (on average 351.22222222222223) internal successors, (3161), 9 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:36,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:36,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 412 [2025-02-08 05:46:36,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:36,289 INFO L124 PetriNetUnfolderBase]: 220/1308 cut-off events. [2025-02-08 05:46:36,290 INFO L125 PetriNetUnfolderBase]: For 607/660 co-relation queries the response was YES. [2025-02-08 05:46:36,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2606 conditions, 1308 events. 220/1308 cut-off events. For 607/660 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7817 event pairs, 5 based on Foata normal form. 3/1251 useless extension candidates. Maximal degree in co-relation 2585. Up to 266 conditions per place. [2025-02-08 05:46:36,297 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 22 selfloop transitions, 9 changer transitions 0/395 dead transitions. [2025-02-08 05:46:36,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 395 transitions, 1666 flow [2025-02-08 05:46:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:46:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:46:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3166 transitions. [2025-02-08 05:46:36,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8538295577130529 [2025-02-08 05:46:36,303 INFO L175 Difference]: Start difference. First operand has 297 places, 387 transitions, 1586 flow. Second operand 9 states and 3166 transitions. [2025-02-08 05:46:36,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 395 transitions, 1666 flow [2025-02-08 05:46:36,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 395 transitions, 1666 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:36,313 INFO L231 Difference]: Finished difference. Result has 304 places, 393 transitions, 1636 flow [2025-02-08 05:46:36,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1636, PETRI_PLACES=304, PETRI_TRANSITIONS=393} [2025-02-08 05:46:36,315 INFO L279 CegarLoopForPetriNet]: 368 programPoint places, -64 predicate places. [2025-02-08 05:46:36,315 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 393 transitions, 1636 flow [2025-02-08 05:46:36,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 351.22222222222223) internal successors, (3161), 9 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:36,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:36,317 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:36,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 05:46:36,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 05:46:36,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-02-08 05:46:36,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1138568579, now seen corresponding path program 2 times [2025-02-08 05:46:36,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:36,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588611822] [2025-02-08 05:46:36,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:46:36,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:36,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 190 statements into 2 equivalence classes. [2025-02-08 05:46:36,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 05:46:36,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:46:36,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:36,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:36,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 05:46:36,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 05:46:36,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:36,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:36,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:36,714 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:36,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 27 remaining) [2025-02-08 05:46:36,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-02-08 05:46:36,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-02-08 05:46:36,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-02-08 05:46:36,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-02-08 05:46:36,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-02-08 05:46:36,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-02-08 05:46:36,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-02-08 05:46:36,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-02-08 05:46:36,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-02-08 05:46:36,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-02-08 05:46:36,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-02-08 05:46:36,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-02-08 05:46:36,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-02-08 05:46:36,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-02-08 05:46:36,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:46:36,718 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:36,720 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:46:36,720 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:46:36,779 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:46:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 553 places, 628 transitions, 1272 flow [2025-02-08 05:46:36,854 INFO L124 PetriNetUnfolderBase]: 81/720 cut-off events. [2025-02-08 05:46:36,854 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:46:36,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 720 events. 81/720 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2889 event pairs, 0 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 486. Up to 6 conditions per place. [2025-02-08 05:46:36,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 553 places, 628 transitions, 1272 flow [2025-02-08 05:46:36,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 553 places, 628 transitions, 1272 flow [2025-02-08 05:46:36,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:36,872 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7072229d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:36,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-02-08 05:46:36,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:36,876 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-02-08 05:46:36,876 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:36,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:36,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:36,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:36,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash -85968092, now seen corresponding path program 1 times [2025-02-08 05:46:36,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:36,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978663352] [2025-02-08 05:46:36,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:36,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:36,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:46:36,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:46:36,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:36,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:36,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978663352] [2025-02-08 05:46:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978663352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:36,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:36,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:36,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102563325] [2025-02-08 05:46:36,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:36,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:36,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:36,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:36,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 537 out of 628 [2025-02-08 05:46:36,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 628 transitions, 1272 flow. Second operand has 2 states, 2 states have (on average 538.0) internal successors, (1076), 2 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:36,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:36,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 537 of 628 [2025-02-08 05:46:36,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:36,985 INFO L124 PetriNetUnfolderBase]: 18/848 cut-off events. [2025-02-08 05:46:36,985 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:46:36,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 848 events. 18/848 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3862 event pairs, 10 based on Foata normal form. 152/916 useless extension candidates. Maximal degree in co-relation 319. Up to 33 conditions per place. [2025-02-08 05:46:36,991 INFO L140 encePairwiseOnDemand]: 574/628 looper letters, 10 selfloop transitions, 0 changer transitions 11/382 dead transitions. [2025-02-08 05:46:36,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 382 transitions, 800 flow [2025-02-08 05:46:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1138 transitions. [2025-02-08 05:46:36,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060509554140127 [2025-02-08 05:46:36,993 INFO L175 Difference]: Start difference. First operand has 553 places, 628 transitions, 1272 flow. Second operand 2 states and 1138 transitions. [2025-02-08 05:46:36,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 382 transitions, 800 flow [2025-02-08 05:46:36,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 382 transitions, 800 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:36,997 INFO L231 Difference]: Finished difference. Result has 383 places, 371 transitions, 758 flow [2025-02-08 05:46:36,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=758, PETRI_PLACES=383, PETRI_TRANSITIONS=371} [2025-02-08 05:46:36,998 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -170 predicate places. [2025-02-08 05:46:36,998 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 371 transitions, 758 flow [2025-02-08 05:46:36,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 538.0) internal successors, (1076), 2 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:36,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:36,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:36,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:46:36,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:36,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1507912183, now seen corresponding path program 1 times [2025-02-08 05:46:36,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:36,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148546094] [2025-02-08 05:46:36,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:36,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:37,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:46:37,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:46:37,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:37,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:37,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148546094] [2025-02-08 05:46:37,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148546094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:37,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:37,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615570482] [2025-02-08 05:46:37,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:37,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:37,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:37,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:37,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 628 [2025-02-08 05:46:37,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 371 transitions, 758 flow. Second operand has 6 states, 6 states have (on average 455.3333333333333) internal successors, (2732), 6 states have internal predecessors, (2732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:37,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:37,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 628 [2025-02-08 05:46:37,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:38,943 INFO L124 PetriNetUnfolderBase]: 3774/14816 cut-off events. [2025-02-08 05:46:38,943 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-02-08 05:46:38,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20947 conditions, 14816 events. 3774/14816 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 173889 event pairs, 3766 based on Foata normal form. 0/13627 useless extension candidates. Maximal degree in co-relation 20942. Up to 6043 conditions per place. [2025-02-08 05:46:39,012 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 55 selfloop transitions, 5 changer transitions 0/370 dead transitions. [2025-02-08 05:46:39,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 370 transitions, 876 flow [2025-02-08 05:46:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2785 transitions. [2025-02-08 05:46:39,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7391188959660298 [2025-02-08 05:46:39,017 INFO L175 Difference]: Start difference. First operand has 383 places, 371 transitions, 758 flow. Second operand 6 states and 2785 transitions. [2025-02-08 05:46:39,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 370 transitions, 876 flow [2025-02-08 05:46:39,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 370 transitions, 876 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:39,021 INFO L231 Difference]: Finished difference. Result has 376 places, 370 transitions, 766 flow [2025-02-08 05:46:39,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=376, PETRI_TRANSITIONS=370} [2025-02-08 05:46:39,022 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -177 predicate places. [2025-02-08 05:46:39,022 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 370 transitions, 766 flow [2025-02-08 05:46:39,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 455.3333333333333) internal successors, (2732), 6 states have internal predecessors, (2732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:39,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:39,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:39,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:46:39,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:39,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1308257497, now seen corresponding path program 1 times [2025-02-08 05:46:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:39,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976162422] [2025-02-08 05:46:39,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:39,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:39,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:46:39,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:46:39,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:39,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:39,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:39,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976162422] [2025-02-08 05:46:39,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976162422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:39,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:39,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:39,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351182920] [2025-02-08 05:46:39,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:39,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:39,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:39,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:39,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:39,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 628 [2025-02-08 05:46:39,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 370 transitions, 766 flow. Second operand has 6 states, 6 states have (on average 455.3333333333333) internal successors, (2732), 6 states have internal predecessors, (2732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:39,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:39,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 628 [2025-02-08 05:46:39,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:41,128 INFO L124 PetriNetUnfolderBase]: 3774/14815 cut-off events. [2025-02-08 05:46:41,128 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-02-08 05:46:41,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20952 conditions, 14815 events. 3774/14815 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 173782 event pairs, 3766 based on Foata normal form. 0/13627 useless extension candidates. Maximal degree in co-relation 20946. Up to 6043 conditions per place. [2025-02-08 05:46:41,202 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 55 selfloop transitions, 5 changer transitions 0/369 dead transitions. [2025-02-08 05:46:41,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 369 transitions, 884 flow [2025-02-08 05:46:41,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2785 transitions. [2025-02-08 05:46:41,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7391188959660298 [2025-02-08 05:46:41,208 INFO L175 Difference]: Start difference. First operand has 376 places, 370 transitions, 766 flow. Second operand 6 states and 2785 transitions. [2025-02-08 05:46:41,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 369 transitions, 884 flow [2025-02-08 05:46:41,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 369 transitions, 874 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:41,212 INFO L231 Difference]: Finished difference. Result has 375 places, 369 transitions, 764 flow [2025-02-08 05:46:41,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=375, PETRI_TRANSITIONS=369} [2025-02-08 05:46:41,213 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -178 predicate places. [2025-02-08 05:46:41,213 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 369 transitions, 764 flow [2025-02-08 05:46:41,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 455.3333333333333) internal successors, (2732), 6 states have internal predecessors, (2732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:41,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:41,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:41,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:46:41,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:41,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1168517221, now seen corresponding path program 1 times [2025-02-08 05:46:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:41,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831427760] [2025-02-08 05:46:41,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:41,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:41,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:46:41,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:46:41,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:41,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:41,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831427760] [2025-02-08 05:46:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831427760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:41,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096810974] [2025-02-08 05:46:41,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:41,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:41,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:41,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:42,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 628 [2025-02-08 05:46:42,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 369 transitions, 764 flow. Second operand has 6 states, 6 states have (on average 449.1666666666667) internal successors, (2695), 6 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:42,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:42,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 628 [2025-02-08 05:46:42,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:43,680 INFO L124 PetriNetUnfolderBase]: 4223/16455 cut-off events. [2025-02-08 05:46:43,680 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-02-08 05:46:43,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23304 conditions, 16455 events. 4223/16455 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 199310 event pairs, 4214 based on Foata normal form. 0/15126 useless extension candidates. Maximal degree in co-relation 23298. Up to 6755 conditions per place. [2025-02-08 05:46:43,762 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 63 selfloop transitions, 5 changer transitions 0/368 dead transitions. [2025-02-08 05:46:43,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 368 transitions, 898 flow [2025-02-08 05:46:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2745 transitions. [2025-02-08 05:46:43,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7285031847133758 [2025-02-08 05:46:43,766 INFO L175 Difference]: Start difference. First operand has 375 places, 369 transitions, 764 flow. Second operand 6 states and 2745 transitions. [2025-02-08 05:46:43,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 368 transitions, 898 flow [2025-02-08 05:46:43,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 368 transitions, 888 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:43,771 INFO L231 Difference]: Finished difference. Result has 374 places, 368 transitions, 762 flow [2025-02-08 05:46:43,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=762, PETRI_PLACES=374, PETRI_TRANSITIONS=368} [2025-02-08 05:46:43,771 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -179 predicate places. [2025-02-08 05:46:43,772 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 368 transitions, 762 flow [2025-02-08 05:46:43,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 449.1666666666667) internal successors, (2695), 6 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:43,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:43,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:43,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:46:43,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:43,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1838268939, now seen corresponding path program 1 times [2025-02-08 05:46:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:43,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282047358] [2025-02-08 05:46:43,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:43,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 05:46:43,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 05:46:43,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:43,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:46:43,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:43,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282047358] [2025-02-08 05:46:43,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282047358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:43,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:43,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325591560] [2025-02-08 05:46:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:43,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:43,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:43,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:43,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:43,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 628 [2025-02-08 05:46:43,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 368 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:43,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:43,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 628 [2025-02-08 05:46:43,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:43,970 INFO L124 PetriNetUnfolderBase]: 36/886 cut-off events. [2025-02-08 05:46:43,970 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:46:43,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 886 events. 36/886 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4484 event pairs, 26 based on Foata normal form. 1/799 useless extension candidates. Maximal degree in co-relation 987. Up to 72 conditions per place. [2025-02-08 05:46:43,976 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 15 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-02-08 05:46:43,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 369 transitions, 798 flow [2025-02-08 05:46:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1611 transitions. [2025-02-08 05:46:43,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8550955414012739 [2025-02-08 05:46:43,979 INFO L175 Difference]: Start difference. First operand has 374 places, 368 transitions, 762 flow. Second operand 3 states and 1611 transitions. [2025-02-08 05:46:43,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 369 transitions, 798 flow [2025-02-08 05:46:43,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 369 transitions, 788 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:43,983 INFO L231 Difference]: Finished difference. Result has 372 places, 369 transitions, 764 flow [2025-02-08 05:46:43,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=372, PETRI_TRANSITIONS=369} [2025-02-08 05:46:43,984 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -181 predicate places. [2025-02-08 05:46:43,984 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 369 transitions, 764 flow [2025-02-08 05:46:43,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:43,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:43,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:43,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:46:43,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:43,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1746844184, now seen corresponding path program 1 times [2025-02-08 05:46:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:43,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193078212] [2025-02-08 05:46:43,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:44,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 05:46:44,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 05:46:44,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:44,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:46:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193078212] [2025-02-08 05:46:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193078212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:44,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340595216] [2025-02-08 05:46:44,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:44,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:44,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:44,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:44,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:45,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 628 [2025-02-08 05:46:45,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 369 transitions, 764 flow. Second operand has 6 states, 6 states have (on average 495.8333333333333) internal successors, (2975), 6 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:45,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:45,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 628 [2025-02-08 05:46:45,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:46,195 INFO L124 PetriNetUnfolderBase]: 1308/6067 cut-off events. [2025-02-08 05:46:46,195 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-02-08 05:46:46,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8306 conditions, 6067 events. 1308/6067 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 62309 event pairs, 1290 based on Foata normal form. 0/5467 useless extension candidates. Maximal degree in co-relation 8299. Up to 2159 conditions per place. [2025-02-08 05:46:46,233 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 49 selfloop transitions, 6 changer transitions 0/368 dead transitions. [2025-02-08 05:46:46,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 368 transitions, 872 flow [2025-02-08 05:46:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3007 transitions. [2025-02-08 05:46:46,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.798036093418259 [2025-02-08 05:46:46,238 INFO L175 Difference]: Start difference. First operand has 372 places, 369 transitions, 764 flow. Second operand 6 states and 3007 transitions. [2025-02-08 05:46:46,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 368 transitions, 872 flow [2025-02-08 05:46:46,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 368 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:46,243 INFO L231 Difference]: Finished difference. Result has 375 places, 368 transitions, 772 flow [2025-02-08 05:46:46,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=375, PETRI_TRANSITIONS=368} [2025-02-08 05:46:46,243 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -178 predicate places. [2025-02-08 05:46:46,243 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 368 transitions, 772 flow [2025-02-08 05:46:46,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 495.8333333333333) internal successors, (2975), 6 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:46,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:46,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:46,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:46:46,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:46,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1850887612, now seen corresponding path program 1 times [2025-02-08 05:46:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744311015] [2025-02-08 05:46:46,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:46,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:46:46,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:46:46,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:46,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:46:46,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744311015] [2025-02-08 05:46:46,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744311015] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:46:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796691016] [2025-02-08 05:46:46,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:46,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:46,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:46,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:46:46,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 05:46:46,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:46:46,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:46:46,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:46,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:46,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 05:46:46,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:46:46,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-02-08 05:46:46,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-02-08 05:46:46,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 05:46:46,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-02-08 05:46:46,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:46,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2025-02-08 05:46:46,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 20 [2025-02-08 05:46:46,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2025-02-08 05:46:46,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:46,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2025-02-08 05:46:46,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 21 [2025-02-08 05:46:46,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-02-08 05:46:46,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:46,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2025-02-08 05:46:47,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 38 [2025-02-08 05:46:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:46:47,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:46:47,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796691016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:47,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:46:47,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 05:46:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109140044] [2025-02-08 05:46:47,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:47,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:47,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:47,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:47,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:46:47,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 628 [2025-02-08 05:46:47,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 368 transitions, 772 flow. Second operand has 6 states, 6 states have (on average 450.5) internal successors, (2703), 6 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:47,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:47,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 628 [2025-02-08 05:46:47,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:50,871 INFO L124 PetriNetUnfolderBase]: 9238/31041 cut-off events. [2025-02-08 05:46:50,872 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-02-08 05:46:50,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45845 conditions, 31041 events. 9238/31041 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 386392 event pairs, 5526 based on Foata normal form. 0/28278 useless extension candidates. Maximal degree in co-relation 45838. Up to 13204 conditions per place. [2025-02-08 05:46:50,994 INFO L140 encePairwiseOnDemand]: 593/628 looper letters, 69 selfloop transitions, 118 changer transitions 0/486 dead transitions. [2025-02-08 05:46:50,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 486 transitions, 1387 flow [2025-02-08 05:46:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2864 transitions. [2025-02-08 05:46:50,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7600849256900213 [2025-02-08 05:46:50,999 INFO L175 Difference]: Start difference. First operand has 375 places, 368 transitions, 772 flow. Second operand 6 states and 2864 transitions. [2025-02-08 05:46:50,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 486 transitions, 1387 flow [2025-02-08 05:46:51,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 486 transitions, 1375 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:51,006 INFO L231 Difference]: Finished difference. Result has 380 places, 485 transitions, 1534 flow [2025-02-08 05:46:51,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1534, PETRI_PLACES=380, PETRI_TRANSITIONS=485} [2025-02-08 05:46:51,007 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -173 predicate places. [2025-02-08 05:46:51,008 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 485 transitions, 1534 flow [2025-02-08 05:46:51,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 450.5) internal successors, (2703), 6 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:51,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:51,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:51,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 05:46:51,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:51,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:51,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:51,210 INFO L85 PathProgramCache]: Analyzing trace with hash 836211670, now seen corresponding path program 1 times [2025-02-08 05:46:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:51,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407815318] [2025-02-08 05:46:51,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:51,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:51,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:46:51,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:46:51,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:51,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:46:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:51,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407815318] [2025-02-08 05:46:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407815318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:46:51,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938828906] [2025-02-08 05:46:51,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:51,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:51,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:51,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:46:51,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 05:46:51,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:46:51,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:46:51,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:51,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:51,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:46:51,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:46:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:46:51,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:46:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938828906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:51,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:46:51,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-08 05:46:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841716635] [2025-02-08 05:46:51,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:51,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:51,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:51,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:51,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 628 [2025-02-08 05:46:51,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 485 transitions, 1534 flow. Second operand has 3 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:51,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:51,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 628 [2025-02-08 05:46:51,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:53,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L4421-17-->L4421-10: Formula: (let ((.cse1 (+ 3 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse3 (+ 2 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse2 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15| 1)) (.cse0 (select |v_#race_397| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|))) (and (= (select .cse0 .cse1) 0) (= (store |v_#race_398| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15| (store (store (store (store (select |v_#race_398| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15| 0) .cse2 0) .cse3 0) .cse1 0)) |v_#race_397|) (= (select .cse0 .cse3) 0) (= (select .cse0 .cse2) 0) (= (select (select |v_#memory_int_71| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|) |v_runThread1of2ForFork0_vatomic32_read_#t~mem436#1_11|) (= (select .cse0 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|) 0))) InVars {#race=|v_#race_398|, #memory_int=|v_#memory_int_71|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|} OutVars{#race=|v_#race_397|, #memory_int=|v_#memory_int_71|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread1of2ForFork0_vatomic32_read_#t~mem436#1=|v_runThread1of2ForFork0_vatomic32_read_#t~mem436#1_11|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|} AuxVars[] AssignedVars[#race, runThread1of2ForFork0_vatomic32_read_#t~mem436#1][441], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), 485#L6114-5true, 362#L4421-10true, 554#true, 94#L4421-28true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, 981#true]) [2025-02-08 05:46:53,402 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-02-08 05:46:53,402 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-02-08 05:46:53,402 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-02-08 05:46:53,402 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-02-08 05:46:53,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L4421-17-->L4421-10: Formula: (let ((.cse1 (+ 3 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse3 (+ 2 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse2 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15| 1)) (.cse0 (select |v_#race_397| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|))) (and (= (select .cse0 .cse1) 0) (= (store |v_#race_398| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15| (store (store (store (store (select |v_#race_398| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15| 0) .cse2 0) .cse3 0) .cse1 0)) |v_#race_397|) (= (select .cse0 .cse3) 0) (= (select .cse0 .cse2) 0) (= (select (select |v_#memory_int_71| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|) |v_runThread1of2ForFork0_vatomic32_read_#t~mem436#1_11|) (= (select .cse0 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|) 0))) InVars {#race=|v_#race_398|, #memory_int=|v_#memory_int_71|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|} OutVars{#race=|v_#race_397|, #memory_int=|v_#memory_int_71|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread1of2ForFork0_vatomic32_read_#t~mem436#1=|v_runThread1of2ForFork0_vatomic32_read_#t~mem436#1_11|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|} AuxVars[] AssignedVars[#race, runThread1of2ForFork0_vatomic32_read_#t~mem436#1][441], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), 362#L4421-10true, 554#true, 94#L4421-28true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, 981#true, 207#ULTIMATE.startFINALtrue]) [2025-02-08 05:46:53,404 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,404 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,404 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,404 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2036] L4421-17-->L4421-10: Formula: (let ((.cse1 (+ 1 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse3 (+ 3 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse0 (select |v_#race_397| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|)) (.cse2 (+ 2 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|) 0) (= (store |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15| (store (store (store (store (select |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15| 0) .cse1 0) .cse2 0) .cse3 0)) |v_#race_397|) (= (select .cse0 .cse3) 0) (= |v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11| (select (select |v_#memory_int_71| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (= 0 (select .cse0 .cse2)))) InVars {#race=|v_#race_398|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} OutVars{#race=|v_#race_397|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_#t~mem436#1=|v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} AuxVars[] AssignedVars[#race, runThread2of2ForFork0_vatomic32_read_#t~mem436#1][481], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), 485#L6114-5true, 133#L4421-10true, 117#L4421-28true, 554#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, 981#true]) [2025-02-08 05:46:53,407 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-02-08 05:46:53,407 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-02-08 05:46:53,407 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-02-08 05:46:53,407 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-02-08 05:46:53,491 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2250] L4421-17-->L4421-10: Formula: (let ((.cse1 (+ 3 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse3 (+ 2 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse2 (+ |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15| 1)) (.cse0 (select |v_#race_397| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|))) (and (= (select .cse0 .cse1) 0) (= (store |v_#race_398| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15| (store (store (store (store (select |v_#race_398| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15| 0) .cse2 0) .cse3 0) .cse1 0)) |v_#race_397|) (= (select .cse0 .cse3) 0) (= (select .cse0 .cse2) 0) (= (select (select |v_#memory_int_71| |v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|) |v_runThread1of2ForFork0_vatomic32_read_#t~mem436#1_11|) (= (select .cse0 |v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|) 0))) InVars {#race=|v_#race_398|, #memory_int=|v_#memory_int_71|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|} OutVars{#race=|v_#race_397|, #memory_int=|v_#memory_int_71|, runThread1of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread1of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread1of2ForFork0_vatomic32_read_#t~mem436#1=|v_runThread1of2ForFork0_vatomic32_read_#t~mem436#1_11|, runThread1of2ForFork0_vatomic32_read_~a#1.base=|v_runThread1of2ForFork0_vatomic32_read_~a#1.base_15|} AuxVars[] AssignedVars[#race, runThread1of2ForFork0_vatomic32_read_#t~mem436#1][441], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), 362#L4421-10true, 554#true, 94#L4421-28true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, 981#true, 207#ULTIMATE.startFINALtrue]) [2025-02-08 05:46:53,491 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,491 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,491 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,491 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,491 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2036] L4421-17-->L4421-10: Formula: (let ((.cse1 (+ 1 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse3 (+ 3 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse0 (select |v_#race_397| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|)) (.cse2 (+ 2 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|) 0) (= (store |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15| (store (store (store (store (select |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15| 0) .cse1 0) .cse2 0) .cse3 0)) |v_#race_397|) (= (select .cse0 .cse3) 0) (= |v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11| (select (select |v_#memory_int_71| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (= 0 (select .cse0 .cse2)))) InVars {#race=|v_#race_398|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} OutVars{#race=|v_#race_397|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_#t~mem436#1=|v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} AuxVars[] AssignedVars[#race, runThread2of2ForFork0_vatomic32_read_#t~mem436#1][481], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), 133#L4421-10true, 117#L4421-28true, 554#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, 981#true, 207#ULTIMATE.startFINALtrue]) [2025-02-08 05:46:53,493 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,493 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,493 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,493 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-02-08 05:46:53,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2036] L4421-17-->L4421-10: Formula: (let ((.cse1 (+ 1 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse3 (+ 3 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse0 (select |v_#race_397| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|)) (.cse2 (+ 2 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|) 0) (= (store |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15| (store (store (store (store (select |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15| 0) .cse1 0) .cse2 0) .cse3 0)) |v_#race_397|) (= (select .cse0 .cse3) 0) (= |v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11| (select (select |v_#memory_int_71| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (= 0 (select .cse0 .cse2)))) InVars {#race=|v_#race_398|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} OutVars{#race=|v_#race_397|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_#t~mem436#1=|v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} AuxVars[] AssignedVars[#race, runThread2of2ForFork0_vatomic32_read_#t~mem436#1][481], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), 485#L6114-5true, 362#L4421-10true, 133#L4421-10true, 554#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, 981#true]) [2025-02-08 05:46:53,520 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-02-08 05:46:53,520 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:46:53,520 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:46:53,520 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:46:53,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2036] L4421-17-->L4421-10: Formula: (let ((.cse1 (+ 1 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse3 (+ 3 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse0 (select |v_#race_397| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|)) (.cse2 (+ 2 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|) 0) (= (store |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15| (store (store (store (store (select |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15| 0) .cse1 0) .cse2 0) .cse3 0)) |v_#race_397|) (= (select .cse0 .cse3) 0) (= |v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11| (select (select |v_#memory_int_71| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (= 0 (select .cse0 .cse2)))) InVars {#race=|v_#race_398|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} OutVars{#race=|v_#race_397|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_#t~mem436#1=|v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} AuxVars[] AssignedVars[#race, runThread2of2ForFork0_vatomic32_read_#t~mem436#1][481], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), 362#L4421-10true, 133#L4421-10true, 554#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, 981#true, 207#ULTIMATE.startFINALtrue]) [2025-02-08 05:46:53,529 INFO L294 olderBase$Statistics]: this new event has 260 ancestors and is cut-off event [2025-02-08 05:46:53,529 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-02-08 05:46:53,529 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-02-08 05:46:53,529 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-02-08 05:46:53,529 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2036] L4421-17-->L4421-10: Formula: (let ((.cse1 (+ 1 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse3 (+ 3 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (.cse0 (select |v_#race_397| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|)) (.cse2 (+ 2 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|) 0) (= (store |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15| (store (store (store (store (select |v_#race_398| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15| 0) .cse1 0) .cse2 0) .cse3 0)) |v_#race_397|) (= (select .cse0 .cse3) 0) (= |v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11| (select (select |v_#memory_int_71| |v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|) |v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|)) (= 0 (select .cse0 .cse2)))) InVars {#race=|v_#race_398|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} OutVars{#race=|v_#race_397|, #memory_int=|v_#memory_int_71|, runThread2of2ForFork0_vatomic32_read_~a#1.offset=|v_runThread2of2ForFork0_vatomic32_read_~a#1.offset_15|, runThread2of2ForFork0_vatomic32_read_#t~mem436#1=|v_runThread2of2ForFork0_vatomic32_read_#t~mem436#1_11|, runThread2of2ForFork0_vatomic32_read_~a#1.base=|v_runThread2of2ForFork0_vatomic32_read_~a#1.base_15|} AuxVars[] AssignedVars[#race, runThread2of2ForFork0_vatomic32_read_#t~mem436#1][481], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), 362#L4421-10true, 133#L4421-10true, 554#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, 981#true, 207#ULTIMATE.startFINALtrue]) [2025-02-08 05:46:53,529 INFO L294 olderBase$Statistics]: this new event has 260 ancestors and is cut-off event [2025-02-08 05:46:53,530 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-02-08 05:46:53,530 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-02-08 05:46:53,530 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-02-08 05:46:53,530 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2025-02-08 05:46:53,531 INFO L124 PetriNetUnfolderBase]: 4703/16671 cut-off events. [2025-02-08 05:46:53,531 INFO L125 PetriNetUnfolderBase]: For 4404/6108 co-relation queries the response was YES. [2025-02-08 05:46:53,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29079 conditions, 16671 events. 4703/16671 cut-off events. For 4404/6108 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 190927 event pairs, 1487 based on Foata normal form. 8/15259 useless extension candidates. Maximal degree in co-relation 29068. Up to 5598 conditions per place. [2025-02-08 05:46:53,651 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 34 selfloop transitions, 2 changer transitions 0/489 dead transitions. [2025-02-08 05:46:53,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 489 transitions, 1622 flow [2025-02-08 05:46:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1613 transitions. [2025-02-08 05:46:53,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8561571125265393 [2025-02-08 05:46:53,654 INFO L175 Difference]: Start difference. First operand has 380 places, 485 transitions, 1534 flow. Second operand 3 states and 1613 transitions. [2025-02-08 05:46:53,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 489 transitions, 1622 flow [2025-02-08 05:46:53,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 489 transitions, 1622 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:53,689 INFO L231 Difference]: Finished difference. Result has 383 places, 486 transitions, 1546 flow [2025-02-08 05:46:53,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1546, PETRI_PLACES=383, PETRI_TRANSITIONS=486} [2025-02-08 05:46:53,690 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -170 predicate places. [2025-02-08 05:46:53,690 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 486 transitions, 1546 flow [2025-02-08 05:46:53,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:53,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:53,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:53,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 05:46:53,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:53,895 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting runErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:53,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash 43407282, now seen corresponding path program 1 times [2025-02-08 05:46:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:53,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800278742] [2025-02-08 05:46:53,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:53,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-08 05:46:53,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 05:46:53,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:53,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 05:46:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800278742] [2025-02-08 05:46:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800278742] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:46:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522369740] [2025-02-08 05:46:54,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:54,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:54,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:54,054 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:46:54,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 05:46:54,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-08 05:46:54,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 05:46:54,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:54,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:54,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 05:46:54,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:46:54,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-02-08 05:46:54,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 05:46:54,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-02-08 05:46:54,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-02-08 05:46:54,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:54,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2025-02-08 05:46:54,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 34 [2025-02-08 05:46:54,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2025-02-08 05:46:54,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:54,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2025-02-08 05:46:54,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 51 [2025-02-08 05:46:54,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-02-08 05:46:54,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:54,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2025-02-08 05:46:54,577 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:54,580 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:54,584 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:54,586 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:54,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 84 [2025-02-08 05:46:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 05:46:54,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:46:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522369740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:46:54,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 05:46:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099561912] [2025-02-08 05:46:54,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:54,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:54,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:54,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:46:55,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 495 out of 628 [2025-02-08 05:46:55,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 486 transitions, 1546 flow. Second operand has 6 states, 6 states have (on average 499.3333333333333) internal successors, (2996), 6 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:55,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:55,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 495 of 628 [2025-02-08 05:46:55,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:57,864 INFO L124 PetriNetUnfolderBase]: 6636/21160 cut-off events. [2025-02-08 05:46:57,864 INFO L125 PetriNetUnfolderBase]: For 7746/16528 co-relation queries the response was YES. [2025-02-08 05:46:57,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45305 conditions, 21160 events. 6636/21160 cut-off events. For 7746/16528 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 239889 event pairs, 1461 based on Foata normal form. 57/19612 useless extension candidates. Maximal degree in co-relation 45292. Up to 8389 conditions per place. [2025-02-08 05:46:58,048 INFO L140 encePairwiseOnDemand]: 609/628 looper letters, 175 selfloop transitions, 124 changer transitions 0/635 dead transitions. [2025-02-08 05:46:58,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 635 transitions, 2922 flow [2025-02-08 05:46:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3091 transitions. [2025-02-08 05:46:58,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8203290870488322 [2025-02-08 05:46:58,054 INFO L175 Difference]: Start difference. First operand has 383 places, 486 transitions, 1546 flow. Second operand 6 states and 3091 transitions. [2025-02-08 05:46:58,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 635 transitions, 2922 flow [2025-02-08 05:46:58,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 635 transitions, 2920 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:58,113 INFO L231 Difference]: Finished difference. Result has 392 places, 605 transitions, 2774 flow [2025-02-08 05:46:58,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2774, PETRI_PLACES=392, PETRI_TRANSITIONS=605} [2025-02-08 05:46:58,114 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -161 predicate places. [2025-02-08 05:46:58,114 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 605 transitions, 2774 flow [2025-02-08 05:46:58,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 499.3333333333333) internal successors, (2996), 6 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:58,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:58,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:58,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 05:46:58,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:58,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:46:58,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash 35788378, now seen corresponding path program 1 times [2025-02-08 05:46:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675389968] [2025-02-08 05:46:58,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:58,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:46:58,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:46:58,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:58,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 05:46:58,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675389968] [2025-02-08 05:46:58,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675389968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:46:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044796039] [2025-02-08 05:46:58,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:58,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:46:58,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:58,474 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:46:58,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 05:46:58,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-08 05:46:58,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-08 05:46:58,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:58,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:58,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 05:46:58,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:46:58,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-02-08 05:46:58,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-02-08 05:46:58,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 05:46:58,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-02-08 05:46:58,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:58,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2025-02-08 05:46:58,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:58,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 35 [2025-02-08 05:46:58,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2025-02-08 05:46:58,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:58,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2025-02-08 05:46:58,861 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:58,864 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:58,866 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:46:58,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 57 [2025-02-08 05:46:58,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-02-08 05:46:58,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:58,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2025-02-08 05:46:58,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:46:58,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 69 [2025-02-08 05:46:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 05:46:59,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:46:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044796039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:59,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:46:59,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 05:46:59,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741012179] [2025-02-08 05:46:59,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:59,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:59,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:59,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:59,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:46:59,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 628 [2025-02-08 05:46:59,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 605 transitions, 2774 flow. Second operand has 6 states, 6 states have (on average 496.5) internal successors, (2979), 6 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:59,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:59,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 628 [2025-02-08 05:46:59,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:00,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2095] L6078-4-->L6078-3: Formula: (= |v_#race_167| (store |v_#race_168| |v_runThread1of2ForFork0_~point~0#1.base_7| (store (select |v_#race_168| |v_runThread1of2ForFork0_~point~0#1.base_7|) (+ |v_runThread1of2ForFork0_~point~0#1.offset_7| 1) |v_runThread1of2ForFork0_#t~nondet820#1_5|))) InVars {#race=|v_#race_168|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_5|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_7|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_7|} OutVars{#race=|v_#race_167|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_5|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_7|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_7|} AuxVars[] AssignedVars[#race][203], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 1794#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 3)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869181))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1790#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1782#(or (and (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1786#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), 66#L6077-1true, 108#L6117true, 554#true, 1800#true, 586#true, 1369#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 143#L6078-3true, 552#true, Black: 1340#(= |ULTIMATE.start_main_~i~3#1| 0)]) [2025-02-08 05:47:00,861 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-02-08 05:47:00,861 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-08 05:47:00,861 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-08 05:47:00,861 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-02-08 05:47:01,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2095] L6078-4-->L6078-3: Formula: (= |v_#race_167| (store |v_#race_168| |v_runThread1of2ForFork0_~point~0#1.base_7| (store (select |v_#race_168| |v_runThread1of2ForFork0_~point~0#1.base_7|) (+ |v_runThread1of2ForFork0_~point~0#1.offset_7| 1) |v_runThread1of2ForFork0_#t~nondet820#1_5|))) InVars {#race=|v_#race_168|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_5|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_7|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_7|} OutVars{#race=|v_#race_167|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_5|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_7|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_7|} AuxVars[] AssignedVars[#race][203], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 1794#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 3)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869181))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1790#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1782#(or (and (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1786#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), 66#L6077-1true, 554#true, 1800#true, 586#true, 1369#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 143#L6078-3true, 552#true, Black: 1340#(= |ULTIMATE.start_main_~i~3#1| 0), 207#ULTIMATE.startFINALtrue]) [2025-02-08 05:47:01,066 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-02-08 05:47:01,066 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-02-08 05:47:01,066 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-02-08 05:47:01,066 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-02-08 05:47:01,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1873] L6078-5-->L6078-4: Formula: (= |v_#race_169| (store |v_#race_170| |v_runThread2of2ForFork0_~point~0#1.base_5| (store (select |v_#race_170| |v_runThread2of2ForFork0_~point~0#1.base_5|) |v_runThread2of2ForFork0_~point~0#1.offset_5| |v_runThread2of2ForFork0_#t~nondet820#1_3|))) InVars {#race=|v_#race_170|, runThread2of2ForFork0_#t~nondet820#1=|v_runThread2of2ForFork0_#t~nondet820#1_3|, runThread2of2ForFork0_~point~0#1.offset=|v_runThread2of2ForFork0_~point~0#1.offset_5|, runThread2of2ForFork0_~point~0#1.base=|v_runThread2of2ForFork0_~point~0#1.base_5|} OutVars{#race=|v_#race_169|, runThread2of2ForFork0_#t~nondet820#1=|v_runThread2of2ForFork0_#t~nondet820#1_3|, runThread2of2ForFork0_~point~0#1.offset=|v_runThread2of2ForFork0_~point~0#1.offset_5|, runThread2of2ForFork0_~point~0#1.base=|v_runThread2of2ForFork0_~point~0#1.base_5|} AuxVars[] AssignedVars[#race][370], [378#L6078-4true, Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 1794#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 3)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869181))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1790#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1782#(or (and (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1786#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), 108#L6117true, 554#true, 1800#true, 1369#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, Black: 1340#(= |ULTIMATE.start_main_~i~3#1| 0), 476#L6078-4true]) [2025-02-08 05:47:01,278 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-02-08 05:47:01,278 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-02-08 05:47:01,278 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-02-08 05:47:01,278 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-02-08 05:47:01,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1873] L6078-5-->L6078-4: Formula: (= |v_#race_169| (store |v_#race_170| |v_runThread2of2ForFork0_~point~0#1.base_5| (store (select |v_#race_170| |v_runThread2of2ForFork0_~point~0#1.base_5|) |v_runThread2of2ForFork0_~point~0#1.offset_5| |v_runThread2of2ForFork0_#t~nondet820#1_3|))) InVars {#race=|v_#race_170|, runThread2of2ForFork0_#t~nondet820#1=|v_runThread2of2ForFork0_#t~nondet820#1_3|, runThread2of2ForFork0_~point~0#1.offset=|v_runThread2of2ForFork0_~point~0#1.offset_5|, runThread2of2ForFork0_~point~0#1.base=|v_runThread2of2ForFork0_~point~0#1.base_5|} OutVars{#race=|v_#race_169|, runThread2of2ForFork0_#t~nondet820#1=|v_runThread2of2ForFork0_#t~nondet820#1_3|, runThread2of2ForFork0_~point~0#1.offset=|v_runThread2of2ForFork0_~point~0#1.offset_5|, runThread2of2ForFork0_~point~0#1.base=|v_runThread2of2ForFork0_~point~0#1.base_5|} AuxVars[] AssignedVars[#race][370], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), 378#L6078-4true, Black: 1794#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 3)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869181))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1790#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1782#(or (and (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1786#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), 554#true, 1800#true, 1369#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, Black: 1340#(= |ULTIMATE.start_main_~i~3#1| 0), 207#ULTIMATE.startFINALtrue, 476#L6078-4true]) [2025-02-08 05:47:01,431 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2025-02-08 05:47:01,431 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-02-08 05:47:01,431 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-02-08 05:47:01,431 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-02-08 05:47:02,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2087] L6078-5-->L6078-4: Formula: (= |v_#race_169| (store |v_#race_170| |v_runThread1of2ForFork0_~point~0#1.base_5| (store (select |v_#race_170| |v_runThread1of2ForFork0_~point~0#1.base_5|) |v_runThread1of2ForFork0_~point~0#1.offset_5| |v_runThread1of2ForFork0_#t~nondet820#1_3|))) InVars {#race=|v_#race_170|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_3|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_5|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_5|} OutVars{#race=|v_#race_169|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_3|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_5|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_5|} AuxVars[] AssignedVars[#race][197], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 1794#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 3)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869181))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1790#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1782#(or (and (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1786#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), 554#true, 1800#true, 94#L4421-28true, 1369#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, Black: 1340#(= |ULTIMATE.start_main_~i~3#1| 0), 207#ULTIMATE.startFINALtrue, 476#L6078-4true]) [2025-02-08 05:47:02,535 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-02-08 05:47:02,535 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:47:02,535 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:47:02,535 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:47:02,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2087] L6078-5-->L6078-4: Formula: (= |v_#race_169| (store |v_#race_170| |v_runThread1of2ForFork0_~point~0#1.base_5| (store (select |v_#race_170| |v_runThread1of2ForFork0_~point~0#1.base_5|) |v_runThread1of2ForFork0_~point~0#1.offset_5| |v_runThread1of2ForFork0_#t~nondet820#1_3|))) InVars {#race=|v_#race_170|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_3|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_5|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_5|} OutVars{#race=|v_#race_169|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_3|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_5|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_5|} AuxVars[] AssignedVars[#race][197], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 1794#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 3)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869181))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1790#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1782#(or (and (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1786#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), 108#L6117true, 554#true, 1800#true, 94#L4421-28true, 1369#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, Black: 1340#(= |ULTIMATE.start_main_~i~3#1| 0), 476#L6078-4true]) [2025-02-08 05:47:02,536 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-02-08 05:47:02,536 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:47:02,536 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:47:02,536 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-02-08 05:47:02,701 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2087] L6078-5-->L6078-4: Formula: (= |v_#race_169| (store |v_#race_170| |v_runThread1of2ForFork0_~point~0#1.base_5| (store (select |v_#race_170| |v_runThread1of2ForFork0_~point~0#1.base_5|) |v_runThread1of2ForFork0_~point~0#1.offset_5| |v_runThread1of2ForFork0_#t~nondet820#1_3|))) InVars {#race=|v_#race_170|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_3|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_5|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_5|} OutVars{#race=|v_#race_169|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_3|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_5|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_5|} AuxVars[] AssignedVars[#race][197], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 1794#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 3)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869181))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1790#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1782#(or (and (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1786#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), 554#true, 1800#true, 94#L4421-28true, 1369#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, Black: 1340#(= |ULTIMATE.start_main_~i~3#1| 0), 207#ULTIMATE.startFINALtrue, 476#L6078-4true]) [2025-02-08 05:47:02,701 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-02-08 05:47:02,701 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:47:02,701 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:47:02,701 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:47:02,701 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-02-08 05:47:03,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2087] L6078-5-->L6078-4: Formula: (= |v_#race_169| (store |v_#race_170| |v_runThread1of2ForFork0_~point~0#1.base_5| (store (select |v_#race_170| |v_runThread1of2ForFork0_~point~0#1.base_5|) |v_runThread1of2ForFork0_~point~0#1.offset_5| |v_runThread1of2ForFork0_#t~nondet820#1_3|))) InVars {#race=|v_#race_170|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_3|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_5|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_5|} OutVars{#race=|v_#race_169|, runThread1of2ForFork0_#t~nondet820#1=|v_runThread1of2ForFork0_#t~nondet820#1_3|, runThread1of2ForFork0_~point~0#1.offset=|v_runThread1of2ForFork0_~point~0#1.offset_5|, runThread1of2ForFork0_~point~0#1.base=|v_runThread1of2ForFork0_~point~0#1.base_5|} AuxVars[] AssignedVars[#race][210], [Black: 578#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 1794#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 3)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869181))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1790#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 2)) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) (- 17179869182))) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1782#(or (and (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), Black: 1786#(or (and (<= (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 2147483647) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4) 1)) 0) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0)) (and (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869183) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0) (<= 2147483648 (mod |runThread1of2ForFork0_~i~0#1| 4294967296)) (= (select (select |#race| |~#g_points~0.base|) (+ |~#g_points~0.offset| (- 17179869184) (* (mod |runThread1of2ForFork0_~i~0#1| 4294967296) 4))) 0))), 133#L4421-10true, 554#true, 1800#true, 1369#true, 586#true, Black: 971#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 975#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869182) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869181) |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (= (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 3 |ULTIMATE.start_main_~#t~0#1.offset|)) |ULTIMATE.start_main_#t~nondet837#1|) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) 2 |ULTIMATE.start_main_~#t~0#1.offset|))))), 556#true, Black: 967#(or (and (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset| 1))) (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869183) |ULTIMATE.start_main_~#t~0#1.offset|))) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|))))), Black: 963#(or (and (<= 2147483648 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) (- 17179869184) |ULTIMATE.start_main_~#t~0#1.offset|)))) (and (<= (mod |ULTIMATE.start_main_~i~3#1| 4294967296) 2147483647) (= |ULTIMATE.start_main_#t~nondet837#1| (select (select |#race| |ULTIMATE.start_main_~#t~0#1.base|) (+ (* 4 (mod |ULTIMATE.start_main_~i~3#1| 4294967296)) |ULTIMATE.start_main_~#t~0#1.offset|))))), 552#true, Black: 1340#(= |ULTIMATE.start_main_~i~3#1| 0), 127#L6115-1true, 476#L6078-4true]) [2025-02-08 05:47:03,731 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-02-08 05:47:03,731 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-02-08 05:47:03,731 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-02-08 05:47:03,731 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-02-08 05:47:04,294 INFO L124 PetriNetUnfolderBase]: 11934/38201 cut-off events. [2025-02-08 05:47:04,294 INFO L125 PetriNetUnfolderBase]: For 24102/34911 co-relation queries the response was YES. [2025-02-08 05:47:04,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86851 conditions, 38201 events. 11934/38201 cut-off events. For 24102/34911 co-relation queries the response was YES. Maximal size of possible extension queue 1448. Compared 492464 event pairs, 3413 based on Foata normal form. 233/35232 useless extension candidates. Maximal degree in co-relation 86834. Up to 13933 conditions per place. [2025-02-08 05:47:04,545 INFO L140 encePairwiseOnDemand]: 605/628 looper letters, 267 selfloop transitions, 202 changer transitions 0/824 dead transitions. [2025-02-08 05:47:04,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 824 transitions, 5180 flow [2025-02-08 05:47:04,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3095 transitions. [2025-02-08 05:47:04,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8213906581740976 [2025-02-08 05:47:04,548 INFO L175 Difference]: Start difference. First operand has 392 places, 605 transitions, 2774 flow. Second operand 6 states and 3095 transitions. [2025-02-08 05:47:04,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 824 transitions, 5180 flow [2025-02-08 05:47:04,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 824 transitions, 5162 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:04,658 INFO L231 Difference]: Finished difference. Result has 402 places, 806 transitions, 5068 flow [2025-02-08 05:47:04,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=2756, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5068, PETRI_PLACES=402, PETRI_TRANSITIONS=806} [2025-02-08 05:47:04,659 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -151 predicate places. [2025-02-08 05:47:04,659 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 806 transitions, 5068 flow [2025-02-08 05:47:04,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 496.5) internal successors, (2979), 6 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:04,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:04,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:04,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 05:47:04,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:47:04,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting runErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:47:04,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1052570943, now seen corresponding path program 1 times [2025-02-08 05:47:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133544278] [2025-02-08 05:47:04,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:04,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 05:47:04,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 05:47:04,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:04,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 05:47:04,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:04,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133544278] [2025-02-08 05:47:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133544278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:47:04,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502381029] [2025-02-08 05:47:04,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:04,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:47:04,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:47:04,973 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:47:04,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 05:47:05,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-08 05:47:05,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-08 05:47:05,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:05,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:05,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 05:47:05,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:47:05,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:47:05,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-08 05:47:05,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:05,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-02-08 05:47:05,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:05,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-02-08 05:47:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 05:47:05,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:47:05,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502381029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:05,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:47:05,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 05:47:05,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523187592] [2025-02-08 05:47:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:05,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:47:05,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:05,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:47:05,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:47:05,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 628 [2025-02-08 05:47:05,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 806 transitions, 5068 flow. Second operand has 6 states, 6 states have (on average 460.6666666666667) internal successors, (2764), 6 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:05,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:05,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 628 [2025-02-08 05:47:05,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:11,735 INFO L124 PetriNetUnfolderBase]: 16224/44225 cut-off events. [2025-02-08 05:47:11,736 INFO L125 PetriNetUnfolderBase]: For 47171/64000 co-relation queries the response was YES. [2025-02-08 05:47:12,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123344 conditions, 44225 events. 16224/44225 cut-off events. For 47171/64000 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 530000 event pairs, 3185 based on Foata normal form. 114/41321 useless extension candidates. Maximal degree in co-relation 123322. Up to 21293 conditions per place. [2025-02-08 05:47:12,279 INFO L140 encePairwiseOnDemand]: 599/628 looper letters, 449 selfloop transitions, 277 changer transitions 0/1073 dead transitions. [2025-02-08 05:47:12,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 1073 transitions, 8462 flow [2025-02-08 05:47:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2891 transitions. [2025-02-08 05:47:12,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7672505307855626 [2025-02-08 05:47:12,282 INFO L175 Difference]: Start difference. First operand has 402 places, 806 transitions, 5068 flow. Second operand 6 states and 2891 transitions. [2025-02-08 05:47:12,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 1073 transitions, 8462 flow [2025-02-08 05:47:12,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 1073 transitions, 8462 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:12,559 INFO L231 Difference]: Finished difference. Result has 412 places, 1065 transitions, 8326 flow [2025-02-08 05:47:12,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=5068, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8326, PETRI_PLACES=412, PETRI_TRANSITIONS=1065} [2025-02-08 05:47:12,560 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -141 predicate places. [2025-02-08 05:47:12,560 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 1065 transitions, 8326 flow [2025-02-08 05:47:12,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 460.6666666666667) internal successors, (2764), 6 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:12,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:12,561 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:12,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 05:47:12,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 05:47:12,762 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:47:12,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 802153291, now seen corresponding path program 1 times [2025-02-08 05:47:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743244447] [2025-02-08 05:47:12,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:12,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:47:12,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:47:12,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:12,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 05:47:12,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:12,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743244447] [2025-02-08 05:47:12,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743244447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:47:12,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748427360] [2025-02-08 05:47:12,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:12,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:47:12,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:47:12,877 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:47:12,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 05:47:13,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:47:13,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:47:13,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:13,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:13,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 05:47:13,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:47:13,228 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:47:13,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:47:13,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:47:13,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 05:47:13,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-02-08 05:47:13,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 05:47:13,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-02-08 05:47:13,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-02-08 05:47:13,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:13,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2025-02-08 05:47:13,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 21 [2025-02-08 05:47:13,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2025-02-08 05:47:13,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:13,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2025-02-08 05:47:13,526 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:47:13,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 54 [2025-02-08 05:47:13,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-02-08 05:47:13,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:13,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2025-02-08 05:47:13,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 55 [2025-02-08 05:47:13,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 114 [2025-02-08 05:47:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 05:47:13,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:47:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748427360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:13,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:47:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2025-02-08 05:47:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221927505] [2025-02-08 05:47:13,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:13,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:47:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:13,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:47:13,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:47:14,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 628 [2025-02-08 05:47:14,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 1065 transitions, 8326 flow. Second operand has 10 states, 10 states have (on average 442.8) internal successors, (4428), 10 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:14,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:14,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 628 [2025-02-08 05:47:14,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:24,723 INFO L124 PetriNetUnfolderBase]: 20685/55941 cut-off events. [2025-02-08 05:47:24,723 INFO L125 PetriNetUnfolderBase]: For 99479/171241 co-relation queries the response was YES. [2025-02-08 05:47:25,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179048 conditions, 55941 events. 20685/55941 cut-off events. For 99479/171241 co-relation queries the response was YES. Maximal size of possible extension queue 1801. Compared 694303 event pairs, 4636 based on Foata normal form. 2373/54664 useless extension candidates. Maximal degree in co-relation 179021. Up to 23432 conditions per place. [2025-02-08 05:47:25,332 INFO L140 encePairwiseOnDemand]: 597/628 looper letters, 708 selfloop transitions, 472 changer transitions 0/1481 dead transitions. [2025-02-08 05:47:25,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1481 transitions, 14425 flow [2025-02-08 05:47:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:47:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:47:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4170 transitions. [2025-02-08 05:47:25,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7377919320594479 [2025-02-08 05:47:25,335 INFO L175 Difference]: Start difference. First operand has 412 places, 1065 transitions, 8326 flow. Second operand 9 states and 4170 transitions. [2025-02-08 05:47:25,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1481 transitions, 14425 flow [2025-02-08 05:47:25,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 1481 transitions, 13985 flow, removed 220 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:25,878 INFO L231 Difference]: Finished difference. Result has 425 places, 1355 transitions, 12760 flow [2025-02-08 05:47:25,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=7964, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1065, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=290, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=755, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12760, PETRI_PLACES=425, PETRI_TRANSITIONS=1355} [2025-02-08 05:47:25,880 INFO L279 CegarLoopForPetriNet]: 553 programPoint places, -128 predicate places. [2025-02-08 05:47:25,880 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 1355 transitions, 12760 flow [2025-02-08 05:47:25,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 442.8) internal successors, (4428), 10 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:25,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:25,881 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:25,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 05:47:26,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 05:47:26,081 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting runErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:47:26,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1307730806, now seen corresponding path program 1 times [2025-02-08 05:47:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367803171] [2025-02-08 05:47:26,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:26,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:47:26,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:47:26,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:26,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 05:47:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367803171] [2025-02-08 05:47:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367803171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:47:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300042213] [2025-02-08 05:47:26,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:26,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:47:26,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:47:26,209 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:47:26,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 05:47:26,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:47:26,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:47:26,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:26,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:26,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 05:47:26,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:47:26,564 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:47:26,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:47:26,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:47:26,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 05:47:26,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-02-08 05:47:26,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-02-08 05:47:26,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 05:47:26,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-02-08 05:47:26,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:26,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 154 [2025-02-08 05:47:26,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:26,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 34 [2025-02-08 05:47:26,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2025-02-08 05:47:26,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:26,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 208 [2025-02-08 05:47:26,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:26,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 52 [2025-02-08 05:47:26,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-02-08 05:47:26,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:26,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 128 treesize of output 262 [2025-02-08 05:47:26,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:47:26,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 69 [2025-02-08 05:47:27,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 114 [2025-02-08 05:47:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 05:47:27,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:47:27,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300042213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:27,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:47:27,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 13 [2025-02-08 05:47:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153087180] [2025-02-08 05:47:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:27,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:47:27,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:27,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:47:27,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:47:28,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 628 [2025-02-08 05:47:28,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 1355 transitions, 12760 flow. Second operand has 10 states, 10 states have (on average 488.0) internal successors, (4880), 10 states have internal predecessors, (4880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:47:28,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:28,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 628 [2025-02-08 05:47:28,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand