./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/mcslock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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/mcslock.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 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:51:30,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:51:30,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:51:30,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:51:30,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:51:30,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:51:30,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:51:30,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:51:30,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:51:30,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:51:30,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:51:30,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:51:30,081 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:51:30,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:51:30,082 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:51:30,083 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:30,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:51:30,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:51:30,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:51:30,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:51:30,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:51:30,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:51:30,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:51:30,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:51:30,084 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 -> 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b [2025-03-14 01:51:30,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:51:30,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:51:30,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:51:30,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:51:30,306 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:51:30,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/mcslock.i [2025-03-14 01:51:31,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18024606/bfc6cd0ce4844f40b77555f96ac4b751/FLAG3f39bdf57 [2025-03-14 01:51:31,916 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:51:31,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/mcslock.i [2025-03-14 01:51:31,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18024606/bfc6cd0ce4844f40b77555f96ac4b751/FLAG3f39bdf57 [2025-03-14 01:51:32,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18024606/bfc6cd0ce4844f40b77555f96ac4b751 [2025-03-14 01:51:32,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:51:32,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:51:32,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:32,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:51:32,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:51:32,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:32" (1/1) ... [2025-03-14 01:51:32,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5ad4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:32, skipping insertion in model container [2025-03-14 01:51:32,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:51:32" (1/1) ... [2025-03-14 01:51:32,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:51:33,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:33,742 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:51:33,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-14 01:51:33,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-14 01:51:33,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-14 01:51:33,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-14 01:51:33,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-14 01:51:33,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-14 01:51:33,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-14 01:51:33,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-14 01:51:33,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-14 01:51:33,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-14 01:51:33,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-14 01:51:33,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-14 01:51:33,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-14 01:51:33,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-14 01:51:33,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-14 01:51:33,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-14 01:51:33,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-14 01:51:33,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-14 01:51:33,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-14 01:51:33,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-14 01:51:33,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-14 01:51:33,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-14 01:51:33,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-14 01:51:33,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-14 01:51:33,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-14 01:51:33,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-14 01:51:33,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-14 01:51:33,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-14 01:51:33,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-14 01:51:33,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-14 01:51:33,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-14 01:51:33,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-14 01:51:33,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-14 01:51:33,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-14 01:51:33,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-14 01:51:33,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-14 01:51:33,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-14 01:51:33,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-14 01:51:33,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-14 01:51:33,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-14 01:51:33,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-14 01:51:33,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-14 01:51:33,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-14 01:51:33,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-14 01:51:33,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-14 01:51:33,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-14 01:51:33,848 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-14 01:51:33,849 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-14 01:51:33,850 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-14 01:51:33,851 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-14 01:51:33,852 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-14 01:51:33,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-14 01:51:33,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-14 01:51:33,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-14 01:51:33,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-14 01:51:33,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-14 01:51:33,857 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-14 01:51:33,858 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-14 01:51:33,858 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-14 01:51:33,858 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-14 01:51:33,858 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-14 01:51:33,859 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-14 01:51:33,859 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-14 01:51:33,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-14 01:51:33,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-14 01:51:33,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-14 01:51:33,860 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-14 01:51:33,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-14 01:51:33,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-14 01:51:33,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-14 01:51:33,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-14 01:51:33,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-14 01:51:33,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-14 01:51:33,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-14 01:51:33,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-14 01:51:33,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-14 01:51:33,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-14 01:51:33,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-14 01:51:33,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-14 01:51:33,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-14 01:51:33,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-14 01:51:33,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-14 01:51:33,872 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-14 01:51:33,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-14 01:51:33,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-14 01:51:33,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-14 01:51:33,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-14 01:51:33,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-14 01:51:33,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-14 01:51:33,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-14 01:51:33,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-14 01:51:33,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-14 01:51:33,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-14 01:51:33,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-14 01:51:33,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-14 01:51:33,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-14 01:51:33,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-14 01:51:33,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-14 01:51:33,878 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-14 01:51:33,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-14 01:51:33,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:51:34,119 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:51:34,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34 WrapperNode [2025-03-14 01:51:34,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:51:34,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:34,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:51:34,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:51:34,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,225 INFO L138 Inliner]: procedures = 919, calls = 935, calls flagged for inlining = 830, calls inlined = 57, statements flattened = 612 [2025-03-14 01:51:34,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:51:34,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:51:34,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:51:34,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:51:34,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:51:34,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:51:34,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:51:34,275 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:51:34,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (1/1) ... [2025-03-14 01:51:34,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:51:34,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:51:34,308 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-14 01:51:34,311 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-14 01:51:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:51:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:51:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:51:34,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:51:34,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:51:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-14 01:51:34,333 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-14 01:51:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:51:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:51:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:51:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:51:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 01:51:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:51:34,334 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:51:34,484 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:51:34,485 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:51:34,706 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-14 01:51:34,709 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6026-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-14 01:51:35,208 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-03-14 01:51:35,208 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710: havoc vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset; [2025-03-14 01:51:35,208 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655: havoc vatomicptr_read_rlx_#t~ret412#1.base, vatomicptr_read_rlx_#t~ret412#1.offset; [2025-03-14 01:51:35,209 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-14 01:51:35,209 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700: havoc vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset; [2025-03-14 01:51:35,210 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:51:35,210 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:51:35,210 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:51:35,379 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:51:35,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:35 BoogieIcfgContainer [2025-03-14 01:51:35,382 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:51:35,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:51:35,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:51:35,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:51:35,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:51:32" (1/3) ... [2025-03-14 01:51:35,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593fe638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:35, skipping insertion in model container [2025-03-14 01:51:35,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:51:34" (2/3) ... [2025-03-14 01:51:35,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593fe638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:51:35, skipping insertion in model container [2025-03-14 01:51:35,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:51:35" (3/3) ... [2025-03-14 01:51:35,391 INFO L128 eAbstractionObserver]: Analyzing ICFG mcslock.i [2025-03-14 01:51:35,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:51:35,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mcslock.i that has 2 procedures, 582 locations, 1 initial locations, 23 loop locations, and 25 error locations. [2025-03-14 01:51:35,407 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:51:35,598 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:51:35,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 585 places, 677 transitions, 1361 flow [2025-03-14 01:51:35,846 INFO L124 PetriNetUnfolderBase]: 109/753 cut-off events. [2025-03-14 01:51:35,847 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:51:35,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 753 events. 109/753 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2265 event pairs, 0 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 632. Up to 8 conditions per place. [2025-03-14 01:51:35,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 585 places, 677 transitions, 1361 flow [2025-03-14 01:51:35,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 585 places, 677 transitions, 1361 flow [2025-03-14 01:51:35,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:35,911 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;@63ae0b68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:35,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-14 01:51:35,921 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:35,922 INFO L124 PetriNetUnfolderBase]: 12/65 cut-off events. [2025-03-14 01:51:35,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:35,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:35,924 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] [2025-03-14 01:51:35,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-14 01:51:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash -711161973, now seen corresponding path program 1 times [2025-03-14 01:51:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:35,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564490663] [2025-03-14 01:51:35,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:36,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:51:36,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:51:36,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:36,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:36,102 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-14 01:51:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564490663] [2025-03-14 01:51:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564490663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:36,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223451593] [2025-03-14 01:51:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:36,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:51:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:36,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:51:36,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:51:36,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 677 [2025-03-14 01:51:36,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 677 transitions, 1361 flow. Second operand has 2 states, 2 states have (on average 565.5) internal successors, (1131), 2 states have internal predecessors, (1131), 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-14 01:51:36,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:36,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 677 [2025-03-14 01:51:36,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:36,381 INFO L124 PetriNetUnfolderBase]: 14/634 cut-off events. [2025-03-14 01:51:36,382 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:51:36,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 634 events. 14/634 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1938 event pairs, 0 based on Foata normal form. 200/799 useless extension candidates. Maximal degree in co-relation 550. Up to 16 conditions per place. [2025-03-14 01:51:36,387 INFO L140 encePairwiseOnDemand]: 580/677 looper letters, 15 selfloop transitions, 0 changer transitions 0/576 dead transitions. [2025-03-14 01:51:36,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 576 transitions, 1189 flow [2025-03-14 01:51:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:51:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:51:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1242 transitions. [2025-03-14 01:51:36,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9172821270310192 [2025-03-14 01:51:36,407 INFO L175 Difference]: Start difference. First operand has 585 places, 677 transitions, 1361 flow. Second operand 2 states and 1242 transitions. [2025-03-14 01:51:36,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 576 transitions, 1189 flow [2025-03-14 01:51:36,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 576 transitions, 1189 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:36,428 INFO L231 Difference]: Finished difference. Result has 566 places, 576 transitions, 1159 flow [2025-03-14 01:51:36,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=677, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1159, PETRI_PLACES=566, PETRI_TRANSITIONS=576} [2025-03-14 01:51:36,435 INFO L279 CegarLoopForPetriNet]: 585 programPoint places, -19 predicate places. [2025-03-14 01:51:36,435 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 576 transitions, 1159 flow [2025-03-14 01:51:36,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 565.5) internal successors, (1131), 2 states have internal predecessors, (1131), 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-14 01:51:36,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:36,436 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] [2025-03-14 01:51:36,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:51:36,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-14 01:51:36,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1906198603, now seen corresponding path program 1 times [2025-03-14 01:51:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:36,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062626106] [2025-03-14 01:51:36,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:36,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:51:36,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:51:36,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:36,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:37,350 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-14 01:51:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:37,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062626106] [2025-03-14 01:51:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062626106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:51:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794827758] [2025-03-14 01:51:37,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:37,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:37,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:37,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:51:37,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 677 [2025-03-14 01:51:37,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 576 transitions, 1159 flow. Second operand has 6 states, 6 states have (on average 547.5) internal successors, (3285), 6 states have internal predecessors, (3285), 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-14 01:51:37,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:37,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 677 [2025-03-14 01:51:37,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:38,274 INFO L124 PetriNetUnfolderBase]: 395/4588 cut-off events. [2025-03-14 01:51:38,274 INFO L125 PetriNetUnfolderBase]: For 6/20 co-relation queries the response was YES. [2025-03-14 01:51:38,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5224 conditions, 4588 events. 395/4588 cut-off events. For 6/20 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 44983 event pairs, 117 based on Foata normal form. 4/4199 useless extension candidates. Maximal degree in co-relation 5220. Up to 540 conditions per place. [2025-03-14 01:51:38,294 INFO L140 encePairwiseOnDemand]: 657/677 looper letters, 33 selfloop transitions, 58 changer transitions 0/633 dead transitions. [2025-03-14 01:51:38,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 633 transitions, 1455 flow [2025-03-14 01:51:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:51:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:51:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3368 transitions. [2025-03-14 01:51:38,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8291482028557361 [2025-03-14 01:51:38,301 INFO L175 Difference]: Start difference. First operand has 566 places, 576 transitions, 1159 flow. Second operand 6 states and 3368 transitions. [2025-03-14 01:51:38,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 633 transitions, 1455 flow [2025-03-14 01:51:38,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 633 transitions, 1455 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:38,310 INFO L231 Difference]: Finished difference. Result has 576 places, 633 transitions, 1543 flow [2025-03-14 01:51:38,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=677, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1543, PETRI_PLACES=576, PETRI_TRANSITIONS=633} [2025-03-14 01:51:38,312 INFO L279 CegarLoopForPetriNet]: 585 programPoint places, -9 predicate places. [2025-03-14 01:51:38,312 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 633 transitions, 1543 flow [2025-03-14 01:51:38,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 547.5) internal successors, (3285), 6 states have internal predecessors, (3285), 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-14 01:51:38,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:38,314 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] [2025-03-14 01:51:38,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:51:38,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-14 01:51:38,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:38,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1530351896, now seen corresponding path program 1 times [2025-03-14 01:51:38,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:38,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729584826] [2025-03-14 01:51:38,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:38,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:38,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:51:38,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:51:38,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:38,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:38,347 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-14 01:51:38,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:38,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729584826] [2025-03-14 01:51:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729584826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:38,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:38,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226329906] [2025-03-14 01:51:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:38,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:38,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:38,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:38,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 555 out of 677 [2025-03-14 01:51:38,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 633 transitions, 1543 flow. Second operand has 3 states, 3 states have (on average 555.6666666666666) internal successors, (1667), 3 states have internal predecessors, (1667), 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-14 01:51:38,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:38,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 555 of 677 [2025-03-14 01:51:38,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:39,110 INFO L124 PetriNetUnfolderBase]: 413/6491 cut-off events. [2025-03-14 01:51:39,110 INFO L125 PetriNetUnfolderBase]: For 596/792 co-relation queries the response was YES. [2025-03-14 01:51:39,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7611 conditions, 6491 events. 413/6491 cut-off events. For 596/792 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 59217 event pairs, 71 based on Foata normal form. 16/6129 useless extension candidates. Maximal degree in co-relation 7602. Up to 325 conditions per place. [2025-03-14 01:51:39,141 INFO L140 encePairwiseOnDemand]: 668/677 looper letters, 88 selfloop transitions, 6 changer transitions 0/650 dead transitions. [2025-03-14 01:51:39,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 650 transitions, 1791 flow [2025-03-14 01:51:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1710 transitions. [2025-03-14 01:51:39,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419497784342689 [2025-03-14 01:51:39,147 INFO L175 Difference]: Start difference. First operand has 576 places, 633 transitions, 1543 flow. Second operand 3 states and 1710 transitions. [2025-03-14 01:51:39,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 650 transitions, 1791 flow [2025-03-14 01:51:39,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 650 transitions, 1791 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:39,158 INFO L231 Difference]: Finished difference. Result has 579 places, 637 transitions, 1589 flow [2025-03-14 01:51:39,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=677, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1589, PETRI_PLACES=579, PETRI_TRANSITIONS=637} [2025-03-14 01:51:39,160 INFO L279 CegarLoopForPetriNet]: 585 programPoint places, -6 predicate places. [2025-03-14 01:51:39,160 INFO L471 AbstractCegarLoop]: Abstraction has has 579 places, 637 transitions, 1589 flow [2025-03-14 01:51:39,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.6666666666666) internal successors, (1667), 3 states have internal predecessors, (1667), 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-14 01:51:39,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:39,161 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] [2025-03-14 01:51:39,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:51:39,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-14 01:51:39,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1789309375, now seen corresponding path program 1 times [2025-03-14 01:51:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:39,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140922140] [2025-03-14 01:51:39,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:39,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:39,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-14 01:51:39,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-14 01:51:39,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:39,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:39,190 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-14 01:51:39,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:39,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140922140] [2025-03-14 01:51:39,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140922140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:39,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:39,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798517932] [2025-03-14 01:51:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:39,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:39,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:39,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:39,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:39,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 558 out of 677 [2025-03-14 01:51:39,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 637 transitions, 1589 flow. Second operand has 3 states, 3 states have (on average 558.6666666666666) internal successors, (1676), 3 states have internal predecessors, (1676), 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-14 01:51:39,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:39,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 558 of 677 [2025-03-14 01:51:39,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:40,077 INFO L124 PetriNetUnfolderBase]: 491/8874 cut-off events. [2025-03-14 01:51:40,077 INFO L125 PetriNetUnfolderBase]: For 697/827 co-relation queries the response was YES. [2025-03-14 01:51:40,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10263 conditions, 8874 events. 491/8874 cut-off events. For 697/827 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 86313 event pairs, 62 based on Foata normal form. 16/8455 useless extension candidates. Maximal degree in co-relation 10252. Up to 375 conditions per place. [2025-03-14 01:51:40,113 INFO L140 encePairwiseOnDemand]: 671/677 looper letters, 85 selfloop transitions, 4 changer transitions 0/652 dead transitions. [2025-03-14 01:51:40,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 652 transitions, 1823 flow [2025-03-14 01:51:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1713 transitions. [2025-03-14 01:51:40,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.843426883308715 [2025-03-14 01:51:40,116 INFO L175 Difference]: Start difference. First operand has 579 places, 637 transitions, 1589 flow. Second operand 3 states and 1713 transitions. [2025-03-14 01:51:40,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 652 transitions, 1823 flow [2025-03-14 01:51:40,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 652 transitions, 1811 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:40,125 INFO L231 Difference]: Finished difference. Result has 580 places, 639 transitions, 1605 flow [2025-03-14 01:51:40,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=677, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1605, PETRI_PLACES=580, PETRI_TRANSITIONS=639} [2025-03-14 01:51:40,127 INFO L279 CegarLoopForPetriNet]: 585 programPoint places, -5 predicate places. [2025-03-14 01:51:40,128 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 639 transitions, 1605 flow [2025-03-14 01:51:40,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 558.6666666666666) internal successors, (1676), 3 states have internal predecessors, (1676), 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-14 01:51:40,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:40,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:51:40,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:51:40,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-14 01:51:40,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2096823383, now seen corresponding path program 1 times [2025-03-14 01:51:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:40,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663201788] [2025-03-14 01:51:40,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:40,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:51:40,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:51:40,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:40,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:40,200 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-14 01:51:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663201788] [2025-03-14 01:51:40,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663201788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:40,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:40,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:51:40,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577041036] [2025-03-14 01:51:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:40,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:40,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:40,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:40,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:40,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 559 out of 677 [2025-03-14 01:51:40,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 639 transitions, 1605 flow. Second operand has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 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-14 01:51:40,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:40,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 559 of 677 [2025-03-14 01:51:40,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:41,038 INFO L124 PetriNetUnfolderBase]: 447/8671 cut-off events. [2025-03-14 01:51:41,038 INFO L125 PetriNetUnfolderBase]: For 687/1044 co-relation queries the response was YES. [2025-03-14 01:51:41,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10078 conditions, 8671 events. 447/8671 cut-off events. For 687/1044 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 85160 event pairs, 77 based on Foata normal form. 10/8269 useless extension candidates. Maximal degree in co-relation 10066. Up to 448 conditions per place. [2025-03-14 01:51:41,071 INFO L140 encePairwiseOnDemand]: 674/677 looper letters, 87 selfloop transitions, 2 changer transitions 0/655 dead transitions. [2025-03-14 01:51:41,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 655 transitions, 1853 flow [2025-03-14 01:51:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:51:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:51:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2025-03-14 01:51:41,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8429345150172329 [2025-03-14 01:51:41,075 INFO L175 Difference]: Start difference. First operand has 580 places, 639 transitions, 1605 flow. Second operand 3 states and 1712 transitions. [2025-03-14 01:51:41,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 655 transitions, 1853 flow [2025-03-14 01:51:41,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 655 transitions, 1845 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:51:41,086 INFO L231 Difference]: Finished difference. Result has 581 places, 639 transitions, 1605 flow [2025-03-14 01:51:41,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=677, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1605, PETRI_PLACES=581, PETRI_TRANSITIONS=639} [2025-03-14 01:51:41,088 INFO L279 CegarLoopForPetriNet]: 585 programPoint places, -4 predicate places. [2025-03-14 01:51:41,088 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 639 transitions, 1605 flow [2025-03-14 01:51:41,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 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-14 01:51:41,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:41,089 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] [2025-03-14 01:51:41,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:51:41,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-14 01:51:41,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash 576077190, now seen corresponding path program 1 times [2025-03-14 01:51:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897845433] [2025-03-14 01:51:41,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:41,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:51:41,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:51:41,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:41,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:41,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:51:41,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:51:41,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:51:41,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:41,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:51:41,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:51:41,168 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:51:41,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-03-14 01:51:41,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-03-14 01:51:41,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-03-14 01:51:41,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-03-14 01:51:41,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-03-14 01:51:41,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-03-14 01:51:41,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:51:41,173 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-14 01:51:41,175 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:51:41,175 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:51:41,358 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:51:41,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1064 places, 1229 transitions, 2474 flow [2025-03-14 01:51:41,723 INFO L124 PetriNetUnfolderBase]: 207/1445 cut-off events. [2025-03-14 01:51:41,723 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:51:41,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 1445 events. 207/1445 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 6628 event pairs, 0 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 1236. Up to 12 conditions per place. [2025-03-14 01:51:41,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 1064 places, 1229 transitions, 2474 flow [2025-03-14 01:51:41,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1064 places, 1229 transitions, 2474 flow [2025-03-14 01:51:41,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:51:41,774 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;@63ae0b68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:51:41,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-03-14 01:51:41,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:51:41,777 INFO L124 PetriNetUnfolderBase]: 12/65 cut-off events. [2025-03-14 01:51:41,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:51:41,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:41,777 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] [2025-03-14 01:51:41,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-14 01:51:41,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1166170123, now seen corresponding path program 1 times [2025-03-14 01:51:41,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:41,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438493928] [2025-03-14 01:51:41,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:41,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:51:41,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:51:41,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:41,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:41,795 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-14 01:51:41,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:41,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438493928] [2025-03-14 01:51:41,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438493928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:41,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:41,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:41,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665010518] [2025-03-14 01:51:41,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:41,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:51:41,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:41,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:51:41,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:51:41,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1025 out of 1229 [2025-03-14 01:51:41,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1064 places, 1229 transitions, 2474 flow. Second operand has 2 states, 2 states have (on average 1025.5) internal successors, (2051), 2 states have internal predecessors, (2051), 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-14 01:51:41,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:41,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1025 of 1229 [2025-03-14 01:51:41,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:43,306 INFO L124 PetriNetUnfolderBase]: 406/9500 cut-off events. [2025-03-14 01:51:43,306 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-14 01:51:43,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10026 conditions, 9500 events. 406/9500 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 103498 event pairs, 208 based on Foata normal form. 3514/12415 useless extension candidates. Maximal degree in co-relation 1355. Up to 449 conditions per place. [2025-03-14 01:51:43,412 INFO L140 encePairwiseOnDemand]: 1055/1229 looper letters, 30 selfloop transitions, 0 changer transitions 0/1051 dead transitions. [2025-03-14 01:51:43,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1051 transitions, 2178 flow [2025-03-14 01:51:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:51:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:51:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2254 transitions. [2025-03-14 01:51:43,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9170056956875509 [2025-03-14 01:51:43,416 INFO L175 Difference]: Start difference. First operand has 1064 places, 1229 transitions, 2474 flow. Second operand 2 states and 2254 transitions. [2025-03-14 01:51:43,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1051 transitions, 2178 flow [2025-03-14 01:51:43,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 1051 transitions, 2178 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:43,427 INFO L231 Difference]: Finished difference. Result has 1029 places, 1051 transitions, 2118 flow [2025-03-14 01:51:43,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1229, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1028, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2118, PETRI_PLACES=1029, PETRI_TRANSITIONS=1051} [2025-03-14 01:51:43,428 INFO L279 CegarLoopForPetriNet]: 1064 programPoint places, -35 predicate places. [2025-03-14 01:51:43,429 INFO L471 AbstractCegarLoop]: Abstraction has has 1029 places, 1051 transitions, 2118 flow [2025-03-14 01:51:43,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1025.5) internal successors, (2051), 2 states have internal predecessors, (2051), 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-14 01:51:43,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:43,430 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] [2025-03-14 01:51:43,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:51:43,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-14 01:51:43,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:43,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2136117867, now seen corresponding path program 1 times [2025-03-14 01:51:43,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:43,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706466536] [2025-03-14 01:51:43,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:43,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:51:43,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:51:43,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:43,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:43,839 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-14 01:51:43,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706466536] [2025-03-14 01:51:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706466536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:43,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:51:43,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991029781] [2025-03-14 01:51:43,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:43,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:51:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:43,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:51:43,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:51:43,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1006 out of 1229 [2025-03-14 01:51:43,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1051 transitions, 2118 flow. Second operand has 6 states, 6 states have (on average 1007.5) internal successors, (6045), 6 states have internal predecessors, (6045), 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-14 01:51:43,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:43,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1006 of 1229 [2025-03-14 01:51:43,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:51:56,686 INFO L124 PetriNetUnfolderBase]: 11371/77251 cut-off events. [2025-03-14 01:51:56,687 INFO L125 PetriNetUnfolderBase]: For 625/848 co-relation queries the response was YES. [2025-03-14 01:51:57,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92146 conditions, 77251 events. 11371/77251 cut-off events. For 625/848 co-relation queries the response was YES. Maximal size of possible extension queue 1273. Compared 1225172 event pairs, 4983 based on Foata normal form. 60/71054 useless extension candidates. Maximal degree in co-relation 92141. Up to 13470 conditions per place. [2025-03-14 01:51:57,671 INFO L140 encePairwiseOnDemand]: 1196/1229 looper letters, 49 selfloop transitions, 110 changer transitions 0/1161 dead transitions. [2025-03-14 01:51:57,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 1161 transitions, 2661 flow [2025-03-14 01:51:57,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:51:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:51:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6196 transitions. [2025-03-14 01:51:57,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8402495253593708 [2025-03-14 01:51:57,682 INFO L175 Difference]: Start difference. First operand has 1029 places, 1051 transitions, 2118 flow. Second operand 6 states and 6196 transitions. [2025-03-14 01:51:57,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 1161 transitions, 2661 flow [2025-03-14 01:51:57,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1034 places, 1161 transitions, 2661 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:51:57,698 INFO L231 Difference]: Finished difference. Result has 1039 places, 1160 transitions, 2840 flow [2025-03-14 01:51:57,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1229, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2840, PETRI_PLACES=1039, PETRI_TRANSITIONS=1160} [2025-03-14 01:51:57,700 INFO L279 CegarLoopForPetriNet]: 1064 programPoint places, -25 predicate places. [2025-03-14 01:51:57,700 INFO L471 AbstractCegarLoop]: Abstraction has has 1039 places, 1160 transitions, 2840 flow [2025-03-14 01:51:57,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1007.5) internal successors, (6045), 6 states have internal predecessors, (6045), 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-14 01:51:57,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:51:57,703 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] [2025-03-14 01:51:57,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:51:57,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-14 01:51:57,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:51:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash -894051755, now seen corresponding path program 1 times [2025-03-14 01:51:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:51:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58776886] [2025-03-14 01:51:57,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:51:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:51:57,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-14 01:51:57,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-14 01:51:57,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:51:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:51:57,726 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-14 01:51:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:51:57,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58776886] [2025-03-14 01:51:57,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58776886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:51:57,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:51:57,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:51:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505552817] [2025-03-14 01:51:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:51:57,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:51:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:51:57,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:51:57,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:51:57,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1011 out of 1229 [2025-03-14 01:51:57,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1039 places, 1160 transitions, 2840 flow. Second operand has 3 states, 3 states have (on average 1011.6666666666666) internal successors, (3035), 3 states have internal predecessors, (3035), 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-14 01:51:57,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:51:57,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1011 of 1229 [2025-03-14 01:51:57,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand