./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.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/bounded_mpmc_check_full.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 f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:39:40,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:39:40,594 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:40,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:39:40,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:39:40,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:39:40,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:39:40,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:39:40,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:39:40,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:39:40,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:39:40,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:39:40,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:39:40,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:40,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:40,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:39:40,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:39:40,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:39:40,630 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 -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe [2025-01-09 21:39:40,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:39:40,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:39:40,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:39:40,926 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:39:40,927 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:39:40,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-01-09 21:39:42,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcdc0330c/87d854cc780e462681b9200d9165e477/FLAGe79e7b9d2 [2025-01-09 21:39:42,467 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:39:42,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-01-09 21:39:42,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcdc0330c/87d854cc780e462681b9200d9165e477/FLAGe79e7b9d2 [2025-01-09 21:39:42,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcdc0330c/87d854cc780e462681b9200d9165e477 [2025-01-09 21:39:42,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:39:42,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:39:42,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:42,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:39:42,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:39:42,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:42" (1/1) ... [2025-01-09 21:39:42,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e23342e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:42, skipping insertion in model container [2025-01-09 21:39:42,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:42" (1/1) ... [2025-01-09 21:39:42,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:39:44,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:44,400 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:39:44,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-01-09 21:39:44,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-01-09 21:39:44,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-01-09 21:39:44,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-01-09 21:39:44,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-01-09 21:39:44,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-01-09 21:39:44,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-01-09 21:39:44,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-01-09 21:39:44,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-01-09 21:39:44,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-01-09 21:39:44,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-01-09 21:39:44,475 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-01-09 21:39:44,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-01-09 21:39:44,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-01-09 21:39:44,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-01-09 21:39:44,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-01-09 21:39:44,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-01-09 21:39:44,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-01-09 21:39:44,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-01-09 21:39:44,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-01-09 21:39:44,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-01-09 21:39:44,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-01-09 21:39:44,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-01-09 21:39:44,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-01-09 21:39:44,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-01-09 21:39:44,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-01-09 21:39:44,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-01-09 21:39:44,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-01-09 21:39:44,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-01-09 21:39:44,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-01-09 21:39:44,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-01-09 21:39:44,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-01-09 21:39:44,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-01-09 21:39:44,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-01-09 21:39:44,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-01-09 21:39:44,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-01-09 21:39:44,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-01-09 21:39:44,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-01-09 21:39:44,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-01-09 21:39:44,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-01-09 21:39:44,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-01-09 21:39:44,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-01-09 21:39:44,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-01-09 21:39:44,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-01-09 21:39:44,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-01-09 21:39:44,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-01-09 21:39:44,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-01-09 21:39:44,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-01-09 21:39:44,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-01-09 21:39:44,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-01-09 21:39:44,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-01-09 21:39:44,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-01-09 21:39:44,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-01-09 21:39:44,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-01-09 21:39:44,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-01-09 21:39:44,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-01-09 21:39:44,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-01-09 21:39:44,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-01-09 21:39:44,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-01-09 21:39:44,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-01-09 21:39:44,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-01-09 21:39:44,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-01-09 21:39:44,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-01-09 21:39:44,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-01-09 21:39:44,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-01-09 21:39:44,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-01-09 21:39:44,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-01-09 21:39:44,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-01-09 21:39:44,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-01-09 21:39:44,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-01-09 21:39:44,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-01-09 21:39:44,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-01-09 21:39:44,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-01-09 21:39:44,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-01-09 21:39:44,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-01-09 21:39:44,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-01-09 21:39:44,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-01-09 21:39:44,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-01-09 21:39:44,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-01-09 21:39:44,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-01-09 21:39:44,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-01-09 21:39:44,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-01-09 21:39:44,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-01-09 21:39:44,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-01-09 21:39:44,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-01-09 21:39:44,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-01-09 21:39:44,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-01-09 21:39:44,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-01-09 21:39:44,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-01-09 21:39:44,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-01-09 21:39:44,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-01-09 21:39:44,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-01-09 21:39:44,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-01-09 21:39:44,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-01-09 21:39:44,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-01-09 21:39:44,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-01-09 21:39:44,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-01-09 21:39:44,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-01-09 21:39:44,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-01-09 21:39:44,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-01-09 21:39:44,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:44,777 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:39:44,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:44 WrapperNode [2025-01-09 21:39:44,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:44,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:44,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:39:44,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:39:44,783 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:44" (1/1) ... [2025-01-09 21:39:44,832 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:44" (1/1) ... [2025-01-09 21:39:44,907 INFO L138 Inliner]: procedures = 914, calls = 957, calls flagged for inlining = 822, calls inlined = 64, statements flattened = 941 [2025-01-09 21:39:44,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:44,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:39:44,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:39:44,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:39:44,914 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:44" (1/1) ... [2025-01-09 21:39:44,915 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:44" (1/1) ... [2025-01-09 21:39:44,923 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:44" (1/1) ... [2025-01-09 21:39:44,924 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:44" (1/1) ... [2025-01-09 21:39:44,951 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:44" (1/1) ... [2025-01-09 21:39:44,954 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:44" (1/1) ... [2025-01-09 21:39:44,958 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:44" (1/1) ... [2025-01-09 21:39:44,962 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:44" (1/1) ... [2025-01-09 21:39:44,965 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:44" (1/1) ... [2025-01-09 21:39:44,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:39:44,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:39:44,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:39:44,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:39:44,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:44" (1/1) ... [2025-01-09 21:39:44,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:44,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:39:45,012 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:45,018 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:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:39:45,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-01-09 21:39:45,033 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:39:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:39:45,035 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:45,174 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:39:45,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:39:46,203 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:39:46,203 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:39:46,394 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:39:46,395 INFO L312 CfgBuilder]: Removed 20 assume(true) statements. [2025-01-09 21:39:46,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:46 BoogieIcfgContainer [2025-01-09 21:39:46,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:39:46,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:39:46,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:39:46,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:39:46,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:42" (1/3) ... [2025-01-09 21:39:46,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44580c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:46, skipping insertion in model container [2025-01-09 21:39:46,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:44" (2/3) ... [2025-01-09 21:39:46,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44580c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:46, skipping insertion in model container [2025-01-09 21:39:46,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:46" (3/3) ... [2025-01-09 21:39:46,403 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-01-09 21:39:46,416 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:39:46,418 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 952 locations, 1 initial locations, 23 loop locations, and 48 error locations. [2025-01-09 21:39:46,418 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:39:46,589 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:39:46,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 955 places, 1017 transitions, 2041 flow [2025-01-09 21:39:47,162 INFO L124 PetriNetUnfolderBase]: 116/1677 cut-off events. [2025-01-09 21:39:47,165 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:39:47,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1682 conditions, 1677 events. 116/1677 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 5784 event pairs, 0 based on Foata normal form. 0/1478 useless extension candidates. Maximal degree in co-relation 866. Up to 6 conditions per place. [2025-01-09 21:39:47,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 955 places, 1017 transitions, 2041 flow [2025-01-09 21:39:47,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 955 places, 1017 transitions, 2041 flow [2025-01-09 21:39:47,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:47,221 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;@102cd0ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:47,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-01-09 21:39:47,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:47,228 INFO L124 PetriNetUnfolderBase]: 8/64 cut-off events. [2025-01-09 21:39:47,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:47,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:47,229 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] [2025-01-09 21:39:47,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:39:47,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:47,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1296351230, now seen corresponding path program 1 times [2025-01-09 21:39:47,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:47,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725190221] [2025-01-09 21:39:47,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:47,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:39:47,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:39:47,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:47,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:47,414 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:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:47,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725190221] [2025-01-09 21:39:47,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725190221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:47,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:47,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:47,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120667317] [2025-01-09 21:39:47,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:47,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:39:47,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:47,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:39:47,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:39:47,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 917 out of 1017 [2025-01-09 21:39:47,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 1017 transitions, 2041 flow. Second operand has 2 states, 2 states have (on average 918.0) internal successors, (1836), 2 states have internal predecessors, (1836), 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:47,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:47,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 917 of 1017 [2025-01-09 21:39:47,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:48,450 INFO L124 PetriNetUnfolderBase]: 105/3769 cut-off events. [2025-01-09 21:39:48,451 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:39:48,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3915 conditions, 3769 events. 105/3769 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 24339 event pairs, 52 based on Foata normal form. 256/3839 useless extension candidates. Maximal degree in co-relation 3164. Up to 141 conditions per place. [2025-01-09 21:39:48,488 INFO L140 encePairwiseOnDemand]: 940/1017 looper letters, 23 selfloop transitions, 0 changer transitions 6/926 dead transitions. [2025-01-09 21:39:48,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 917 places, 926 transitions, 1905 flow [2025-01-09 21:39:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:39:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:39:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1934 transitions. [2025-01-09 21:39:48,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508357915437562 [2025-01-09 21:39:48,509 INFO L175 Difference]: Start difference. First operand has 955 places, 1017 transitions, 2041 flow. Second operand 2 states and 1934 transitions. [2025-01-09 21:39:48,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 917 places, 926 transitions, 1905 flow [2025-01-09 21:39:48,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 926 transitions, 1905 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:48,532 INFO L231 Difference]: Finished difference. Result has 917 places, 920 transitions, 1847 flow [2025-01-09 21:39:48,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1017, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1847, PETRI_PLACES=917, PETRI_TRANSITIONS=920} [2025-01-09 21:39:48,538 INFO L279 CegarLoopForPetriNet]: 955 programPoint places, -38 predicate places. [2025-01-09 21:39:48,539 INFO L471 AbstractCegarLoop]: Abstraction has has 917 places, 920 transitions, 1847 flow [2025-01-09 21:39:48,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 918.0) internal successors, (1836), 2 states have internal predecessors, (1836), 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:48,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:48,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:48,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:39:48,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:39:48,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2138934002, now seen corresponding path program 1 times [2025-01-09 21:39:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116278835] [2025-01-09 21:39:48,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:48,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:48,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:39:48,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:39:48,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:49,184 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:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116278835] [2025-01-09 21:39:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116278835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:49,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139272092] [2025-01-09 21:39:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:49,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:49,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:49,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:49,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 822 out of 1017 [2025-01-09 21:39:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 920 transitions, 1847 flow. Second operand has 6 states, 6 states have (on average 823.3333333333334) internal successors, (4940), 6 states have internal predecessors, (4940), 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:49,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:49,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 822 of 1017 [2025-01-09 21:39:49,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:52,726 INFO L124 PetriNetUnfolderBase]: 2301/17600 cut-off events. [2025-01-09 21:39:52,727 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-01-09 21:39:52,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21759 conditions, 17600 events. 2301/17600 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 176850 event pairs, 1848 based on Foata normal form. 0/16539 useless extension candidates. Maximal degree in co-relation 21755. Up to 4147 conditions per place. [2025-01-09 21:39:52,807 INFO L140 encePairwiseOnDemand]: 1011/1017 looper letters, 112 selfloop transitions, 5 changer transitions 0/919 dead transitions. [2025-01-09 21:39:52,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 915 places, 919 transitions, 2079 flow [2025-01-09 21:39:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5050 transitions. [2025-01-09 21:39:52,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8275975090134382 [2025-01-09 21:39:52,816 INFO L175 Difference]: Start difference. First operand has 917 places, 920 transitions, 1847 flow. Second operand 6 states and 5050 transitions. [2025-01-09 21:39:52,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 915 places, 919 transitions, 2079 flow [2025-01-09 21:39:52,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 915 places, 919 transitions, 2079 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:52,827 INFO L231 Difference]: Finished difference. Result has 915 places, 919 transitions, 1855 flow [2025-01-09 21:39:52,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1017, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=910, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=914, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1855, PETRI_PLACES=915, PETRI_TRANSITIONS=919} [2025-01-09 21:39:52,828 INFO L279 CegarLoopForPetriNet]: 955 programPoint places, -40 predicate places. [2025-01-09 21:39:52,828 INFO L471 AbstractCegarLoop]: Abstraction has has 915 places, 919 transitions, 1855 flow [2025-01-09 21:39:52,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 823.3333333333334) internal successors, (4940), 6 states have internal predecessors, (4940), 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:52,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:52,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:52,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:39:52,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:39:52,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:52,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1351776272, now seen corresponding path program 1 times [2025-01-09 21:39:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:52,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021466376] [2025-01-09 21:39:52,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:52,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:52,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:39:52,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:39:52,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:52,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:53,241 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:53,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:53,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021466376] [2025-01-09 21:39:53,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021466376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:53,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:53,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856356929] [2025-01-09 21:39:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:53,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:53,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:53,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:53,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:53,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 822 out of 1017 [2025-01-09 21:39:53,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 915 places, 919 transitions, 1855 flow. Second operand has 6 states, 6 states have (on average 823.3333333333334) internal successors, (4940), 6 states have internal predecessors, (4940), 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:53,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:53,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 822 of 1017 [2025-01-09 21:39:53,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:56,486 INFO L124 PetriNetUnfolderBase]: 2301/17599 cut-off events. [2025-01-09 21:39:56,486 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-01-09 21:39:56,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21764 conditions, 17599 events. 2301/17599 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 176629 event pairs, 1848 based on Foata normal form. 0/16539 useless extension candidates. Maximal degree in co-relation 21759. Up to 4147 conditions per place. [2025-01-09 21:39:56,561 INFO L140 encePairwiseOnDemand]: 1011/1017 looper letters, 112 selfloop transitions, 5 changer transitions 0/918 dead transitions. [2025-01-09 21:39:56,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 918 transitions, 2087 flow [2025-01-09 21:39:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5050 transitions. [2025-01-09 21:39:56,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8275975090134382 [2025-01-09 21:39:56,570 INFO L175 Difference]: Start difference. First operand has 915 places, 919 transitions, 1855 flow. Second operand 6 states and 5050 transitions. [2025-01-09 21:39:56,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 918 transitions, 2087 flow [2025-01-09 21:39:56,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 914 places, 918 transitions, 2077 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:39:56,583 INFO L231 Difference]: Finished difference. Result has 914 places, 918 transitions, 1853 flow [2025-01-09 21:39:56,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1017, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1853, PETRI_PLACES=914, PETRI_TRANSITIONS=918} [2025-01-09 21:39:56,588 INFO L279 CegarLoopForPetriNet]: 955 programPoint places, -41 predicate places. [2025-01-09 21:39:56,588 INFO L471 AbstractCegarLoop]: Abstraction has has 914 places, 918 transitions, 1853 flow [2025-01-09 21:39:56,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 823.3333333333334) internal successors, (4940), 6 states have internal predecessors, (4940), 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:56,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:56,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:56,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:39:56,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:39:56,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:56,595 INFO L85 PathProgramCache]: Analyzing trace with hash -604454391, now seen corresponding path program 1 times [2025-01-09 21:39:56,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:56,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119705214] [2025-01-09 21:39:56,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:56,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:56,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:39:56,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:39:56,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:56,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:56,745 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:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:56,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119705214] [2025-01-09 21:39:56,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119705214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:56,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:56,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:39:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609614441] [2025-01-09 21:39:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:56,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:56,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:56,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:56,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 911 out of 1017 [2025-01-09 21:39:56,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 914 places, 918 transitions, 1853 flow. Second operand has 3 states, 3 states have (on average 913.6666666666666) internal successors, (2741), 3 states have internal predecessors, (2741), 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:56,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:56,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 911 of 1017 [2025-01-09 21:39:56,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:57,361 INFO L124 PetriNetUnfolderBase]: 120/3950 cut-off events. [2025-01-09 21:39:57,362 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-01-09 21:39:57,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4142 conditions, 3950 events. 120/3950 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 26340 event pairs, 0 based on Foata normal form. 2/3752 useless extension candidates. Maximal degree in co-relation 4137. Up to 174 conditions per place. [2025-01-09 21:39:57,391 INFO L140 encePairwiseOnDemand]: 1014/1017 looper letters, 31 selfloop transitions, 2 changer transitions 0/922 dead transitions. [2025-01-09 21:39:57,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 916 places, 922 transitions, 1927 flow [2025-01-09 21:39:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2767 transitions. [2025-01-09 21:39:57,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.906915765322845 [2025-01-09 21:39:57,396 INFO L175 Difference]: Start difference. First operand has 914 places, 918 transitions, 1853 flow. Second operand 3 states and 2767 transitions. [2025-01-09 21:39:57,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 916 places, 922 transitions, 1927 flow [2025-01-09 21:39:57,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 911 places, 922 transitions, 1917 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:39:57,412 INFO L231 Difference]: Finished difference. Result has 912 places, 918 transitions, 1851 flow [2025-01-09 21:39:57,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1017, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1851, PETRI_PLACES=912, PETRI_TRANSITIONS=918} [2025-01-09 21:39:57,415 INFO L279 CegarLoopForPetriNet]: 955 programPoint places, -43 predicate places. [2025-01-09 21:39:57,415 INFO L471 AbstractCegarLoop]: Abstraction has has 912 places, 918 transitions, 1851 flow [2025-01-09 21:39:57,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 913.6666666666666) internal successors, (2741), 3 states have internal predecessors, (2741), 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,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:57,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:57,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:39:57,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:39:57,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:57,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1145100361, now seen corresponding path program 1 times [2025-01-09 21:39:57,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:57,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764316099] [2025-01-09 21:39:57,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:57,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:57,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 21:39:57,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 21:39:57,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:57,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:39:58,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764316099] [2025-01-09 21:39:58,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764316099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:58,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:58,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:58,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568741468] [2025-01-09 21:39:58,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:58,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:58,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:58,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:58,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 814 out of 1017 [2025-01-09 21:39:58,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 918 transitions, 1851 flow. Second operand has 6 states, 6 states have (on average 817.5) internal successors, (4905), 6 states have internal predecessors, (4905), 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:58,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:58,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 814 of 1017 [2025-01-09 21:39:58,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:02,857 INFO L124 PetriNetUnfolderBase]: 2583/19191 cut-off events. [2025-01-09 21:40:02,857 INFO L125 PetriNetUnfolderBase]: For 45/58 co-relation queries the response was YES. [2025-01-09 21:40:02,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23998 conditions, 19191 events. 2583/19191 cut-off events. For 45/58 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 193889 event pairs, 1895 based on Foata normal form. 4/18088 useless extension candidates. Maximal degree in co-relation 23992. Up to 4590 conditions per place. [2025-01-09 21:40:02,922 INFO L140 encePairwiseOnDemand]: 986/1017 looper letters, 125 selfloop transitions, 102 changer transitions 0/1019 dead transitions. [2025-01-09 21:40:02,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 917 places, 1019 transitions, 2507 flow [2025-01-09 21:40:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:40:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:40:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5112 transitions. [2025-01-09 21:40:02,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8377581120943953 [2025-01-09 21:40:02,932 INFO L175 Difference]: Start difference. First operand has 912 places, 918 transitions, 1851 flow. Second operand 6 states and 5112 transitions. [2025-01-09 21:40:02,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 917 places, 1019 transitions, 2507 flow [2025-01-09 21:40:02,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 915 places, 1019 transitions, 2503 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:02,943 INFO L231 Difference]: Finished difference. Result has 920 places, 1019 transitions, 2517 flow [2025-01-09 21:40:02,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1017, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=910, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=888, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2517, PETRI_PLACES=920, PETRI_TRANSITIONS=1019} [2025-01-09 21:40:02,945 INFO L279 CegarLoopForPetriNet]: 955 programPoint places, -35 predicate places. [2025-01-09 21:40:02,945 INFO L471 AbstractCegarLoop]: Abstraction has has 920 places, 1019 transitions, 2517 flow [2025-01-09 21:40:02,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 817.5) internal successors, (4905), 6 states have internal predecessors, (4905), 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,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:02,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:40:02,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:40:02,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:02,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1734890960, now seen corresponding path program 1 times [2025-01-09 21:40:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:02,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562554760] [2025-01-09 21:40:02,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:02,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:02,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:40:02,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:40:02,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:02,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:40:03,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562554760] [2025-01-09 21:40:03,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562554760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:03,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:03,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:40:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905893970] [2025-01-09 21:40:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:03,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:40:03,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:03,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:40:03,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:40:03,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 909 out of 1017 [2025-01-09 21:40:03,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 1019 transitions, 2517 flow. Second operand has 5 states, 5 states have (on average 911.4) internal successors, (4557), 5 states have internal predecessors, (4557), 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,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:03,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 909 of 1017 [2025-01-09 21:40:03,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:03,379 INFO L124 PetriNetUnfolderBase]: 188/1788 cut-off events. [2025-01-09 21:40:03,379 INFO L125 PetriNetUnfolderBase]: For 259/386 co-relation queries the response was YES. [2025-01-09 21:40:03,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 1788 events. 188/1788 cut-off events. For 259/386 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 10232 event pairs, 0 based on Foata normal form. 50/1767 useless extension candidates. Maximal degree in co-relation 2599. Up to 309 conditions per place. [2025-01-09 21:40:03,385 INFO L140 encePairwiseOnDemand]: 1012/1017 looper letters, 38 selfloop transitions, 4 changer transitions 0/446 dead transitions. [2025-01-09 21:40:03,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 446 transitions, 1474 flow [2025-01-09 21:40:03,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:40:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:40:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5481 transitions. [2025-01-09 21:40:03,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982300884955752 [2025-01-09 21:40:03,393 INFO L175 Difference]: Start difference. First operand has 920 places, 1019 transitions, 2517 flow. Second operand 6 states and 5481 transitions. [2025-01-09 21:40:03,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 446 transitions, 1474 flow [2025-01-09 21:40:03,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 446 transitions, 1472 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:03,404 INFO L231 Difference]: Finished difference. Result has 348 places, 434 transitions, 1348 flow [2025-01-09 21:40:03,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1017, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1348, PETRI_PLACES=348, PETRI_TRANSITIONS=434} [2025-01-09 21:40:03,407 INFO L279 CegarLoopForPetriNet]: 955 programPoint places, -607 predicate places. [2025-01-09 21:40:03,407 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 434 transitions, 1348 flow [2025-01-09 21:40:03,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 911.4) internal successors, (4557), 5 states have internal predecessors, (4557), 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,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:03,410 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:03,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:40:03,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:40:03,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash 454580555, now seen corresponding path program 1 times [2025-01-09 21:40:03,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:03,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37100699] [2025-01-09 21:40:03,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:03,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:40:03,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:40:03,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:03,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:03,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:40:03,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:40:03,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:40:03,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:03,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:03,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:40:03,536 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:40:03,536 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 59 remaining) [2025-01-09 21:40:03,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (57 of 59 remaining) [2025-01-09 21:40:03,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (56 of 59 remaining) [2025-01-09 21:40:03,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (55 of 59 remaining) [2025-01-09 21:40:03,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (54 of 59 remaining) [2025-01-09 21:40:03,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (53 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (52 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (51 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (50 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (49 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (48 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (47 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (46 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (45 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (44 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (43 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (42 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (41 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (40 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (39 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (38 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (37 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (36 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (35 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (34 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (33 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (32 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (31 of 59 remaining) [2025-01-09 21:40:03,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (30 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (29 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (28 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (27 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (26 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (25 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (24 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (23 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (22 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (21 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (20 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (19 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (18 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (17 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (16 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (15 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5ASSERT_VIOLATIONDATA_RACE (14 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6ASSERT_VIOLATIONDATA_RACE (13 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7ASSERT_VIOLATIONDATA_RACE (12 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8ASSERT_VIOLATIONDATA_RACE (11 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9ASSERT_VIOLATIONDATA_RACE (10 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (9 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (8 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (7 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (6 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (5 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5ASSERT_VIOLATIONDATA_RACE (4 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6ASSERT_VIOLATIONDATA_RACE (3 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7ASSERT_VIOLATIONDATA_RACE (2 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8ASSERT_VIOLATIONDATA_RACE (1 of 59 remaining) [2025-01-09 21:40:03,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9ASSERT_VIOLATIONDATA_RACE (0 of 59 remaining) [2025-01-09 21:40:03,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:40:03,545 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:03,548 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:40:03,549 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:40:03,671 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:40:03,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1153 places, 1219 transitions, 2454 flow [2025-01-09 21:40:04,467 INFO L124 PetriNetUnfolderBase]: 225/3201 cut-off events. [2025-01-09 21:40:04,468 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:40:04,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3213 conditions, 3201 events. 225/3201 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 16445 event pairs, 0 based on Foata normal form. 0/2819 useless extension candidates. Maximal degree in co-relation 1718. Up to 12 conditions per place. [2025-01-09 21:40:04,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 1153 places, 1219 transitions, 2454 flow [2025-01-09 21:40:04,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1153 places, 1219 transitions, 2454 flow [2025-01-09 21:40:04,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:04,543 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;@102cd0ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:04,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-01-09 21:40:04,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:04,546 INFO L124 PetriNetUnfolderBase]: 8/64 cut-off events. [2025-01-09 21:40:04,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:04,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:04,546 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] [2025-01-09 21:40:04,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-01-09 21:40:04,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1014586501, now seen corresponding path program 1 times [2025-01-09 21:40:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:04,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735101576] [2025-01-09 21:40:04,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:04,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:04,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:40:04,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:40:04,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:04,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:04,561 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:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735101576] [2025-01-09 21:40:04,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735101576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:04,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:04,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:04,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24316032] [2025-01-09 21:40:04,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:04,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:40:04,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:04,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:40:04,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:40:04,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1107 out of 1219 [2025-01-09 21:40:04,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1153 places, 1219 transitions, 2454 flow. Second operand has 2 states, 2 states have (on average 1108.0) internal successors, (2216), 2 states have internal predecessors, (2216), 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:04,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:04,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1107 of 1219 [2025-01-09 21:40:04,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:09,491 INFO L124 PetriNetUnfolderBase]: 971/22381 cut-off events. [2025-01-09 21:40:09,492 INFO L125 PetriNetUnfolderBase]: For 58/61 co-relation queries the response was YES. [2025-01-09 21:40:09,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23584 conditions, 22381 events. 971/22381 cut-off events. For 58/61 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 256854 event pairs, 652 based on Foata normal form. 1580/22860 useless extension candidates. Maximal degree in co-relation 6445. Up to 1171 conditions per place. [2025-01-09 21:40:09,705 INFO L140 encePairwiseOnDemand]: 1136/1219 looper letters, 29 selfloop transitions, 0 changer transitions 6/1122 dead transitions. [2025-01-09 21:40:09,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1110 places, 1122 transitions, 2318 flow [2025-01-09 21:40:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:40:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:40:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2326 transitions. [2025-01-09 21:40:09,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540607054963085 [2025-01-09 21:40:09,710 INFO L175 Difference]: Start difference. First operand has 1153 places, 1219 transitions, 2454 flow. Second operand 2 states and 2326 transitions. [2025-01-09 21:40:09,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1110 places, 1122 transitions, 2318 flow [2025-01-09 21:40:09,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1110 places, 1122 transitions, 2318 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:40:09,725 INFO L231 Difference]: Finished difference. Result has 1110 places, 1116 transitions, 2248 flow [2025-01-09 21:40:09,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1219, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=1109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2248, PETRI_PLACES=1110, PETRI_TRANSITIONS=1116} [2025-01-09 21:40:09,727 INFO L279 CegarLoopForPetriNet]: 1153 programPoint places, -43 predicate places. [2025-01-09 21:40:09,727 INFO L471 AbstractCegarLoop]: Abstraction has has 1110 places, 1116 transitions, 2248 flow [2025-01-09 21:40:09,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1108.0) internal successors, (2216), 2 states have internal predecessors, (2216), 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:09,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:09,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:09,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:40:09,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2025-01-09 21:40:09,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1842926827, now seen corresponding path program 1 times [2025-01-09 21:40:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:09,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986176490] [2025-01-09 21:40:09,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:09,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:40:09,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:40:09,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:09,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:09,925 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:09,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986176490] [2025-01-09 21:40:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986176490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:09,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:09,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:40:09,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490475175] [2025-01-09 21:40:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:09,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:40:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:09,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:40:09,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:40:10,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 992 out of 1219 [2025-01-09 21:40:10,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1110 places, 1116 transitions, 2248 flow. Second operand has 6 states, 6 states have (on average 993.3333333333334) internal successors, (5960), 6 states have internal predecessors, (5960), 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:10,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:10,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 992 of 1219 [2025-01-09 21:40:10,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand