./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/mcslock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:39:51,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:39:51,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:39:51,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:39:51,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:39:51,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:39:51,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:39:51,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:39:51,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:39:51,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:39:51,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:39:51,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:39:51,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:39:51,988 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:51,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:51,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:39:51,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:39:51,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:39:51,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:39:51,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:39:51,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:39:51,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:39:51,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:39:51,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:39:51,989 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 185c5ecec118867d41d6d4e251a2153dc547f1cc961cdbc2b790292b6debb75b [2025-01-09 21:39:52,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:39:52,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:39:52,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:39:52,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:39:52,217 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:39:52,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/mcslock.i [2025-01-09 21:39:53,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d10cb9f96/c2838ebe2fb1481198daeb4bfffaeb56/FLAGead2c892a [2025-01-09 21:39:53,856 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:39:53,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/mcslock.i [2025-01-09 21:39:53,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d10cb9f96/c2838ebe2fb1481198daeb4bfffaeb56/FLAGead2c892a [2025-01-09 21:39:53,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d10cb9f96/c2838ebe2fb1481198daeb4bfffaeb56 [2025-01-09 21:39:53,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:39:53,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:39:53,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:53,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:39:53,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:39:53,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:53" (1/1) ... [2025-01-09 21:39:53,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235ebeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:53, skipping insertion in model container [2025-01-09 21:39:53,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:53" (1/1) ... [2025-01-09 21:39:54,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:39:55,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:55,419 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:39:55,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-01-09 21:39:55,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-01-09 21:39:55,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-01-09 21:39:55,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-01-09 21:39:55,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-01-09 21:39:55,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-01-09 21:39:55,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-01-09 21:39:55,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-01-09 21:39:55,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-01-09 21:39:55,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-01-09 21:39:55,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-01-09 21:39:55,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-01-09 21:39:55,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-01-09 21:39:55,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-01-09 21:39:55,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-01-09 21:39:55,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-01-09 21:39:55,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-01-09 21:39:55,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-01-09 21:39:55,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-01-09 21:39:55,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-01-09 21:39:55,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-01-09 21:39:55,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-01-09 21:39:55,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-01-09 21:39:55,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-01-09 21:39:55,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-01-09 21:39:55,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-01-09 21:39:55,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-01-09 21:39:55,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-01-09 21:39:55,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-01-09 21:39:55,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-01-09 21:39:55,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-01-09 21:39:55,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-01-09 21:39:55,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-01-09 21:39:55,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-01-09 21:39:55,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-01-09 21:39:55,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-01-09 21:39:55,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-01-09 21:39:55,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-01-09 21:39:55,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-01-09 21:39:55,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-01-09 21:39:55,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-01-09 21:39:55,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-01-09 21:39:55,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-01-09 21:39:55,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-01-09 21:39:55,528 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-01-09 21:39:55,528 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-01-09 21:39:55,528 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-01-09 21:39:55,529 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-01-09 21:39:55,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-01-09 21:39:55,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-01-09 21:39:55,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-01-09 21:39:55,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-01-09 21:39:55,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-01-09 21:39:55,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-01-09 21:39:55,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-01-09 21:39:55,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-01-09 21:39:55,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-01-09 21:39:55,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-01-09 21:39:55,540 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-01-09 21:39:55,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-01-09 21:39:55,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-01-09 21:39:55,541 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-01-09 21:39:55,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-01-09 21:39:55,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-01-09 21:39:55,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-01-09 21:39:55,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-01-09 21:39:55,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-01-09 21:39:55,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-01-09 21:39:55,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-01-09 21:39:55,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-01-09 21:39:55,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-01-09 21:39:55,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-01-09 21:39:55,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-01-09 21:39:55,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-01-09 21:39:55,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-01-09 21:39:55,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-01-09 21:39:55,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-01-09 21:39:55,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-01-09 21:39:55,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-01-09 21:39:55,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-01-09 21:39:55,551 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-01-09 21:39:55,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-01-09 21:39:55,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-01-09 21:39:55,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-01-09 21:39:55,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-01-09 21:39:55,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-01-09 21:39:55,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-01-09 21:39:55,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-01-09 21:39:55,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-01-09 21:39:55,557 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-01-09 21:39:55,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-01-09 21:39:55,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-01-09 21:39:55,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-01-09 21:39:55,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-01-09 21:39:55,559 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-01-09 21:39:55,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-01-09 21:39:55,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-01-09 21:39:55,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-01-09 21:39:55,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-01-09 21:39:55,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-01-09 21:39:55,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:55,826 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:39:55,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55 WrapperNode [2025-01-09 21:39:55,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:55,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:55,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:39:55,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:39:55,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,917 INFO L138 Inliner]: procedures = 919, calls = 935, calls flagged for inlining = 830, calls inlined = 57, statements flattened = 612 [2025-01-09 21:39:55,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:55,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:39:55,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:39:55,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:39:55,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:39:55,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:39:55,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:39:55,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:39:55,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 21:39:55,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:56,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:39:56,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:39:56,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:39:56,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:39:56,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:39:56,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:39:56,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:39:56,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:39:56,036 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-01-09 21:39:56,036 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-01-09 21:39:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:39:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:39:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:39:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:39:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:39:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:39:56,040 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:39:56,157 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:39:56,158 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:39:56,873 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:39:56,873 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:39:57,017 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:39:57,017 INFO L312 CfgBuilder]: Removed 40 assume(true) statements. [2025-01-09 21:39:57,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:57 BoogieIcfgContainer [2025-01-09 21:39:57,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:39:57,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:39:57,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:39:57,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:39:57,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:53" (1/3) ... [2025-01-09 21:39:57,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568158b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:57, skipping insertion in model container [2025-01-09 21:39:57,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (2/3) ... [2025-01-09 21:39:57,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568158b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:57, skipping insertion in model container [2025-01-09 21:39:57,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:57" (3/3) ... [2025-01-09 21:39:57,025 INFO L128 eAbstractionObserver]: Analyzing ICFG mcslock.i [2025-01-09 21:39:57,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:39:57,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mcslock.i that has 2 procedures, 604 locations, 1 initial locations, 45 loop locations, and 25 error locations. [2025-01-09 21:39:57,037 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:39:57,206 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:39:57,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 607 places, 699 transitions, 1405 flow [2025-01-09 21:39:57,414 INFO L124 PetriNetUnfolderBase]: 109/777 cut-off events. [2025-01-09 21:39:57,415 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:39:57,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 777 events. 109/777 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2395 event pairs, 0 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 652. Up to 6 conditions per place. [2025-01-09 21:39:57,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 607 places, 699 transitions, 1405 flow [2025-01-09 21:39:57,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 607 places, 699 transitions, 1405 flow [2025-01-09 21:39:57,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:57,451 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;@196c1a12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:57,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-09 21:39:57,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:57,501 INFO L124 PetriNetUnfolderBase]: 12/70 cut-off events. [2025-01-09 21:39:57,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:57,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:57,502 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-01-09 21:39:57,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:39:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1985009500, now seen corresponding path program 1 times [2025-01-09 21:39:57,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:57,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627926449] [2025-01-09 21:39:57,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:57,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:57,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:39:57,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:39:57,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:57,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627926449] [2025-01-09 21:39:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627926449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:57,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686217608] [2025-01-09 21:39:57,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:57,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:39:57,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:57,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:39:57,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:39:57,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 699 [2025-01-09 21:39:57,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 699 transitions, 1405 flow. Second operand has 2 states, 2 states have (on average 587.5) internal successors, (1175), 2 states have internal predecessors, (1175), 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-01-09 21:39:57,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:57,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 699 [2025-01-09 21:39:57,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:57,946 INFO L124 PetriNetUnfolderBase]: 14/658 cut-off events. [2025-01-09 21:39:57,946 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:39:57,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 658 events. 14/658 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1988 event pairs, 0 based on Foata normal form. 250/873 useless extension candidates. Maximal degree in co-relation 570. Up to 16 conditions per place. [2025-01-09 21:39:57,951 INFO L140 encePairwiseOnDemand]: 602/699 looper letters, 15 selfloop transitions, 0 changer transitions 0/598 dead transitions. [2025-01-09 21:39:57,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 598 transitions, 1233 flow [2025-01-09 21:39:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:39:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:39:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1286 transitions. [2025-01-09 21:39:57,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9198855507868383 [2025-01-09 21:39:57,963 INFO L175 Difference]: Start difference. First operand has 607 places, 699 transitions, 1405 flow. Second operand 2 states and 1286 transitions. [2025-01-09 21:39:57,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 598 transitions, 1233 flow [2025-01-09 21:39:57,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 598 transitions, 1233 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:57,975 INFO L231 Difference]: Finished difference. Result has 588 places, 598 transitions, 1203 flow [2025-01-09 21:39:57,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=699, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1203, PETRI_PLACES=588, PETRI_TRANSITIONS=598} [2025-01-09 21:39:57,979 INFO L279 CegarLoopForPetriNet]: 607 programPoint places, -19 predicate places. [2025-01-09 21:39:57,979 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 598 transitions, 1203 flow [2025-01-09 21:39:57,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 587.5) internal successors, (1175), 2 states have internal predecessors, (1175), 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-01-09 21:39:57,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:57,980 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] [2025-01-09 21:39:57,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:39:57,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:39:57,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -639064172, now seen corresponding path program 1 times [2025-01-09 21:39:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358960588] [2025-01-09 21:39:57,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:57,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:57,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:39:58,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:39:58,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:58,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:58,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358960588] [2025-01-09 21:39:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358960588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:58,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27354250] [2025-01-09 21:39:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:58,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:58,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:58,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:59,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 699 [2025-01-09 21:39:59,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 598 transitions, 1203 flow. Second operand has 6 states, 6 states have (on average 569.5) internal successors, (3417), 6 states have internal predecessors, (3417), 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-01-09 21:39:59,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:59,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 699 [2025-01-09 21:39:59,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:59,767 INFO L124 PetriNetUnfolderBase]: 395/4738 cut-off events. [2025-01-09 21:39:59,767 INFO L125 PetriNetUnfolderBase]: For 6/20 co-relation queries the response was YES. [2025-01-09 21:39:59,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5374 conditions, 4738 events. 395/4738 cut-off events. For 6/20 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 46701 event pairs, 127 based on Foata normal form. 4/4354 useless extension candidates. Maximal degree in co-relation 5370. Up to 540 conditions per place. [2025-01-09 21:39:59,781 INFO L140 encePairwiseOnDemand]: 679/699 looper letters, 33 selfloop transitions, 58 changer transitions 0/655 dead transitions. [2025-01-09 21:39:59,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 655 transitions, 1499 flow [2025-01-09 21:39:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2025-01-09 21:39:59,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345255126371006 [2025-01-09 21:39:59,788 INFO L175 Difference]: Start difference. First operand has 588 places, 598 transitions, 1203 flow. Second operand 6 states and 3500 transitions. [2025-01-09 21:39:59,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 655 transitions, 1499 flow [2025-01-09 21:39:59,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 655 transitions, 1499 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:59,800 INFO L231 Difference]: Finished difference. Result has 598 places, 655 transitions, 1587 flow [2025-01-09 21:39:59,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=699, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1587, PETRI_PLACES=598, PETRI_TRANSITIONS=655} [2025-01-09 21:39:59,801 INFO L279 CegarLoopForPetriNet]: 607 programPoint places, -9 predicate places. [2025-01-09 21:39:59,801 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 655 transitions, 1587 flow [2025-01-09 21:39:59,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 569.5) internal successors, (3417), 6 states have internal predecessors, (3417), 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-01-09 21:39:59,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:59,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:59,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:39:59,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:39:59,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash -289576005, now seen corresponding path program 1 times [2025-01-09 21:39:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80820304] [2025-01-09 21:39:59,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:59,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:39:59,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:39:59,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:59,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:59,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:59,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80820304] [2025-01-09 21:39:59,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80820304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:59,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:59,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495592208] [2025-01-09 21:39:59,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:59,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:59,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:59,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:59,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 577 out of 699 [2025-01-09 21:39:59,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 655 transitions, 1587 flow. Second operand has 3 states, 3 states have (on average 577.6666666666666) internal successors, (1733), 3 states have internal predecessors, (1733), 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-01-09 21:39:59,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:59,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 577 of 699 [2025-01-09 21:39:59,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:00,642 INFO L124 PetriNetUnfolderBase]: 408/6260 cut-off events. [2025-01-09 21:40:00,642 INFO L125 PetriNetUnfolderBase]: For 625/1039 co-relation queries the response was YES. [2025-01-09 21:40:00,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7380 conditions, 6260 events. 408/6260 cut-off events. For 625/1039 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 56628 event pairs, 32 based on Foata normal form. 45/5968 useless extension candidates. Maximal degree in co-relation 7371. Up to 321 conditions per place. [2025-01-09 21:40:00,671 INFO L140 encePairwiseOnDemand]: 690/699 looper letters, 88 selfloop transitions, 6 changer transitions 0/672 dead transitions. [2025-01-09 21:40:00,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 672 transitions, 1835 flow [2025-01-09 21:40:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1776 transitions. [2025-01-09 21:40:00,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8469241773962805 [2025-01-09 21:40:00,675 INFO L175 Difference]: Start difference. First operand has 598 places, 655 transitions, 1587 flow. Second operand 3 states and 1776 transitions. [2025-01-09 21:40:00,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 672 transitions, 1835 flow [2025-01-09 21:40:00,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 672 transitions, 1835 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:40:00,684 INFO L231 Difference]: Finished difference. Result has 601 places, 659 transitions, 1633 flow [2025-01-09 21:40:00,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=699, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1633, PETRI_PLACES=601, PETRI_TRANSITIONS=659} [2025-01-09 21:40:00,686 INFO L279 CegarLoopForPetriNet]: 607 programPoint places, -6 predicate places. [2025-01-09 21:40:00,686 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 659 transitions, 1633 flow [2025-01-09 21:40:00,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 577.6666666666666) internal successors, (1733), 3 states have internal predecessors, (1733), 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-01-09 21:40:00,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:00,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:00,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:40:00,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:40:00,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash 890397234, now seen corresponding path program 1 times [2025-01-09 21:40:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:00,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041803071] [2025-01-09 21:40:00,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:00,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:40:00,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:40:00,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:00,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041803071] [2025-01-09 21:40:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041803071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:00,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:00,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:00,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536539569] [2025-01-09 21:40:00,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:00,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:00,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:00,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:00,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:00,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 699 [2025-01-09 21:40:00,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 659 transitions, 1633 flow. Second operand has 3 states, 3 states have (on average 580.6666666666666) internal successors, (1742), 3 states have internal predecessors, (1742), 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-01-09 21:40:00,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:00,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 699 [2025-01-09 21:40:00,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:01,743 INFO L124 PetriNetUnfolderBase]: 505/9170 cut-off events. [2025-01-09 21:40:01,744 INFO L125 PetriNetUnfolderBase]: For 730/884 co-relation queries the response was YES. [2025-01-09 21:40:01,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10571 conditions, 9170 events. 505/9170 cut-off events. For 730/884 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 89532 event pairs, 62 based on Foata normal form. 16/8751 useless extension candidates. Maximal degree in co-relation 10560. Up to 375 conditions per place. [2025-01-09 21:40:01,785 INFO L140 encePairwiseOnDemand]: 693/699 looper letters, 85 selfloop transitions, 4 changer transitions 0/674 dead transitions. [2025-01-09 21:40:01,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 674 transitions, 1867 flow [2025-01-09 21:40:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1779 transitions. [2025-01-09 21:40:01,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8483547925608012 [2025-01-09 21:40:01,789 INFO L175 Difference]: Start difference. First operand has 601 places, 659 transitions, 1633 flow. Second operand 3 states and 1779 transitions. [2025-01-09 21:40:01,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 674 transitions, 1867 flow [2025-01-09 21:40:01,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 674 transitions, 1855 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:01,803 INFO L231 Difference]: Finished difference. Result has 602 places, 661 transitions, 1649 flow [2025-01-09 21:40:01,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=699, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1649, PETRI_PLACES=602, PETRI_TRANSITIONS=661} [2025-01-09 21:40:01,807 INFO L279 CegarLoopForPetriNet]: 607 programPoint places, -5 predicate places. [2025-01-09 21:40:01,807 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 661 transitions, 1649 flow [2025-01-09 21:40:01,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 580.6666666666666) internal successors, (1742), 3 states have internal predecessors, (1742), 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-01-09 21:40:01,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:01,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:01,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:40:01,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:40:01,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash 815937266, now seen corresponding path program 1 times [2025-01-09 21:40:01,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:01,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520903733] [2025-01-09 21:40:01,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:01,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:01,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:40:01,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:40:01,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:01,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:01,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520903733] [2025-01-09 21:40:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520903733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:01,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:40:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248183944] [2025-01-09 21:40:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:01,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:01,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:01,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:01,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 581 out of 699 [2025-01-09 21:40:01,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 661 transitions, 1649 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 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-01-09 21:40:01,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:01,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 581 of 699 [2025-01-09 21:40:01,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:02,837 INFO L124 PetriNetUnfolderBase]: 452/8952 cut-off events. [2025-01-09 21:40:02,838 INFO L125 PetriNetUnfolderBase]: For 726/1182 co-relation queries the response was YES. [2025-01-09 21:40:02,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10354 conditions, 8952 events. 452/8952 cut-off events. For 726/1182 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 88208 event pairs, 77 based on Foata normal form. 10/8556 useless extension candidates. Maximal degree in co-relation 10342. Up to 446 conditions per place. [2025-01-09 21:40:02,873 INFO L140 encePairwiseOnDemand]: 696/699 looper letters, 87 selfloop transitions, 2 changer transitions 0/677 dead transitions. [2025-01-09 21:40:02,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 677 transitions, 1897 flow [2025-01-09 21:40:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1778 transitions. [2025-01-09 21:40:02,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8478779208392943 [2025-01-09 21:40:02,876 INFO L175 Difference]: Start difference. First operand has 602 places, 661 transitions, 1649 flow. Second operand 3 states and 1778 transitions. [2025-01-09 21:40:02,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 677 transitions, 1897 flow [2025-01-09 21:40:02,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 677 transitions, 1889 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:02,885 INFO L231 Difference]: Finished difference. Result has 603 places, 661 transitions, 1649 flow [2025-01-09 21:40:02,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=699, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1649, PETRI_PLACES=603, PETRI_TRANSITIONS=661} [2025-01-09 21:40:02,886 INFO L279 CegarLoopForPetriNet]: 607 programPoint places, -4 predicate places. [2025-01-09 21:40:02,886 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 661 transitions, 1649 flow [2025-01-09 21:40:02,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 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-01-09 21:40:02,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:02,888 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:02,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:40:02,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:40:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1324567033, now seen corresponding path program 1 times [2025-01-09 21:40:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322250546] [2025-01-09 21:40:02,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:02,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:40:02,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:40:02,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:02,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:02,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:40:02,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:40:02,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:40:02,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:02,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:02,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:40:02,948 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:40:02,949 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-01-09 21:40:02,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-01-09 21:40:02,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-01-09 21:40:02,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-01-09 21:40:02,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-01-09 21:40:02,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-01-09 21:40:02,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-01-09 21:40:02,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-01-09 21:40:02,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-01-09 21:40:02,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-01-09 21:40:02,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-01-09 21:40:02,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:40:02,957 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:40:02,959 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:40:02,959 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:40:03,109 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:40:03,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1104 places, 1269 transitions, 2554 flow [2025-01-09 21:40:03,461 INFO L124 PetriNetUnfolderBase]: 207/1489 cut-off events. [2025-01-09 21:40:03,461 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:40:03,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 1489 events. 207/1489 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6938 event pairs, 0 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1274. Up to 12 conditions per place. [2025-01-09 21:40:03,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 1104 places, 1269 transitions, 2554 flow [2025-01-09 21:40:03,529 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1104 places, 1269 transitions, 2554 flow [2025-01-09 21:40:03,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:03,530 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;@196c1a12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:03,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-01-09 21:40:03,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:03,532 INFO L124 PetriNetUnfolderBase]: 12/70 cut-off events. [2025-01-09 21:40:03,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:03,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:03,533 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-01-09 21:40:03,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-01-09 21:40:03,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:03,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1606409508, now seen corresponding path program 1 times [2025-01-09 21:40:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:03,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038781632] [2025-01-09 21:40:03,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:03,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:40:03,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:40:03,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:03,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038781632] [2025-01-09 21:40:03,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038781632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:03,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:03,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057483724] [2025-01-09 21:40:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:03,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:40:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:03,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:40:03,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:40:03,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1269 [2025-01-09 21:40:03,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1104 places, 1269 transitions, 2554 flow. Second operand has 2 states, 2 states have (on average 1065.5) internal successors, (2131), 2 states have internal predecessors, (2131), 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-01-09 21:40:03,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:03,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1269 [2025-01-09 21:40:03,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:05,399 INFO L124 PetriNetUnfolderBase]: 406/9804 cut-off events. [2025-01-09 21:40:05,400 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-01-09 21:40:05,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10330 conditions, 9804 events. 406/9804 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 107025 event pairs, 208 based on Foata normal form. 4482/13687 useless extension candidates. Maximal degree in co-relation 1381. Up to 449 conditions per place. [2025-01-09 21:40:05,558 INFO L140 encePairwiseOnDemand]: 1095/1269 looper letters, 30 selfloop transitions, 0 changer transitions 0/1091 dead transitions. [2025-01-09 21:40:05,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1069 places, 1091 transitions, 2258 flow [2025-01-09 21:40:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:40:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:40:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2334 transitions. [2025-01-09 21:40:05,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9196217494089834 [2025-01-09 21:40:05,564 INFO L175 Difference]: Start difference. First operand has 1104 places, 1269 transitions, 2554 flow. Second operand 2 states and 2334 transitions. [2025-01-09 21:40:05,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1069 places, 1091 transitions, 2258 flow [2025-01-09 21:40:05,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1069 places, 1091 transitions, 2258 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:40:05,579 INFO L231 Difference]: Finished difference. Result has 1069 places, 1091 transitions, 2198 flow [2025-01-09 21:40:05,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1269, PETRI_DIFFERENCE_MINUEND_FLOW=2198, PETRI_DIFFERENCE_MINUEND_PLACES=1068, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1091, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1091, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2198, PETRI_PLACES=1069, PETRI_TRANSITIONS=1091} [2025-01-09 21:40:05,582 INFO L279 CegarLoopForPetriNet]: 1104 programPoint places, -35 predicate places. [2025-01-09 21:40:05,582 INFO L471 AbstractCegarLoop]: Abstraction has has 1069 places, 1091 transitions, 2198 flow [2025-01-09 21:40:05,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1065.5) internal successors, (2131), 2 states have internal predecessors, (2131), 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-01-09 21:40:05,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:05,583 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] [2025-01-09 21:40:05,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:40:05,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-01-09 21:40:05,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash 434057556, now seen corresponding path program 1 times [2025-01-09 21:40:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:05,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692248334] [2025-01-09 21:40:05,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:05,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:05,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:40:05,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:40:05,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:05,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692248334] [2025-01-09 21:40:06,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692248334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:06,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:06,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:40:06,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709245928] [2025-01-09 21:40:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:06,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:40:06,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:06,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:40:06,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:40:06,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1046 out of 1269 [2025-01-09 21:40:06,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1069 places, 1091 transitions, 2198 flow. Second operand has 6 states, 6 states have (on average 1047.5) internal successors, (6285), 6 states have internal predecessors, (6285), 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-01-09 21:40:06,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:06,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1046 of 1269 [2025-01-09 21:40:06,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:19,756 INFO L124 PetriNetUnfolderBase]: 11474/81754 cut-off events. [2025-01-09 21:40:19,756 INFO L125 PetriNetUnfolderBase]: For 650/896 co-relation queries the response was YES. [2025-01-09 21:40:20,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96711 conditions, 81754 events. 11474/81754 cut-off events. For 650/896 co-relation queries the response was YES. Maximal size of possible extension queue 1276. Compared 1302991 event pairs, 5009 based on Foata normal form. 60/75485 useless extension candidates. Maximal degree in co-relation 96706. Up to 13532 conditions per place. [2025-01-09 21:40:20,638 INFO L140 encePairwiseOnDemand]: 1236/1269 looper letters, 49 selfloop transitions, 110 changer transitions 0/1201 dead transitions. [2025-01-09 21:40:20,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1074 places, 1201 transitions, 2741 flow [2025-01-09 21:40:20,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:40:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:40:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6436 transitions. [2025-01-09 21:40:20,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452850013133701 [2025-01-09 21:40:20,647 INFO L175 Difference]: Start difference. First operand has 1069 places, 1091 transitions, 2198 flow. Second operand 6 states and 6436 transitions. [2025-01-09 21:40:20,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1074 places, 1201 transitions, 2741 flow [2025-01-09 21:40:20,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1074 places, 1201 transitions, 2741 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:40:20,659 INFO L231 Difference]: Finished difference. Result has 1079 places, 1200 transitions, 2920 flow [2025-01-09 21:40:20,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1269, PETRI_DIFFERENCE_MINUEND_FLOW=2198, PETRI_DIFFERENCE_MINUEND_PLACES=1069, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1091, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2920, PETRI_PLACES=1079, PETRI_TRANSITIONS=1200} [2025-01-09 21:40:20,660 INFO L279 CegarLoopForPetriNet]: 1104 programPoint places, -25 predicate places. [2025-01-09 21:40:20,660 INFO L471 AbstractCegarLoop]: Abstraction has has 1079 places, 1200 transitions, 2920 flow [2025-01-09 21:40:20,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1047.5) internal successors, (6285), 6 states have internal predecessors, (6285), 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-01-09 21:40:20,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:20,663 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:20,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:40:20,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-01-09 21:40:20,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1322551056, now seen corresponding path program 1 times [2025-01-09 21:40:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639263855] [2025-01-09 21:40:20,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:20,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:40:20,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:40:20,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:20,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:20,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:20,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639263855] [2025-01-09 21:40:20,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639263855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:20,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:20,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:20,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28441572] [2025-01-09 21:40:20,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:20,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:20,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:20,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:20,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:20,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1269 [2025-01-09 21:40:20,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1079 places, 1200 transitions, 2920 flow. Second operand has 3 states, 3 states have (on average 1051.6666666666667) internal successors, (3155), 3 states have internal predecessors, (3155), 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-01-09 21:40:20,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:20,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1269 [2025-01-09 21:40:20,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand