./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/bounded_spsc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-e2fb8be-m [2025-03-08 22:13:14,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:13:14,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:13:14,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:13:14,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:13:14,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:13:14,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:13:14,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:13:14,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:13:14,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:13:14,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:13:14,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:13:14,994 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:13:14,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:13:14,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:13:14,994 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:13:14,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:13:14,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:13:14,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:13:14,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:13:14,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:13:14,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:13:14,995 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:13:14,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:13:14,995 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:13:14,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:13:14,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:13:14,995 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:13:14,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:13:14,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:13:14,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:13:14,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:13:14,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:13:14,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:13:14,996 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:13:14,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:13:14,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:13:14,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:13:14,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:13:14,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:13:14,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:13:14,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:13:14,997 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-03-08 22:13:15,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:13:15,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:13:15,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:13:15,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:13:15,204 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:13:15,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_spsc.i [2025-03-08 22:13:16,293 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0c1cbfe/9316679df01d430f90d4a42660890b74/FLAG7de78eae3 [2025-03-08 22:13:16,757 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:13:16,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_spsc.i [2025-03-08 22:13:16,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0c1cbfe/9316679df01d430f90d4a42660890b74/FLAG7de78eae3 [2025-03-08 22:13:16,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0c1cbfe/9316679df01d430f90d4a42660890b74 [2025-03-08 22:13:16,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:13:16,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:13:16,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:13:16,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:13:16,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:13:16,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:16" (1/1) ... [2025-03-08 22:13:16,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6401f1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:16, skipping insertion in model container [2025-03-08 22:13:16,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:16" (1/1) ... [2025-03-08 22:13:16,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:13:18,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:13:18,566 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:13:18,637 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4397] [2025-03-08 22:13:18,639 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4399] [2025-03-08 22:13:18,639 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4404] [2025-03-08 22:13:18,642 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4406] [2025-03-08 22:13:18,643 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4412] [2025-03-08 22:13:18,643 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-03-08 22:13:18,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4420] [2025-03-08 22:13:18,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4422] [2025-03-08 22:13:18,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4428] [2025-03-08 22:13:18,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4430] [2025-03-08 22:13:18,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4436] [2025-03-08 22:13:18,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4438] [2025-03-08 22:13:18,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-03-08 22:13:18,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4446] [2025-03-08 22:13:18,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4452] [2025-03-08 22:13:18,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4454] [2025-03-08 22:13:18,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4459] [2025-03-08 22:13:18,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4461] [2025-03-08 22:13:18,647 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4466] [2025-03-08 22:13:18,647 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4468] [2025-03-08 22:13:18,647 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-03-08 22:13:18,647 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4475] [2025-03-08 22:13:18,648 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-03-08 22:13:18,649 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4482] [2025-03-08 22:13:18,649 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4487] [2025-03-08 22:13:18,649 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4489] [2025-03-08 22:13:18,649 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4494] [2025-03-08 22:13:18,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4497] [2025-03-08 22:13:18,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-03-08 22:13:18,652 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4506] [2025-03-08 22:13:18,652 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4512] [2025-03-08 22:13:18,653 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4515] [2025-03-08 22:13:18,653 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4521] [2025-03-08 22:13:18,654 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4524] [2025-03-08 22:13:18,654 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4530] [2025-03-08 22:13:18,655 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4533] [2025-03-08 22:13:18,655 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4539] [2025-03-08 22:13:18,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4542] [2025-03-08 22:13:18,657 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-03-08 22:13:18,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4552] [2025-03-08 22:13:18,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4559] [2025-03-08 22:13:18,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4562] [2025-03-08 22:13:18,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4569] [2025-03-08 22:13:18,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4572] [2025-03-08 22:13:18,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4579] [2025-03-08 22:13:18,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-03-08 22:13:18,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4589] [2025-03-08 22:13:18,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4592] [2025-03-08 22:13:18,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4599] [2025-03-08 22:13:18,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4602] [2025-03-08 22:13:18,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4608] [2025-03-08 22:13:18,663 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4611] [2025-03-08 22:13:18,663 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4617] [2025-03-08 22:13:18,664 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4620] [2025-03-08 22:13:18,664 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4626] [2025-03-08 22:13:18,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4629] [2025-03-08 22:13:18,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4635] [2025-03-08 22:13:18,666 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4638] [2025-03-08 22:13:18,666 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4644] [2025-03-08 22:13:18,667 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4647] [2025-03-08 22:13:18,668 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4653] [2025-03-08 22:13:18,668 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-03-08 22:13:18,669 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-03-08 22:13:18,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4665] [2025-03-08 22:13:18,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4671] [2025-03-08 22:13:18,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4674] [2025-03-08 22:13:18,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-03-08 22:13:18,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4683] [2025-03-08 22:13:18,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4689] [2025-03-08 22:13:18,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4692] [2025-03-08 22:13:18,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4698] [2025-03-08 22:13:18,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4701] [2025-03-08 22:13:18,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4707] [2025-03-08 22:13:18,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-03-08 22:13:18,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4716] [2025-03-08 22:13:18,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4719] [2025-03-08 22:13:18,675 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4725] [2025-03-08 22:13:18,675 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-03-08 22:13:18,675 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4734] [2025-03-08 22:13:18,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4737] [2025-03-08 22:13:18,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4743] [2025-03-08 22:13:18,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4745] [2025-03-08 22:13:18,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4751] [2025-03-08 22:13:18,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4753] [2025-03-08 22:13:18,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4759] [2025-03-08 22:13:18,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4761] [2025-03-08 22:13:18,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4767] [2025-03-08 22:13:18,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4769] [2025-03-08 22:13:18,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4775] [2025-03-08 22:13:18,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4777] [2025-03-08 22:13:18,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4783] [2025-03-08 22:13:18,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4785] [2025-03-08 22:13:18,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4791] [2025-03-08 22:13:18,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4793] [2025-03-08 22:13:18,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4799] [2025-03-08 22:13:18,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4801] [2025-03-08 22:13:18,680 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4807] [2025-03-08 22:13:18,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4809] [2025-03-08 22:13:18,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4815] [2025-03-08 22:13:18,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4817] [2025-03-08 22:13:18,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:13:18,909 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:13:18,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18 WrapperNode [2025-03-08 22:13:18,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:13:18,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:13:18,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:13:18,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:13:18,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:18,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,014 INFO L138 Inliner]: procedures = 948, calls = 963, calls flagged for inlining = 823, calls inlined = 39, statements flattened = 571 [2025-03-08 22:13:19,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:13:19,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:13:19,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:13:19,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:13:19,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,054 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:13:19,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:13:19,072 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:13:19,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:13:19,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (1/1) ... [2025-03-08 22:13:19,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:13:19,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:19,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:13:19,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:13:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:13:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:13:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:13:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 22:13:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:13:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:13:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-08 22:13:19,134 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-08 22:13:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:13:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 22:13:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:13:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:13:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 22:13:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:13:19,135 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:13:19,262 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:13:19,263 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:13:19,607 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6110: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-08 22:13:19,608 INFO L1307 $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-03-08 22:13:20,029 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-08 22:13:20,030 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-9: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-08 22:13:20,030 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-18: havoc vatomic32_read_rlx_#t~ret116#1; [2025-03-08 22:13:20,030 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532: havoc vatomic32_read_acq_#t~ret117#1; [2025-03-08 22:13:20,031 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:13:20,031 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:13:20,096 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:13:20,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:13:20,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:20 BoogieIcfgContainer [2025-03-08 22:13:20,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:13:20,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:13:20,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:13:20,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:13:20,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:13:16" (1/3) ... [2025-03-08 22:13:20,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a15553c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:20, skipping insertion in model container [2025-03-08 22:13:20,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:18" (2/3) ... [2025-03-08 22:13:20,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a15553c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:20, skipping insertion in model container [2025-03-08 22:13:20,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:20" (3/3) ... [2025-03-08 22:13:20,104 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_spsc.i [2025-03-08 22:13:20,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:13:20,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_spsc.i that has 2 procedures, 584 locations, 1 initial locations, 21 loop locations, and 29 error locations. [2025-03-08 22:13:20,118 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:13:20,286 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:13:20,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 587 places, 663 transitions, 1333 flow [2025-03-08 22:13:20,514 INFO L124 PetriNetUnfolderBase]: 79/693 cut-off events. [2025-03-08 22:13:20,515 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:13:20,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 693 events. 79/693 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1757 event pairs, 0 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 504. Up to 4 conditions per place. [2025-03-08 22:13:20,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 587 places, 663 transitions, 1333 flow [2025-03-08 22:13:20,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 587 places, 663 transitions, 1333 flow [2025-03-08 22:13:20,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:13:20,553 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;@38fdf53b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:13:20,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-03-08 22:13:20,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:13:20,562 INFO L124 PetriNetUnfolderBase]: 8/66 cut-off events. [2025-03-08 22:13:20,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:13:20,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:20,562 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-03-08 22:13:20,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:20,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash 371196569, now seen corresponding path program 1 times [2025-03-08 22:13:20,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:20,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017888237] [2025-03-08 22:13:20,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:20,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:20,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 22:13:20,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 22:13:20,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:20,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:20,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:20,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017888237] [2025-03-08 22:13:20,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017888237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:20,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:20,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:13:20,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024758532] [2025-03-08 22:13:20,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:20,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:13:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:20,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:13:20,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:13:20,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 577 out of 663 [2025-03-08 22:13:20,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 663 transitions, 1333 flow. Second operand has 2 states, 2 states have (on average 578.0) internal successors, (1156), 2 states have internal predecessors, (1156), 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-03-08 22:13:20,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:20,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 577 of 663 [2025-03-08 22:13:20,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:20,913 INFO L124 PetriNetUnfolderBase]: 11/595 cut-off events. [2025-03-08 22:13:20,913 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:13:20,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 595 events. 11/595 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1435 event pairs, 0 based on Foata normal form. 52/600 useless extension candidates. Maximal degree in co-relation 434. Up to 11 conditions per place. [2025-03-08 22:13:20,918 INFO L140 encePairwiseOnDemand]: 589/663 looper letters, 10 selfloop transitions, 0 changer transitions 10/565 dead transitions. [2025-03-08 22:13:20,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 565 transitions, 1157 flow [2025-03-08 22:13:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:13:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 22:13:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1238 transitions. [2025-03-08 22:13:20,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9336349924585219 [2025-03-08 22:13:20,939 INFO L175 Difference]: Start difference. First operand has 587 places, 663 transitions, 1333 flow. Second operand 2 states and 1238 transitions. [2025-03-08 22:13:20,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 565 transitions, 1157 flow [2025-03-08 22:13:20,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 565 transitions, 1157 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:13:20,961 INFO L231 Difference]: Finished difference. Result has 558 places, 555 transitions, 1117 flow [2025-03-08 22:13:20,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1117, PETRI_PLACES=558, PETRI_TRANSITIONS=555} [2025-03-08 22:13:20,969 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -29 predicate places. [2025-03-08 22:13:20,969 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 555 transitions, 1117 flow [2025-03-08 22:13:20,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 578.0) internal successors, (1156), 2 states have internal predecessors, (1156), 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-03-08 22:13:20,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:20,971 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] [2025-03-08 22:13:20,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:13:20,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:20,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1961293541, now seen corresponding path program 1 times [2025-03-08 22:13:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560828174] [2025-03-08 22:13:20,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:20,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:13:21,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:13:21,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:21,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560828174] [2025-03-08 22:13:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560828174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:21,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:21,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:13:21,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253149095] [2025-03-08 22:13:21,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:21,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:21,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:21,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:13:22,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 663 [2025-03-08 22:13:22,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 555 transitions, 1117 flow. Second operand has 6 states, 6 states have (on average 491.3333333333333) internal successors, (2948), 6 states have internal predecessors, (2948), 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-03-08 22:13:22,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:22,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 663 [2025-03-08 22:13:22,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:22,611 INFO L124 PetriNetUnfolderBase]: 612/3834 cut-off events. [2025-03-08 22:13:22,612 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:13:22,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5027 conditions, 3834 events. 612/3834 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 30691 event pairs, 528 based on Foata normal form. 0/3509 useless extension candidates. Maximal degree in co-relation 5023. Up to 1181 conditions per place. [2025-03-08 22:13:22,635 INFO L140 encePairwiseOnDemand]: 657/663 looper letters, 91 selfloop transitions, 5 changer transitions 0/554 dead transitions. [2025-03-08 22:13:22,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 554 transitions, 1307 flow [2025-03-08 22:13:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3037 transitions. [2025-03-08 22:13:22,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7634489693313222 [2025-03-08 22:13:22,646 INFO L175 Difference]: Start difference. First operand has 558 places, 555 transitions, 1117 flow. Second operand 6 states and 3037 transitions. [2025-03-08 22:13:22,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 554 transitions, 1307 flow [2025-03-08 22:13:22,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 554 transitions, 1307 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:13:22,654 INFO L231 Difference]: Finished difference. Result has 552 places, 554 transitions, 1125 flow [2025-03-08 22:13:22,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1125, PETRI_PLACES=552, PETRI_TRANSITIONS=554} [2025-03-08 22:13:22,656 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -35 predicate places. [2025-03-08 22:13:22,656 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 554 transitions, 1125 flow [2025-03-08 22:13:22,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 491.3333333333333) internal successors, (2948), 6 states have internal predecessors, (2948), 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-03-08 22:13:22,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:22,658 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] [2025-03-08 22:13:22,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:13:22,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:22,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash 332911309, now seen corresponding path program 1 times [2025-03-08 22:13:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:22,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646923867] [2025-03-08 22:13:22,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:22,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:13:22,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:13:22,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:22,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:22,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646923867] [2025-03-08 22:13:22,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646923867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:22,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:13:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233700904] [2025-03-08 22:13:22,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:22,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:22,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:22,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:13:23,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 490 out of 663 [2025-03-08 22:13:23,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 554 transitions, 1125 flow. Second operand has 6 states, 6 states have (on average 491.3333333333333) internal successors, (2948), 6 states have internal predecessors, (2948), 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-03-08 22:13:23,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:23,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 490 of 663 [2025-03-08 22:13:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:23,980 INFO L124 PetriNetUnfolderBase]: 612/3833 cut-off events. [2025-03-08 22:13:23,981 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:13:23,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5032 conditions, 3833 events. 612/3833 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 30736 event pairs, 528 based on Foata normal form. 0/3509 useless extension candidates. Maximal degree in co-relation 5027. Up to 1181 conditions per place. [2025-03-08 22:13:23,994 INFO L140 encePairwiseOnDemand]: 657/663 looper letters, 91 selfloop transitions, 5 changer transitions 0/553 dead transitions. [2025-03-08 22:13:23,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 553 transitions, 1315 flow [2025-03-08 22:13:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3037 transitions. [2025-03-08 22:13:24,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7634489693313222 [2025-03-08 22:13:24,001 INFO L175 Difference]: Start difference. First operand has 552 places, 554 transitions, 1125 flow. Second operand 6 states and 3037 transitions. [2025-03-08 22:13:24,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 553 transitions, 1315 flow [2025-03-08 22:13:24,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 553 transitions, 1305 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:13:24,009 INFO L231 Difference]: Finished difference. Result has 551 places, 553 transitions, 1123 flow [2025-03-08 22:13:24,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1123, PETRI_PLACES=551, PETRI_TRANSITIONS=553} [2025-03-08 22:13:24,011 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -36 predicate places. [2025-03-08 22:13:24,011 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 553 transitions, 1123 flow [2025-03-08 22:13:24,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 491.3333333333333) internal successors, (2948), 6 states have internal predecessors, (2948), 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-03-08 22:13:24,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:24,012 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] [2025-03-08 22:13:24,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:13:24,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:24,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:24,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1521335713, now seen corresponding path program 1 times [2025-03-08 22:13:24,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:24,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005997038] [2025-03-08 22:13:24,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:24,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:24,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 22:13:24,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 22:13:24,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:24,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:24,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005997038] [2025-03-08 22:13:24,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005997038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:24,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:24,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:13:24,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667571474] [2025-03-08 22:13:24,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:24,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:24,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:24,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:24,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:13:25,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 663 [2025-03-08 22:13:25,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 553 transitions, 1123 flow. Second operand has 6 states, 6 states have (on average 485.1666666666667) internal successors, (2911), 6 states have internal predecessors, (2911), 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-03-08 22:13:25,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:25,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 663 [2025-03-08 22:13:25,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:25,944 INFO L124 PetriNetUnfolderBase]: 687/4240 cut-off events. [2025-03-08 22:13:25,944 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 22:13:25,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5583 conditions, 4240 events. 687/4240 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 35957 event pairs, 594 based on Foata normal form. 0/3881 useless extension candidates. Maximal degree in co-relation 5578. Up to 1325 conditions per place. [2025-03-08 22:13:25,957 INFO L140 encePairwiseOnDemand]: 657/663 looper letters, 99 selfloop transitions, 5 changer transitions 0/552 dead transitions. [2025-03-08 22:13:25,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 552 transitions, 1329 flow [2025-03-08 22:13:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2997 transitions. [2025-03-08 22:13:25,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.753393665158371 [2025-03-08 22:13:25,962 INFO L175 Difference]: Start difference. First operand has 551 places, 553 transitions, 1123 flow. Second operand 6 states and 2997 transitions. [2025-03-08 22:13:25,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 552 transitions, 1329 flow [2025-03-08 22:13:25,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 552 transitions, 1319 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:13:25,968 INFO L231 Difference]: Finished difference. Result has 550 places, 552 transitions, 1121 flow [2025-03-08 22:13:25,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1121, PETRI_PLACES=550, PETRI_TRANSITIONS=552} [2025-03-08 22:13:25,969 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -37 predicate places. [2025-03-08 22:13:25,969 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 552 transitions, 1121 flow [2025-03-08 22:13:25,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 485.1666666666667) internal successors, (2911), 6 states have internal predecessors, (2911), 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-03-08 22:13:25,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:25,971 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] [2025-03-08 22:13:25,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:13:25,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:25,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash -981602243, now seen corresponding path program 1 times [2025-03-08 22:13:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:25,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130605870] [2025-03-08 22:13:25,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:25,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:25,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 22:13:25,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 22:13:25,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:25,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:26,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130605870] [2025-03-08 22:13:26,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130605870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:26,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:26,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:13:26,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241452486] [2025-03-08 22:13:26,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:26,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:13:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:26,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:13:26,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:13:26,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 571 out of 663 [2025-03-08 22:13:26,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 552 transitions, 1121 flow. Second operand has 3 states, 3 states have (on average 573.0) internal successors, (1719), 3 states have internal predecessors, (1719), 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-03-08 22:13:26,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:26,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 571 of 663 [2025-03-08 22:13:26,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:26,181 INFO L124 PetriNetUnfolderBase]: 17/622 cut-off events. [2025-03-08 22:13:26,181 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:13:26,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 622 events. 17/622 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1668 event pairs, 6 based on Foata normal form. 1/576 useless extension candidates. Maximal degree in co-relation 665. Up to 30 conditions per place. [2025-03-08 22:13:26,184 INFO L140 encePairwiseOnDemand]: 660/663 looper letters, 15 selfloop transitions, 2 changer transitions 0/553 dead transitions. [2025-03-08 22:13:26,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 553 transitions, 1157 flow [2025-03-08 22:13:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:13:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:13:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1731 transitions. [2025-03-08 22:13:26,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702865761689291 [2025-03-08 22:13:26,187 INFO L175 Difference]: Start difference. First operand has 550 places, 552 transitions, 1121 flow. Second operand 3 states and 1731 transitions. [2025-03-08 22:13:26,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 553 transitions, 1157 flow [2025-03-08 22:13:26,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 553 transitions, 1147 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:13:26,197 INFO L231 Difference]: Finished difference. Result has 548 places, 553 transitions, 1123 flow [2025-03-08 22:13:26,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=548, PETRI_TRANSITIONS=553} [2025-03-08 22:13:26,199 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -39 predicate places. [2025-03-08 22:13:26,199 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 553 transitions, 1123 flow [2025-03-08 22:13:26,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 573.0) internal successors, (1719), 3 states have internal predecessors, (1719), 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-03-08 22:13:26,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:26,202 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] [2025-03-08 22:13:26,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:13:26,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:26,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1918946676, now seen corresponding path program 1 times [2025-03-08 22:13:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:26,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668167178] [2025-03-08 22:13:26,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:26,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:13:26,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:13:26,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:26,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:13:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668167178] [2025-03-08 22:13:26,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668167178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:26,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:26,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:13:26,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080122030] [2025-03-08 22:13:26,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:26,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:26,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:26,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:26,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:13:28,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 663 [2025-03-08 22:13:28,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 553 transitions, 1123 flow. Second operand has 6 states, 6 states have (on average 535.8333333333334) internal successors, (3215), 6 states have internal predecessors, (3215), 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-03-08 22:13:28,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:28,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 663 [2025-03-08 22:13:28,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:28,343 INFO L124 PetriNetUnfolderBase]: 161/2301 cut-off events. [2025-03-08 22:13:28,343 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-08 22:13:28,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 2301 events. 161/2301 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 14766 event pairs, 110 based on Foata normal form. 0/2103 useless extension candidates. Maximal degree in co-relation 2609. Up to 291 conditions per place. [2025-03-08 22:13:28,355 INFO L140 encePairwiseOnDemand]: 657/663 looper letters, 49 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2025-03-08 22:13:28,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 552 transitions, 1231 flow [2025-03-08 22:13:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3247 transitions. [2025-03-08 22:13:28,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8162393162393162 [2025-03-08 22:13:28,360 INFO L175 Difference]: Start difference. First operand has 548 places, 553 transitions, 1123 flow. Second operand 6 states and 3247 transitions. [2025-03-08 22:13:28,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 552 transitions, 1231 flow [2025-03-08 22:13:28,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 552 transitions, 1229 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:13:28,367 INFO L231 Difference]: Finished difference. Result has 551 places, 552 transitions, 1131 flow [2025-03-08 22:13:28,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1131, PETRI_PLACES=551, PETRI_TRANSITIONS=552} [2025-03-08 22:13:28,369 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -36 predicate places. [2025-03-08 22:13:28,369 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 552 transitions, 1131 flow [2025-03-08 22:13:28,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 535.8333333333334) internal successors, (3215), 6 states have internal predecessors, (3215), 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-03-08 22:13:28,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:28,371 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] [2025-03-08 22:13:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:13:28,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:28,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash 277477482, now seen corresponding path program 1 times [2025-03-08 22:13:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:28,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524035686] [2025-03-08 22:13:28,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:28,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:28,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:13:28,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:13:28,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:28,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:13:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524035686] [2025-03-08 22:13:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524035686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:13:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26903492] [2025-03-08 22:13:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:29,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:29,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:13:29,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 663 [2025-03-08 22:13:29,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 552 transitions, 1131 flow. Second operand has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 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-03-08 22:13:29,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:29,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 663 [2025-03-08 22:13:29,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:30,901 INFO L124 PetriNetUnfolderBase]: 1487/7904 cut-off events. [2025-03-08 22:13:30,901 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:13:30,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10820 conditions, 7904 events. 1487/7904 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 73559 event pairs, 594 based on Foata normal form. 0/7226 useless extension candidates. Maximal degree in co-relation 10814. Up to 2486 conditions per place. [2025-03-08 22:13:30,926 INFO L140 encePairwiseOnDemand]: 590/663 looper letters, 104 selfloop transitions, 270 changer transitions 0/821 dead transitions. [2025-03-08 22:13:30,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 821 transitions, 2417 flow [2025-03-08 22:13:30,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3267 transitions. [2025-03-08 22:13:30,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8212669683257918 [2025-03-08 22:13:30,933 INFO L175 Difference]: Start difference. First operand has 551 places, 552 transitions, 1131 flow. Second operand 6 states and 3267 transitions. [2025-03-08 22:13:30,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 821 transitions, 2417 flow [2025-03-08 22:13:30,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 821 transitions, 2405 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:13:30,945 INFO L231 Difference]: Finished difference. Result has 556 places, 821 transitions, 2881 flow [2025-03-08 22:13:30,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2881, PETRI_PLACES=556, PETRI_TRANSITIONS=821} [2025-03-08 22:13:30,947 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -31 predicate places. [2025-03-08 22:13:30,947 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 821 transitions, 2881 flow [2025-03-08 22:13:30,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 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-03-08 22:13:30,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:30,948 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] [2025-03-08 22:13:30,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:13:30,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:30,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1123741608, now seen corresponding path program 1 times [2025-03-08 22:13:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:30,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37845210] [2025-03-08 22:13:30,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:30,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:30,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:13:30,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:13:30,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:30,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:13:31,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:31,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37845210] [2025-03-08 22:13:31,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37845210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:31,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:31,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:13:31,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091115464] [2025-03-08 22:13:31,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:31,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:31,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:31,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:31,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:13:32,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 532 out of 663 [2025-03-08 22:13:32,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 821 transitions, 2881 flow. Second operand has 6 states, 6 states have (on average 535.6666666666666) internal successors, (3214), 6 states have internal predecessors, (3214), 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-03-08 22:13:32,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:32,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 532 of 663 [2025-03-08 22:13:32,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:33,445 INFO L124 PetriNetUnfolderBase]: 980/7928 cut-off events. [2025-03-08 22:13:33,445 INFO L125 PetriNetUnfolderBase]: For 1012/1526 co-relation queries the response was YES. [2025-03-08 22:13:33,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12094 conditions, 7928 events. 980/7928 cut-off events. For 1012/1526 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 73994 event pairs, 96 based on Foata normal form. 59/7401 useless extension candidates. Maximal degree in co-relation 12084. Up to 1545 conditions per place. [2025-03-08 22:13:33,476 INFO L140 encePairwiseOnDemand]: 638/663 looper letters, 159 selfloop transitions, 77 changer transitions 7/915 dead transitions. [2025-03-08 22:13:33,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 915 transitions, 3728 flow [2025-03-08 22:13:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3342 transitions. [2025-03-08 22:13:33,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8401206636500754 [2025-03-08 22:13:33,483 INFO L175 Difference]: Start difference. First operand has 556 places, 821 transitions, 2881 flow. Second operand 6 states and 3342 transitions. [2025-03-08 22:13:33,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 915 transitions, 3728 flow [2025-03-08 22:13:33,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 915 transitions, 3728 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:13:33,502 INFO L231 Difference]: Finished difference. Result has 566 places, 892 transitions, 3518 flow [2025-03-08 22:13:33,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=2881, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=798, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3518, PETRI_PLACES=566, PETRI_TRANSITIONS=892} [2025-03-08 22:13:33,503 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -21 predicate places. [2025-03-08 22:13:33,503 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 892 transitions, 3518 flow [2025-03-08 22:13:33,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 535.6666666666666) internal successors, (3214), 6 states have internal predecessors, (3214), 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-03-08 22:13:33,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:33,505 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] [2025-03-08 22:13:33,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:13:33,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting runErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:33,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:33,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1100166974, now seen corresponding path program 1 times [2025-03-08 22:13:33,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:33,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472066185] [2025-03-08 22:13:33,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:33,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:33,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 22:13:33,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 22:13:33,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:33,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:13:33,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:33,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472066185] [2025-03-08 22:13:33,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472066185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:33,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151731138] [2025-03-08 22:13:33,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:33,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:33,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:33,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:13:33,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:13:33,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 22:13:33,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 22:13:33,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:33,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:33,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:13:33,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:13:33,918 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-03-08 22:13:33,922 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-03-08 22:13:33,938 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-03-08 22:13:33,974 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-03-08 22:13:33,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:33,984 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-03-08 22:13:34,024 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:13:34,025 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:13:34,026 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 77 treesize of output 30 [2025-03-08 22:13:34,112 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-03-08 22:13:34,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:34,121 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-03-08 22:13:34,148 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:13:34,150 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:13:34,155 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:13:34,156 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 127 treesize of output 51 [2025-03-08 22:13:34,261 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-03-08 22:13:34,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:34,272 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-03-08 22:13:34,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:34,374 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 84 treesize of output 68 [2025-03-08 22:13:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 22:13:34,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:13:34,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151731138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:34,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:13:34,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-08 22:13:34,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570988176] [2025-03-08 22:13:34,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:34,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:34,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:34,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:13:35,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 535 out of 663 [2025-03-08 22:13:35,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 892 transitions, 3518 flow. Second operand has 6 states, 6 states have (on average 539.3333333333334) internal successors, (3236), 6 states have internal predecessors, (3236), 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-03-08 22:13:35,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:35,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 535 of 663 [2025-03-08 22:13:35,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:36,166 INFO L124 PetriNetUnfolderBase]: 831/6244 cut-off events. [2025-03-08 22:13:36,166 INFO L125 PetriNetUnfolderBase]: For 1616/1911 co-relation queries the response was YES. [2025-03-08 22:13:36,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10626 conditions, 6244 events. 831/6244 cut-off events. For 1616/1911 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 54256 event pairs, 15 based on Foata normal form. 1/5855 useless extension candidates. Maximal degree in co-relation 10611. Up to 1252 conditions per place. [2025-03-08 22:13:36,189 INFO L140 encePairwiseOnDemand]: 652/663 looper letters, 221 selfloop transitions, 40 changer transitions 0/923 dead transitions. [2025-03-08 22:13:36,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 923 transitions, 4192 flow [2025-03-08 22:13:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3283 transitions. [2025-03-08 22:13:36,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8252890899949723 [2025-03-08 22:13:36,194 INFO L175 Difference]: Start difference. First operand has 566 places, 892 transitions, 3518 flow. Second operand 6 states and 3283 transitions. [2025-03-08 22:13:36,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 923 transitions, 4192 flow [2025-03-08 22:13:36,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 923 transitions, 4192 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:13:36,213 INFO L231 Difference]: Finished difference. Result has 572 places, 923 transitions, 3870 flow [2025-03-08 22:13:36,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=3518, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=864, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3870, PETRI_PLACES=572, PETRI_TRANSITIONS=923} [2025-03-08 22:13:36,214 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -15 predicate places. [2025-03-08 22:13:36,214 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 923 transitions, 3870 flow [2025-03-08 22:13:36,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 539.3333333333334) internal successors, (3236), 6 states have internal predecessors, (3236), 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-03-08 22:13:36,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:36,216 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] [2025-03-08 22:13:36,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:13:36,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:36,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:36,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:36,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2116487156, now seen corresponding path program 1 times [2025-03-08 22:13:36,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:36,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651060006] [2025-03-08 22:13:36,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:36,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:36,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 22:13:36,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 22:13:36,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:36,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:13:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651060006] [2025-03-08 22:13:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651060006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724635165] [2025-03-08 22:13:36,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:36,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:36,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:36,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:13:36,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:13:36,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 22:13:36,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 22:13:36,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:36,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:36,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:13:36,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:13:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:13:36,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:13:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:13:36,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724635165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:13:36,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:13:36,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 22:13:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810767508] [2025-03-08 22:13:36,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:13:36,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:13:36,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:36,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:13:36,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:13:37,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 663 [2025-03-08 22:13:37,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 923 transitions, 3870 flow. Second operand has 9 states, 9 states have (on average 570.2222222222222) internal successors, (5132), 9 states have internal predecessors, (5132), 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-03-08 22:13:37,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:37,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 663 [2025-03-08 22:13:37,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:37,719 INFO L124 PetriNetUnfolderBase]: 794/6209 cut-off events. [2025-03-08 22:13:37,719 INFO L125 PetriNetUnfolderBase]: For 1598/1739 co-relation queries the response was YES. [2025-03-08 22:13:37,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10263 conditions, 6209 events. 794/6209 cut-off events. For 1598/1739 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 54013 event pairs, 9 based on Foata normal form. 3/5834 useless extension candidates. Maximal degree in co-relation 10243. Up to 1259 conditions per place. [2025-03-08 22:13:37,749 INFO L140 encePairwiseOnDemand]: 657/663 looper letters, 50 selfloop transitions, 9 changer transitions 0/931 dead transitions. [2025-03-08 22:13:37,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 931 transitions, 4006 flow [2025-03-08 22:13:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:13:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 22:13:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 5141 transitions. [2025-03-08 22:13:37,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.861571979219038 [2025-03-08 22:13:37,756 INFO L175 Difference]: Start difference. First operand has 572 places, 923 transitions, 3870 flow. Second operand 9 states and 5141 transitions. [2025-03-08 22:13:37,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 931 transitions, 4006 flow [2025-03-08 22:13:37,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 931 transitions, 3988 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-08 22:13:37,782 INFO L231 Difference]: Finished difference. Result has 583 places, 929 transitions, 3902 flow [2025-03-08 22:13:37,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=663, PETRI_DIFFERENCE_MINUEND_FLOW=3852, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3902, PETRI_PLACES=583, PETRI_TRANSITIONS=929} [2025-03-08 22:13:37,783 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -4 predicate places. [2025-03-08 22:13:37,783 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 929 transitions, 3902 flow [2025-03-08 22:13:37,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 570.2222222222222) internal successors, (5132), 9 states have internal predecessors, (5132), 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-03-08 22:13:37,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:37,785 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] [2025-03-08 22:13:37,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:13:37,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 22:13:37,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-08 22:13:37,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:37,987 INFO L85 PathProgramCache]: Analyzing trace with hash 286975630, now seen corresponding path program 2 times [2025-03-08 22:13:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:37,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294625725] [2025-03-08 22:13:37,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:13:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:38,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-08 22:13:38,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 22:13:38,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:13:38,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:13:38,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:13:38,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 22:13:38,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 22:13:38,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:38,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:13:38,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:13:38,173 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:13:38,173 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2025-03-08 22:13:38,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-03-08 22:13:38,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-03-08 22:13:38,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-03-08 22:13:38,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-03-08 22:13:38,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-03-08 22:13:38,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-03-08 22:13:38,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-03-08 22:13:38,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-03-08 22:13:38,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-03-08 22:13:38,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-03-08 22:13:38,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-03-08 22:13:38,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-03-08 22:13:38,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-03-08 22:13:38,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:13:38,177 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:38,179 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:13:38,179 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:13:38,279 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:13:38,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 994 places, 1133 transitions, 2282 flow [2025-03-08 22:13:38,492 INFO L124 PetriNetUnfolderBase]: 145/1225 cut-off events. [2025-03-08 22:13:38,492 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:13:38,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1225 events. 145/1225 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4862 event pairs, 0 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 994. Up to 6 conditions per place. [2025-03-08 22:13:38,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 994 places, 1133 transitions, 2282 flow [2025-03-08 22:13:38,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 994 places, 1133 transitions, 2282 flow [2025-03-08 22:13:38,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:13:38,547 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;@38fdf53b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:13:38,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-08 22:13:38,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:13:38,551 INFO L124 PetriNetUnfolderBase]: 8/66 cut-off events. [2025-03-08 22:13:38,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:13:38,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:38,551 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-03-08 22:13:38,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-03-08 22:13:38,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash -68586503, now seen corresponding path program 1 times [2025-03-08 22:13:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:38,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130104225] [2025-03-08 22:13:38,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:38,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 22:13:38,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 22:13:38,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:38,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130104225] [2025-03-08 22:13:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130104225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:38,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:38,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:13:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480759073] [2025-03-08 22:13:38,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:38,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:13:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:38,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:13:38,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:13:38,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 978 out of 1133 [2025-03-08 22:13:38,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1133 transitions, 2282 flow. Second operand has 2 states, 2 states have (on average 979.0) internal successors, (1958), 2 states have internal predecessors, (1958), 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-03-08 22:13:38,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:38,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 978 of 1133 [2025-03-08 22:13:38,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:39,124 INFO L124 PetriNetUnfolderBase]: 130/3937 cut-off events. [2025-03-08 22:13:39,124 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-08 22:13:39,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4108 conditions, 3937 events. 130/3937 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 30890 event pairs, 54 based on Foata normal form. 626/4232 useless extension candidates. Maximal degree in co-relation 729. Up to 129 conditions per place. [2025-03-08 22:13:39,196 INFO L140 encePairwiseOnDemand]: 999/1133 looper letters, 18 selfloop transitions, 0 changer transitions 10/959 dead transitions. [2025-03-08 22:13:39,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 959 transitions, 1970 flow [2025-03-08 22:13:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:13:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 22:13:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2108 transitions. [2025-03-08 22:13:39,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302736098852604 [2025-03-08 22:13:39,201 INFO L175 Difference]: Start difference. First operand has 994 places, 1133 transitions, 2282 flow. Second operand 2 states and 2108 transitions. [2025-03-08 22:13:39,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 944 places, 959 transitions, 1970 flow [2025-03-08 22:13:39,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 944 places, 959 transitions, 1970 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:13:39,211 INFO L231 Difference]: Finished difference. Result has 944 places, 949 transitions, 1914 flow [2025-03-08 22:13:39,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1914, PETRI_PLACES=944, PETRI_TRANSITIONS=949} [2025-03-08 22:13:39,213 INFO L279 CegarLoopForPetriNet]: 994 programPoint places, -50 predicate places. [2025-03-08 22:13:39,213 INFO L471 AbstractCegarLoop]: Abstraction has has 944 places, 949 transitions, 1914 flow [2025-03-08 22:13:39,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 979.0) internal successors, (1958), 2 states have internal predecessors, (1958), 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-03-08 22:13:39,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:39,215 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] [2025-03-08 22:13:39,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:13:39,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2025-03-08 22:13:39,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash 236592613, now seen corresponding path program 1 times [2025-03-08 22:13:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:39,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415873235] [2025-03-08 22:13:39,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:39,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:13:39,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:13:39,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:39,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:39,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:39,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415873235] [2025-03-08 22:13:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415873235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:39,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:39,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:13:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543487796] [2025-03-08 22:13:39,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:39,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:39,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:39,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:13:39,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 831 out of 1133 [2025-03-08 22:13:39,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 949 transitions, 1914 flow. Second operand has 6 states, 6 states have (on average 832.3333333333334) internal successors, (4994), 6 states have internal predecessors, (4994), 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-03-08 22:13:39,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:39,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 831 of 1133 [2025-03-08 22:13:39,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand