./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/hclhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/hclhlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:01:22,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:01:22,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 07:01:22,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:01:22,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:01:22,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:01:22,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:01:22,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:01:22,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:01:22,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:01:22,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:01:22,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:01:22,234 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:01:22,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:01:22,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:01:22,234 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:01:22,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:01:22,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:01:22,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:01:22,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:01:22,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:01:22,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:01:22,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:01:22,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:01:22,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:01:22,236 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-03-04 07:01:22,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:01:22,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:01:22,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:01:22,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:01:22,459 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:01:22,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-03-04 07:01:23,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07eae43a0/507043cb5f28416db957ea9f0ebc457e/FLAG8321d3ff7 [2025-03-04 07:01:24,034 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:01:24,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-03-04 07:01:24,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07eae43a0/507043cb5f28416db957ea9f0ebc457e/FLAG8321d3ff7 [2025-03-04 07:01:24,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07eae43a0/507043cb5f28416db957ea9f0ebc457e [2025-03-04 07:01:24,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:01:24,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:01:24,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:01:24,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:01:24,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:01:24,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:01:24" (1/1) ... [2025-03-04 07:01:24,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff4f53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:24, skipping insertion in model container [2025-03-04 07:01:24,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:01:24" (1/1) ... [2025-03-04 07:01:24,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:01:26,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:01:26,316 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:01:26,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-04 07:01:26,411 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-04 07:01:26,412 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-04 07:01:26,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-04 07:01:26,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-04 07:01:26,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-04 07:01:26,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-04 07:01:26,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-04 07:01:26,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-04 07:01:26,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-04 07:01:26,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-04 07:01:26,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-04 07:01:26,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-04 07:01:26,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-04 07:01:26,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-04 07:01:26,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-04 07:01:26,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-04 07:01:26,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-04 07:01:26,420 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-04 07:01:26,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-04 07:01:26,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-04 07:01:26,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-04 07:01:26,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-04 07:01:26,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-04 07:01:26,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-04 07:01:26,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-04 07:01:26,422 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-04 07:01:26,423 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-04 07:01:26,423 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-04 07:01:26,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-04 07:01:26,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-04 07:01:26,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-04 07:01:26,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-04 07:01:26,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-04 07:01:26,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-04 07:01:26,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-04 07:01:26,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-04 07:01:26,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-04 07:01:26,430 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-04 07:01:26,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-04 07:01:26,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-04 07:01:26,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-04 07:01:26,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-04 07:01:26,433 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-04 07:01:26,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-04 07:01:26,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-04 07:01:26,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-04 07:01:26,436 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-04 07:01:26,436 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-04 07:01:26,436 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-04 07:01:26,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-04 07:01:26,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-04 07:01:26,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-04 07:01:26,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-04 07:01:26,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-04 07:01:26,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-04 07:01:26,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-04 07:01:26,441 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-04 07:01:26,441 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-04 07:01:26,442 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-04 07:01:26,442 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-04 07:01:26,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-04 07:01:26,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-04 07:01:26,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-04 07:01:26,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-04 07:01:26,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-04 07:01:26,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-04 07:01:26,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-04 07:01:26,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-04 07:01:26,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-04 07:01:26,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-04 07:01:26,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-04 07:01:26,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-04 07:01:26,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-04 07:01:26,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-04 07:01:26,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-04 07:01:26,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-04 07:01:26,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-04 07:01:26,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-04 07:01:26,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-04 07:01:26,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-04 07:01:26,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-04 07:01:26,457 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-04 07:01:26,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-04 07:01:26,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-04 07:01:26,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-04 07:01:26,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-04 07:01:26,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-04 07:01:26,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-04 07:01:26,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-04 07:01:26,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-04 07:01:26,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-04 07:01:26,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-04 07:01:26,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-04 07:01:26,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-04 07:01:26,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-04 07:01:26,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-04 07:01:26,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-04 07:01:26,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-04 07:01:26,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-04 07:01:26,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:01:26,759 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:01:26,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26 WrapperNode [2025-03-04 07:01:26,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:01:26,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:01:26,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:01:26,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:01:26,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,877 INFO L138 Inliner]: procedures = 921, calls = 972, calls flagged for inlining = 848, calls inlined = 84, statements flattened = 1082 [2025-03-04 07:01:26,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:01:26,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:01:26,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:01:26,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:01:26,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:01:26,935 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:01:26,935 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:01:26,935 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:01:26,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (1/1) ... [2025-03-04 07:01:26,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:01:26,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:01:26,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:01:26,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:01:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 07:01:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:01:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 07:01:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:01:26,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:01:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-04 07:01:26,986 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-04 07:01:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:01:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 07:01:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 07:01:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:01:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 07:01:26,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 07:01:26,988 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 07:01:27,127 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:01:27,129 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:01:27,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-04 07:01:27,564 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-04 07:01:28,301 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 07:01:28,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 07:01:28,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 07:01:28,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-27: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-04 07:01:28,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-04 07:01:28,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-9: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-04 07:01:28,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-04 07:01:28,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-9: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-04 07:01:28,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-04 07:01:28,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-04 07:01:28,303 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 07:01:28,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:01:28,516 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:01:28,516 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:01:28,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:01:28 BoogieIcfgContainer [2025-03-04 07:01:28,517 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:01:28,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:01:28,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:01:28,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:01:28,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:01:24" (1/3) ... [2025-03-04 07:01:28,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7043a4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:01:28, skipping insertion in model container [2025-03-04 07:01:28,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:01:26" (2/3) ... [2025-03-04 07:01:28,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7043a4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:01:28, skipping insertion in model container [2025-03-04 07:01:28,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:01:28" (3/3) ... [2025-03-04 07:01:28,524 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-03-04 07:01:28,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:01:28,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 1057 locations, 1 initial locations, 42 loop locations, and 42 error locations. [2025-03-04 07:01:28,538 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 07:01:28,789 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 07:01:28,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1060 places, 1226 transitions, 2459 flow [2025-03-04 07:01:29,122 INFO L124 PetriNetUnfolderBase]: 183/1302 cut-off events. [2025-03-04 07:01:29,126 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 07:01:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 1302 events. 183/1302 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4403 event pairs, 0 based on Foata normal form. 0/1069 useless extension candidates. Maximal degree in co-relation 987. Up to 8 conditions per place. [2025-03-04 07:01:29,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 1060 places, 1226 transitions, 2459 flow [2025-03-04 07:01:29,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1060 places, 1226 transitions, 2459 flow [2025-03-04 07:01:29,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:01:29,195 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;@5a0775fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:01:29,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-04 07:01:29,205 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 07:01:29,205 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-03-04 07:01:29,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:01:29,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:29,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:29,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:29,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash 994676861, now seen corresponding path program 1 times [2025-03-04 07:01:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390661515] [2025-03-04 07:01:29,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:29,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:01:29,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:01:29,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:01:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390661515] [2025-03-04 07:01:29,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390661515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:29,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:01:29,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201420972] [2025-03-04 07:01:29,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:29,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:01:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:29,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:01:29,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:01:29,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1040 out of 1226 [2025-03-04 07:01:29,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1060 places, 1226 transitions, 2459 flow. Second operand has 2 states, 2 states have (on average 1040.5) internal successors, (2081), 2 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:29,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:29,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1040 of 1226 [2025-03-04 07:01:29,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:30,035 INFO L124 PetriNetUnfolderBase]: 33/1090 cut-off events. [2025-03-04 07:01:30,036 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 07:01:30,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 1090 events. 33/1090 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2901 event pairs, 0 based on Foata normal form. 272/1281 useless extension candidates. Maximal degree in co-relation 850. Up to 30 conditions per place. [2025-03-04 07:01:30,051 INFO L140 encePairwiseOnDemand]: 1069/1226 looper letters, 29 selfloop transitions, 0 changer transitions 12/1032 dead transitions. [2025-03-04 07:01:30,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1032 transitions, 2129 flow [2025-03-04 07:01:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:01:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 07:01:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2266 transitions. [2025-03-04 07:01:30,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241435562805873 [2025-03-04 07:01:30,074 INFO L175 Difference]: Start difference. First operand has 1060 places, 1226 transitions, 2459 flow. Second operand 2 states and 2266 transitions. [2025-03-04 07:01:30,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1032 transitions, 2129 flow [2025-03-04 07:01:30,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1003 places, 1032 transitions, 2129 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:01:30,102 INFO L231 Difference]: Finished difference. Result has 1003 places, 1020 transitions, 2047 flow [2025-03-04 07:01:30,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1032, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2047, PETRI_PLACES=1003, PETRI_TRANSITIONS=1020} [2025-03-04 07:01:30,109 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -57 predicate places. [2025-03-04 07:01:30,109 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 1020 transitions, 2047 flow [2025-03-04 07:01:30,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1040.5) internal successors, (2081), 2 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:30,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:30,111 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] [2025-03-04 07:01:30,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:01:30,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:30,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:30,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1830898718, now seen corresponding path program 1 times [2025-03-04 07:01:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:30,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20706047] [2025-03-04 07:01:30,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:30,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 07:01:30,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 07:01:30,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:30,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:01:30,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:30,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20706047] [2025-03-04 07:01:30,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20706047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:30,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:30,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:01:30,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350641711] [2025-03-04 07:01:30,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:30,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:30,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:30,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:30,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:30,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1034 out of 1226 [2025-03-04 07:01:30,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1020 transitions, 2047 flow. Second operand has 3 states, 3 states have (on average 1036.3333333333333) internal successors, (3109), 3 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:30,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:30,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1034 of 1226 [2025-03-04 07:01:30,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:30,540 INFO L124 PetriNetUnfolderBase]: 33/1096 cut-off events. [2025-03-04 07:01:30,541 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 07:01:30,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 1096 events. 33/1096 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2823 event pairs, 0 based on Foata normal form. 1/1021 useless extension candidates. Maximal degree in co-relation 1136. Up to 33 conditions per place. [2025-03-04 07:01:30,550 INFO L140 encePairwiseOnDemand]: 1223/1226 looper letters, 35 selfloop transitions, 2 changer transitions 0/1022 dead transitions. [2025-03-04 07:01:30,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1022 transitions, 2125 flow [2025-03-04 07:01:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3140 transitions. [2025-03-04 07:01:30,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8537248504622077 [2025-03-04 07:01:30,560 INFO L175 Difference]: Start difference. First operand has 1003 places, 1020 transitions, 2047 flow. Second operand 3 states and 3140 transitions. [2025-03-04 07:01:30,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1022 transitions, 2125 flow [2025-03-04 07:01:30,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1022 transitions, 2125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:01:30,579 INFO L231 Difference]: Finished difference. Result has 994 places, 1021 transitions, 2059 flow [2025-03-04 07:01:30,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2059, PETRI_PLACES=994, PETRI_TRANSITIONS=1021} [2025-03-04 07:01:30,582 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -66 predicate places. [2025-03-04 07:01:30,582 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1021 transitions, 2059 flow [2025-03-04 07:01:30,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1036.3333333333333) internal successors, (3109), 3 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:30,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:30,585 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] [2025-03-04 07:01:30,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:01:30,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:30,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash 501591966, now seen corresponding path program 1 times [2025-03-04 07:01:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:30,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225353328] [2025-03-04 07:01:30,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:30,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:30,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 07:01:30,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 07:01:30,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:30,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:01:30,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:30,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225353328] [2025-03-04 07:01:30,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225353328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:30,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364035194] [2025-03-04 07:01:30,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:30,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:30,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:01:30,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:01:30,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:01:30,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 07:01:31,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 07:01:31,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:31,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:31,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:01:31,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:01:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:01:31,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:01:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:01:31,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364035194] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:31,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:01:31,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-03-04 07:01:31,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472530703] [2025-03-04 07:01:31,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:31,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:31,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:31,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:01:31,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1033 out of 1226 [2025-03-04 07:01:31,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1021 transitions, 2059 flow. Second operand has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:31,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:31,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1033 of 1226 [2025-03-04 07:01:31,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:31,333 INFO L124 PetriNetUnfolderBase]: 33/1097 cut-off events. [2025-03-04 07:01:31,333 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 07:01:31,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 1097 events. 33/1097 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2377 event pairs, 0 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1143. Up to 33 conditions per place. [2025-03-04 07:01:31,341 INFO L140 encePairwiseOnDemand]: 1222/1226 looper letters, 34 selfloop transitions, 3 changer transitions 0/1022 dead transitions. [2025-03-04 07:01:31,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1022 transitions, 2135 flow [2025-03-04 07:01:31,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3137 transitions. [2025-03-04 07:01:31,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8529091897770528 [2025-03-04 07:01:31,349 INFO L175 Difference]: Start difference. First operand has 994 places, 1021 transitions, 2059 flow. Second operand 3 states and 3137 transitions. [2025-03-04 07:01:31,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1022 transitions, 2135 flow [2025-03-04 07:01:31,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 1022 transitions, 2133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 07:01:31,366 INFO L231 Difference]: Finished difference. Result has 997 places, 1022 transitions, 2075 flow [2025-03-04 07:01:31,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2075, PETRI_PLACES=997, PETRI_TRANSITIONS=1022} [2025-03-04 07:01:31,369 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -63 predicate places. [2025-03-04 07:01:31,369 INFO L471 AbstractCegarLoop]: Abstraction has has 997 places, 1022 transitions, 2075 flow [2025-03-04 07:01:31,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:31,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:31,372 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-03-04 07:01:31,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:01:31,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:31,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1594463537, now seen corresponding path program 1 times [2025-03-04 07:01:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:31,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343641923] [2025-03-04 07:01:31,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:31,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 07:01:31,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 07:01:31,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:31,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:01:31,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343641923] [2025-03-04 07:01:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343641923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61917321] [2025-03-04 07:01:31,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:31,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:31,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:01:31,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:01:31,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:01:31,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 07:01:31,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 07:01:31,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:31,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:31,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:01:31,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:01:31,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:01:31,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 07:01:32,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:01:32,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-04 07:01:32,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:01:32,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-04 07:01:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:01:32,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:01:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61917321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:01:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 07:01:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876082881] [2025-03-04 07:01:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:32,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:01:32,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:32,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:01:32,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:01:32,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1226 [2025-03-04 07:01:32,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 1022 transitions, 2075 flow. Second operand has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:32,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:32,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1226 [2025-03-04 07:01:32,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:33,832 INFO L124 PetriNetUnfolderBase]: 690/7587 cut-off events. [2025-03-04 07:01:33,832 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 07:01:33,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8643 conditions, 7587 events. 690/7587 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 64266 event pairs, 432 based on Foata normal form. 0/7077 useless extension candidates. Maximal degree in co-relation 8636. Up to 1029 conditions per place. [2025-03-04 07:01:33,861 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 82 selfloop transitions, 5 changer transitions 0/1021 dead transitions. [2025-03-04 07:01:33,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1021 transitions, 2247 flow [2025-03-04 07:01:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:01:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 07:01:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5974 transitions. [2025-03-04 07:01:33,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.812126155519304 [2025-03-04 07:01:33,871 INFO L175 Difference]: Start difference. First operand has 997 places, 1022 transitions, 2075 flow. Second operand 6 states and 5974 transitions. [2025-03-04 07:01:33,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1021 transitions, 2247 flow [2025-03-04 07:01:33,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1021 transitions, 2241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:33,882 INFO L231 Difference]: Finished difference. Result has 999 places, 1021 transitions, 2077 flow [2025-03-04 07:01:33,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2077, PETRI_PLACES=999, PETRI_TRANSITIONS=1021} [2025-03-04 07:01:33,884 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -61 predicate places. [2025-03-04 07:01:33,884 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1021 transitions, 2077 flow [2025-03-04 07:01:33,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:33,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:33,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:33,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:01:34,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 07:01:34,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:34,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1148168657, now seen corresponding path program 1 times [2025-03-04 07:01:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090697598] [2025-03-04 07:01:34,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:34,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:34,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 07:01:34,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 07:01:34,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:34,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:01:34,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090697598] [2025-03-04 07:01:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090697598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990725015] [2025-03-04 07:01:34,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:34,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:34,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:01:34,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:01:34,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:01:34,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 07:01:34,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 07:01:34,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:34,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:34,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:01:34,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:01:34,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:01:34,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:01:34,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:01:34,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 07:01:34,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:01:34,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 07:01:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:01:34,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:01:34,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990725015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:34,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:01:34,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 07:01:34,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279037725] [2025-03-04 07:01:34,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:34,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:01:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:34,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:01:34,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:01:34,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1226 [2025-03-04 07:01:34,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1021 transitions, 2077 flow. Second operand has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:34,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:34,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1226 [2025-03-04 07:01:34,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:35,742 INFO L124 PetriNetUnfolderBase]: 690/7586 cut-off events. [2025-03-04 07:01:35,743 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 07:01:35,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8644 conditions, 7586 events. 690/7586 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 64149 event pairs, 432 based on Foata normal form. 0/7076 useless extension candidates. Maximal degree in co-relation 8637. Up to 1029 conditions per place. [2025-03-04 07:01:35,773 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 82 selfloop transitions, 5 changer transitions 0/1020 dead transitions. [2025-03-04 07:01:35,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1020 transitions, 2249 flow [2025-03-04 07:01:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:01:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 07:01:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5974 transitions. [2025-03-04 07:01:35,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.812126155519304 [2025-03-04 07:01:35,784 INFO L175 Difference]: Start difference. First operand has 999 places, 1021 transitions, 2077 flow. Second operand 6 states and 5974 transitions. [2025-03-04 07:01:35,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1020 transitions, 2249 flow [2025-03-04 07:01:35,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1020 transitions, 2239 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 07:01:35,796 INFO L231 Difference]: Finished difference. Result has 998 places, 1020 transitions, 2075 flow [2025-03-04 07:01:35,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2075, PETRI_PLACES=998, PETRI_TRANSITIONS=1020} [2025-03-04 07:01:35,798 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -62 predicate places. [2025-03-04 07:01:35,799 INFO L471 AbstractCegarLoop]: Abstraction has has 998 places, 1020 transitions, 2075 flow [2025-03-04 07:01:35,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:35,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:35,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:35,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:01:36,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:36,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:36,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:36,004 INFO L85 PathProgramCache]: Analyzing trace with hash 209652502, now seen corresponding path program 1 times [2025-03-04 07:01:36,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:36,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515675414] [2025-03-04 07:01:36,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:36,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:36,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 07:01:36,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 07:01:36,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:36,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:01:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:36,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515675414] [2025-03-04 07:01:36,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515675414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:36,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963055611] [2025-03-04 07:01:36,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:36,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:36,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:01:36,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:01:36,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:01:36,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 07:01:36,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 07:01:36,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:36,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:36,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 07:01:36,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:01:37,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:01:37,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:01:37,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:01:37,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 07:01:37,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:01:37,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-04 07:01:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:01:37,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:01:37,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2025-03-04 07:01:37,711 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2025-03-04 07:01:37,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 1 [2025-03-04 07:01:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:01:37,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963055611] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:37,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:01:37,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 19] total 27 [2025-03-04 07:01:37,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74601059] [2025-03-04 07:01:37,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:37,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:01:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:37,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:01:37,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:01:38,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 973 out of 1226 [2025-03-04 07:01:38,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1020 transitions, 2075 flow. Second operand has 6 states, 6 states have (on average 976.5) internal successors, (5859), 6 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:38,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:38,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 973 of 1226 [2025-03-04 07:01:38,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:41,070 INFO L124 PetriNetUnfolderBase]: 1645/15129 cut-off events. [2025-03-04 07:01:41,070 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 07:01:41,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17727 conditions, 15129 events. 1645/15129 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 154556 event pairs, 545 based on Foata normal form. 0/14042 useless extension candidates. Maximal degree in co-relation 17720. Up to 2161 conditions per place. [2025-03-04 07:01:41,162 INFO L140 encePairwiseOnDemand]: 1165/1226 looper letters, 123 selfloop transitions, 222 changer transitions 0/1269 dead transitions. [2025-03-04 07:01:41,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1269 transitions, 3263 flow [2025-03-04 07:01:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:01:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 07:01:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6184 transitions. [2025-03-04 07:01:41,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8406742794997281 [2025-03-04 07:01:41,173 INFO L175 Difference]: Start difference. First operand has 998 places, 1020 transitions, 2075 flow. Second operand 6 states and 6184 transitions. [2025-03-04 07:01:41,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1269 transitions, 3263 flow [2025-03-04 07:01:41,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1269 transitions, 3253 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 07:01:41,188 INFO L231 Difference]: Finished difference. Result has 1003 places, 1241 transitions, 3515 flow [2025-03-04 07:01:41,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3515, PETRI_PLACES=1003, PETRI_TRANSITIONS=1241} [2025-03-04 07:01:41,190 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -57 predicate places. [2025-03-04 07:01:41,190 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 1241 transitions, 3515 flow [2025-03-04 07:01:41,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 976.5) internal successors, (5859), 6 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:41,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:41,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:41,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:01:41,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:41,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:41,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1691953310, now seen corresponding path program 1 times [2025-03-04 07:01:41,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:41,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373758609] [2025-03-04 07:01:41,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:41,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:41,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 07:01:41,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 07:01:41,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:41,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:01:41,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:41,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373758609] [2025-03-04 07:01:41,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373758609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:41,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:41,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:41,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022604629] [2025-03-04 07:01:41,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:41,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:41,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:41,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:41,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:41,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1030 out of 1226 [2025-03-04 07:01:41,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1241 transitions, 3515 flow. Second operand has 3 states, 3 states have (on average 1032.0) internal successors, (3096), 3 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:41,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:41,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1030 of 1226 [2025-03-04 07:01:41,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:43,159 INFO L124 PetriNetUnfolderBase]: 889/10500 cut-off events. [2025-03-04 07:01:43,159 INFO L125 PetriNetUnfolderBase]: For 811/1149 co-relation queries the response was YES. [2025-03-04 07:01:43,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13153 conditions, 10500 events. 889/10500 cut-off events. For 811/1149 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 87007 event pairs, 55 based on Foata normal form. 43/9705 useless extension candidates. Maximal degree in co-relation 13142. Up to 1000 conditions per place. [2025-03-04 07:01:43,196 INFO L140 encePairwiseOnDemand]: 1217/1226 looper letters, 114 selfloop transitions, 6 changer transitions 0/1266 dead transitions. [2025-03-04 07:01:43,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1004 places, 1266 transitions, 3833 flow [2025-03-04 07:01:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3157 transitions. [2025-03-04 07:01:43,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.858346927678086 [2025-03-04 07:01:43,201 INFO L175 Difference]: Start difference. First operand has 1003 places, 1241 transitions, 3515 flow. Second operand 3 states and 3157 transitions. [2025-03-04 07:01:43,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1004 places, 1266 transitions, 3833 flow [2025-03-04 07:01:43,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 1266 transitions, 3833 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:01:43,230 INFO L231 Difference]: Finished difference. Result has 1006 places, 1245 transitions, 3561 flow [2025-03-04 07:01:43,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3513, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3561, PETRI_PLACES=1006, PETRI_TRANSITIONS=1245} [2025-03-04 07:01:43,234 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -54 predicate places. [2025-03-04 07:01:43,234 INFO L471 AbstractCegarLoop]: Abstraction has has 1006 places, 1245 transitions, 3561 flow [2025-03-04 07:01:43,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1032.0) internal successors, (3096), 3 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:43,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:43,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:43,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:01:43,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:43,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:43,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1825544064, now seen corresponding path program 1 times [2025-03-04 07:01:43,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:43,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233497730] [2025-03-04 07:01:43,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:43,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 07:01:43,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 07:01:43,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:43,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:01:43,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:43,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233497730] [2025-03-04 07:01:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233497730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:43,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209165034] [2025-03-04 07:01:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:43,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:43,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:43,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:43,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1033 out of 1226 [2025-03-04 07:01:43,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1245 transitions, 3561 flow. Second operand has 3 states, 3 states have (on average 1035.0) internal successors, (3105), 3 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:43,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:43,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1033 of 1226 [2025-03-04 07:01:43,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:45,396 INFO L124 PetriNetUnfolderBase]: 1043/13791 cut-off events. [2025-03-04 07:01:45,397 INFO L125 PetriNetUnfolderBase]: For 925/1173 co-relation queries the response was YES. [2025-03-04 07:01:45,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16961 conditions, 13791 events. 1043/13791 cut-off events. For 925/1173 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 120764 event pairs, 53 based on Foata normal form. 43/12803 useless extension candidates. Maximal degree in co-relation 16948. Up to 1222 conditions per place. [2025-03-04 07:01:45,446 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 111 selfloop transitions, 4 changer transitions 0/1268 dead transitions. [2025-03-04 07:01:45,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1268 transitions, 3865 flow [2025-03-04 07:01:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3160 transitions. [2025-03-04 07:01:45,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8591625883632409 [2025-03-04 07:01:45,451 INFO L175 Difference]: Start difference. First operand has 1006 places, 1245 transitions, 3561 flow. Second operand 3 states and 3160 transitions. [2025-03-04 07:01:45,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1268 transitions, 3865 flow [2025-03-04 07:01:45,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1268 transitions, 3853 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:45,470 INFO L231 Difference]: Finished difference. Result has 1007 places, 1247 transitions, 3577 flow [2025-03-04 07:01:45,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3547, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3577, PETRI_PLACES=1007, PETRI_TRANSITIONS=1247} [2025-03-04 07:01:45,472 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -53 predicate places. [2025-03-04 07:01:45,472 INFO L471 AbstractCegarLoop]: Abstraction has has 1007 places, 1247 transitions, 3577 flow [2025-03-04 07:01:45,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.0) internal successors, (3105), 3 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:45,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:45,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:45,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:01:45,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:45,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:45,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1006388211, now seen corresponding path program 1 times [2025-03-04 07:01:45,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:45,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138545592] [2025-03-04 07:01:45,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:45,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:45,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 07:01:45,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 07:01:45,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:45,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:01:45,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:45,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138545592] [2025-03-04 07:01:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138545592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:45,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418377001] [2025-03-04 07:01:45,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:45,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:45,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:01:45,641 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:01:45,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:01:45,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 07:01:46,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 07:01:46,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:46,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:46,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:01:46,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:01:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:01:46,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:01:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:01:46,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418377001] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:46,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:01:46,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-03-04 07:01:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335484349] [2025-03-04 07:01:46,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:46,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:46,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:46,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:46,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:01:46,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1033 out of 1226 [2025-03-04 07:01:46,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 1247 transitions, 3577 flow. Second operand has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:46,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:46,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1033 of 1226 [2025-03-04 07:01:46,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:48,243 INFO L124 PetriNetUnfolderBase]: 1096/14601 cut-off events. [2025-03-04 07:01:48,243 INFO L125 PetriNetUnfolderBase]: For 1060/1509 co-relation queries the response was YES. [2025-03-04 07:01:48,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18054 conditions, 14601 events. 1096/14601 cut-off events. For 1060/1509 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 131216 event pairs, 73 based on Foata normal form. 47/13533 useless extension candidates. Maximal degree in co-relation 18040. Up to 1300 conditions per place. [2025-03-04 07:01:48,293 INFO L140 encePairwiseOnDemand]: 1222/1226 looper letters, 111 selfloop transitions, 3 changer transitions 0/1269 dead transitions. [2025-03-04 07:01:48,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1269 transitions, 3877 flow [2025-03-04 07:01:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3158 transitions. [2025-03-04 07:01:48,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8586188145731376 [2025-03-04 07:01:48,297 INFO L175 Difference]: Start difference. First operand has 1007 places, 1247 transitions, 3577 flow. Second operand 3 states and 3158 transitions. [2025-03-04 07:01:48,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 1269 transitions, 3877 flow [2025-03-04 07:01:48,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 1269 transitions, 3869 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:48,325 INFO L231 Difference]: Finished difference. Result has 1009 places, 1248 transitions, 3587 flow [2025-03-04 07:01:48,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3569, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3587, PETRI_PLACES=1009, PETRI_TRANSITIONS=1248} [2025-03-04 07:01:48,327 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -51 predicate places. [2025-03-04 07:01:48,327 INFO L471 AbstractCegarLoop]: Abstraction has has 1009 places, 1248 transitions, 3587 flow [2025-03-04 07:01:48,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:48,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:48,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:48,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:01:48,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:48,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:48,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1966189418, now seen corresponding path program 1 times [2025-03-04 07:01:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:48,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912115005] [2025-03-04 07:01:48,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:48,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 07:01:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 07:01:48,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:48,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:01:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:48,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912115005] [2025-03-04 07:01:48,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912115005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:48,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022786538] [2025-03-04 07:01:48,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:48,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:48,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:01:48,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:01:48,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:01:48,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 07:01:48,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 07:01:48,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:48,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:48,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:01:48,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:01:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:01:49,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:01:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:01:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022786538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:01:49,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:01:49,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 07:01:49,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391210880] [2025-03-04 07:01:49,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:01:49,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:01:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:49,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:01:49,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:01:49,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1023 out of 1226 [2025-03-04 07:01:49,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1248 transitions, 3587 flow. Second operand has 11 states, 11 states have (on average 1026.909090909091) internal successors, (11296), 11 states have internal predecessors, (11296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:49,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:49,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1023 of 1226 [2025-03-04 07:01:49,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:52,610 INFO L124 PetriNetUnfolderBase]: 831/12722 cut-off events. [2025-03-04 07:01:52,611 INFO L125 PetriNetUnfolderBase]: For 760/882 co-relation queries the response was YES. [2025-03-04 07:01:52,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15376 conditions, 12722 events. 831/12722 cut-off events. For 760/882 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 106645 event pairs, 12 based on Foata normal form. 1/11896 useless extension candidates. Maximal degree in co-relation 15361. Up to 1096 conditions per place. [2025-03-04 07:01:52,695 INFO L140 encePairwiseOnDemand]: 1215/1226 looper letters, 110 selfloop transitions, 14 changer transitions 0/1268 dead transitions. [2025-03-04 07:01:52,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1268 transitions, 3885 flow [2025-03-04 07:01:52,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:01:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 07:01:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13370 transitions. [2025-03-04 07:01:52,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388756431170786 [2025-03-04 07:01:52,710 INFO L175 Difference]: Start difference. First operand has 1009 places, 1248 transitions, 3587 flow. Second operand 13 states and 13370 transitions. [2025-03-04 07:01:52,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1268 transitions, 3885 flow [2025-03-04 07:01:52,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1268 transitions, 3879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:52,757 INFO L231 Difference]: Finished difference. Result has 1025 places, 1258 transitions, 3671 flow [2025-03-04 07:01:52,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3581, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3671, PETRI_PLACES=1025, PETRI_TRANSITIONS=1258} [2025-03-04 07:01:52,764 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -35 predicate places. [2025-03-04 07:01:52,764 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1258 transitions, 3671 flow [2025-03-04 07:01:52,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1026.909090909091) internal successors, (11296), 11 states have internal predecessors, (11296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:52,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:52,772 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 07:01:52,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:01:52,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:52,976 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:01:52,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash -354777110, now seen corresponding path program 2 times [2025-03-04 07:01:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:52,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98463186] [2025-03-04 07:01:52,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:01:52,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:53,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 367 statements into 2 equivalence classes. [2025-03-04 07:01:53,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 367 of 367 statements. [2025-03-04 07:01:53,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:01:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 148 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 07:01:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:53,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98463186] [2025-03-04 07:01:53,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98463186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:01:53,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788104776] [2025-03-04 07:01:53,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:01:53,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:01:53,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:01:53,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:01:53,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:01:53,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 367 statements into 2 equivalence classes. [2025-03-04 07:01:54,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 367 of 367 statements. [2025-03-04 07:01:54,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:01:54,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:54,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:01:54,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:01:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 148 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 07:01:54,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:01:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 148 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 07:01:54,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788104776] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:01:54,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:01:54,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-03-04 07:01:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885357119] [2025-03-04 07:01:54,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:01:54,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:01:54,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:54,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:01:54,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:01:56,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1226 [2025-03-04 07:01:56,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1258 transitions, 3671 flow. Second operand has 22 states, 22 states have (on average 1011.7727272727273) internal successors, (22259), 22 states have internal predecessors, (22259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:56,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:56,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1226 [2025-03-04 07:01:56,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:59,879 INFO L124 PetriNetUnfolderBase]: 830/12729 cut-off events. [2025-03-04 07:01:59,879 INFO L125 PetriNetUnfolderBase]: For 774/896 co-relation queries the response was YES. [2025-03-04 07:01:59,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15476 conditions, 12729 events. 830/12729 cut-off events. For 774/896 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 106786 event pairs, 12 based on Foata normal form. 1/11909 useless extension candidates. Maximal degree in co-relation 15456. Up to 1096 conditions per place. [2025-03-04 07:01:59,944 INFO L140 encePairwiseOnDemand]: 1205/1226 looper letters, 155 selfloop transitions, 25 changer transitions 0/1316 dead transitions. [2025-03-04 07:01:59,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1041 places, 1316 transitions, 4147 flow [2025-03-04 07:01:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:01:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 07:01:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17244 transitions. [2025-03-04 07:01:59,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8273678149889646 [2025-03-04 07:01:59,958 INFO L175 Difference]: Start difference. First operand has 1025 places, 1258 transitions, 3671 flow. Second operand 17 states and 17244 transitions. [2025-03-04 07:01:59,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1041 places, 1316 transitions, 4147 flow [2025-03-04 07:01:59,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1040 places, 1316 transitions, 4143 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 07:01:59,979 INFO L231 Difference]: Finished difference. Result has 1049 places, 1280 transitions, 3831 flow [2025-03-04 07:01:59,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3667, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3831, PETRI_PLACES=1049, PETRI_TRANSITIONS=1280} [2025-03-04 07:01:59,981 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -11 predicate places. [2025-03-04 07:01:59,981 INFO L471 AbstractCegarLoop]: Abstraction has has 1049 places, 1280 transitions, 3831 flow [2025-03-04 07:01:59,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1011.7727272727273) internal successors, (22259), 22 states have internal predecessors, (22259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:59,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:59,985 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 07:01:59,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:02:00,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:02:00,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-04 07:02:00,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2039926727, now seen corresponding path program 1 times [2025-03-04 07:02:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443285223] [2025-03-04 07:02:00,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:00,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-04 07:02:00,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-04 07:02:00,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:00,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:02:00,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:02:00,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-04 07:02:00,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-04 07:02:00,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:00,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:02:00,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:02:00,763 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:02:00,764 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 74 remaining) [2025-03-04 07:02:00,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (72 of 74 remaining) [2025-03-04 07:02:00,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (71 of 74 remaining) [2025-03-04 07:02:00,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (70 of 74 remaining) [2025-03-04 07:02:00,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (69 of 74 remaining) [2025-03-04 07:02:00,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (68 of 74 remaining) [2025-03-04 07:02:00,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (67 of 74 remaining) [2025-03-04 07:02:00,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (66 of 74 remaining) [2025-03-04 07:02:00,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (65 of 74 remaining) [2025-03-04 07:02:00,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (64 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (62 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30ASSERT_VIOLATIONDATA_RACE (61 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (60 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (59 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29ASSERT_VIOLATIONDATA_RACE (58 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (57 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28ASSERT_VIOLATIONDATA_RACE (56 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22ASSERT_VIOLATIONDATA_RACE (55 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (54 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONDATA_RACE (53 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26ASSERT_VIOLATIONDATA_RACE (52 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (51 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21ASSERT_VIOLATIONDATA_RACE (50 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (49 of 74 remaining) [2025-03-04 07:02:00,767 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (48 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (47 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (46 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25ASSERT_VIOLATIONDATA_RACE (45 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (44 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (43 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23ASSERT_VIOLATIONDATA_RACE (42 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (41 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONDATA_RACE (40 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (39 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (38 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (37 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (36 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (35 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (34 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (33 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (32 of 74 remaining) [2025-03-04 07:02:00,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (31 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30ASSERT_VIOLATIONDATA_RACE (30 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (29 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (28 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29ASSERT_VIOLATIONDATA_RACE (27 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (26 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28ASSERT_VIOLATIONDATA_RACE (25 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22ASSERT_VIOLATIONDATA_RACE (24 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (23 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONDATA_RACE (22 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26ASSERT_VIOLATIONDATA_RACE (21 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (20 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21ASSERT_VIOLATIONDATA_RACE (19 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (18 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (17 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (16 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (15 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25ASSERT_VIOLATIONDATA_RACE (14 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (13 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (12 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23ASSERT_VIOLATIONDATA_RACE (11 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (10 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONDATA_RACE (9 of 74 remaining) [2025-03-04 07:02:00,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (8 of 74 remaining) [2025-03-04 07:02:00,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (7 of 74 remaining) [2025-03-04 07:02:00,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (6 of 74 remaining) [2025-03-04 07:02:00,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (5 of 74 remaining) [2025-03-04 07:02:00,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (4 of 74 remaining) [2025-03-04 07:02:00,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (3 of 74 remaining) [2025-03-04 07:02:00,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (2 of 74 remaining) [2025-03-04 07:02:00,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (1 of 74 remaining) [2025-03-04 07:02:00,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (0 of 74 remaining) [2025-03-04 07:02:00,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:02:00,770 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:02:00,772 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 07:02:00,775 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 07:02:00,944 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 07:02:00,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1842 places, 2133 transitions, 4282 flow [2025-03-04 07:02:01,719 INFO L124 PetriNetUnfolderBase]: 333/2349 cut-off events. [2025-03-04 07:02:01,719 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 07:02:01,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 2349 events. 333/2349 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 11350 event pairs, 0 based on Foata normal form. 0/1925 useless extension candidates. Maximal degree in co-relation 1946. Up to 12 conditions per place. [2025-03-04 07:02:01,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 1842 places, 2133 transitions, 4282 flow [2025-03-04 07:02:01,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1842 places, 2133 transitions, 4282 flow [2025-03-04 07:02:01,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:02:01,832 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;@5a0775fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:02:01,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-03-04 07:02:01,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 07:02:01,834 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-03-04 07:02:01,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:02:01,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:01,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:02:01,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-03-04 07:02:01,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash 331113021, now seen corresponding path program 1 times [2025-03-04 07:02:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383498347] [2025-03-04 07:02:01,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:01,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:01,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:02:01,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:02:01,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:01,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:01,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:01,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383498347] [2025-03-04 07:02:01,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383498347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:01,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:01,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 07:02:01,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305354829] [2025-03-04 07:02:01,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:01,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:02:01,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:01,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:02:01,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:02:01,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1808 out of 2133 [2025-03-04 07:02:01,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1842 places, 2133 transitions, 4282 flow. Second operand has 2 states, 2 states have (on average 1808.5) internal successors, (3617), 2 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:01,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:01,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1808 of 2133 [2025-03-04 07:02:01,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:07,451 INFO L124 PetriNetUnfolderBase]: 1209/21524 cut-off events. [2025-03-04 07:02:07,452 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-04 07:02:07,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22856 conditions, 21524 events. 1209/21524 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 236839 event pairs, 343 based on Foata normal form. 8147/27839 useless extension candidates. Maximal degree in co-relation 4300. Up to 1212 conditions per place. [2025-03-04 07:02:07,762 INFO L140 encePairwiseOnDemand]: 1860/2133 looper letters, 52 selfloop transitions, 0 changer transitions 12/1799 dead transitions. [2025-03-04 07:02:07,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1744 places, 1799 transitions, 3718 flow [2025-03-04 07:02:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:02:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 07:02:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3941 transitions. [2025-03-04 07:02:07,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9238162212845757 [2025-03-04 07:02:07,766 INFO L175 Difference]: Start difference. First operand has 1842 places, 2133 transitions, 4282 flow. Second operand 2 states and 3941 transitions. [2025-03-04 07:02:07,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1744 places, 1799 transitions, 3718 flow [2025-03-04 07:02:07,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1744 places, 1799 transitions, 3718 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:02:07,785 INFO L231 Difference]: Finished difference. Result has 1744 places, 1787 transitions, 3590 flow [2025-03-04 07:02:07,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=2133, PETRI_DIFFERENCE_MINUEND_FLOW=3614, PETRI_DIFFERENCE_MINUEND_PLACES=1743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=3590, PETRI_PLACES=1744, PETRI_TRANSITIONS=1787} [2025-03-04 07:02:07,787 INFO L279 CegarLoopForPetriNet]: 1842 programPoint places, -98 predicate places. [2025-03-04 07:02:07,787 INFO L471 AbstractCegarLoop]: Abstraction has has 1744 places, 1787 transitions, 3590 flow [2025-03-04 07:02:07,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1808.5) internal successors, (3617), 2 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:07,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:07,789 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] [2025-03-04 07:02:07,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:02:07,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-03-04 07:02:07,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1231061794, now seen corresponding path program 1 times [2025-03-04 07:02:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876155606] [2025-03-04 07:02:07,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:07,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 07:02:07,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 07:02:07,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:07,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876155606] [2025-03-04 07:02:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876155606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:07,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:02:07,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:02:07,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95193793] [2025-03-04 07:02:07,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:07,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:02:07,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:07,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:02:07,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:02:07,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1802 out of 2133 [2025-03-04 07:02:07,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1744 places, 1787 transitions, 3590 flow. Second operand has 3 states, 3 states have (on average 1804.3333333333333) internal successors, (5413), 3 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:07,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:07,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1802 of 2133 [2025-03-04 07:02:07,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:13,430 INFO L124 PetriNetUnfolderBase]: 1209/21530 cut-off events. [2025-03-04 07:02:13,430 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-04 07:02:13,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22871 conditions, 21530 events. 1209/21530 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 236747 event pairs, 343 based on Foata normal form. 1/19704 useless extension candidates. Maximal degree in co-relation 22866. Up to 1215 conditions per place. [2025-03-04 07:02:13,687 INFO L140 encePairwiseOnDemand]: 2130/2133 looper letters, 58 selfloop transitions, 2 changer transitions 0/1789 dead transitions. [2025-03-04 07:02:13,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1734 places, 1789 transitions, 3714 flow [2025-03-04 07:02:13,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:02:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:02:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5467 transitions. [2025-03-04 07:02:13,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8543522425378965 [2025-03-04 07:02:13,692 INFO L175 Difference]: Start difference. First operand has 1744 places, 1787 transitions, 3590 flow. Second operand 3 states and 5467 transitions. [2025-03-04 07:02:13,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1734 places, 1789 transitions, 3714 flow [2025-03-04 07:02:13,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1734 places, 1789 transitions, 3714 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:02:13,715 INFO L231 Difference]: Finished difference. Result has 1735 places, 1788 transitions, 3602 flow [2025-03-04 07:02:13,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=2133, PETRI_DIFFERENCE_MINUEND_FLOW=3590, PETRI_DIFFERENCE_MINUEND_PLACES=1732, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3602, PETRI_PLACES=1735, PETRI_TRANSITIONS=1788} [2025-03-04 07:02:13,716 INFO L279 CegarLoopForPetriNet]: 1842 programPoint places, -107 predicate places. [2025-03-04 07:02:13,717 INFO L471 AbstractCegarLoop]: Abstraction has has 1735 places, 1788 transitions, 3602 flow [2025-03-04 07:02:13,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1804.3333333333333) internal successors, (5413), 3 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:13,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:13,718 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] [2025-03-04 07:02:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:02:13,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-03-04 07:02:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 507937683, now seen corresponding path program 1 times [2025-03-04 07:02:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782335746] [2025-03-04 07:02:13,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:13,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 07:02:13,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 07:02:13,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:13,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782335746] [2025-03-04 07:02:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782335746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:02:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393994604] [2025-03-04 07:02:13,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:13,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:02:13,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:02:13,822 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:02:13,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:02:14,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 07:02:14,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 07:02:14,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:14,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:14,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:02:14,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:02:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:14,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:02:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:02:14,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393994604] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 07:02:14,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:02:14,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-03-04 07:02:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63496548] [2025-03-04 07:02:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:14,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:02:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:14,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:02:14,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:02:14,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1801 out of 2133 [2025-03-04 07:02:14,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1735 places, 1788 transitions, 3602 flow. Second operand has 3 states, 3 states have (on average 1803.6666666666667) internal successors, (5411), 3 states have internal predecessors, (5411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:14,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:14,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1801 of 2133 [2025-03-04 07:02:14,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:02:20,232 INFO L124 PetriNetUnfolderBase]: 1209/21531 cut-off events. [2025-03-04 07:02:20,232 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-03-04 07:02:20,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22880 conditions, 21531 events. 1209/21531 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 236331 event pairs, 343 based on Foata normal form. 0/19704 useless extension candidates. Maximal degree in co-relation 22873. Up to 1215 conditions per place. [2025-03-04 07:02:20,542 INFO L140 encePairwiseOnDemand]: 2129/2133 looper letters, 57 selfloop transitions, 3 changer transitions 0/1789 dead transitions. [2025-03-04 07:02:20,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1737 places, 1789 transitions, 3724 flow [2025-03-04 07:02:20,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:02:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:02:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5464 transitions. [2025-03-04 07:02:20,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8538834192842631 [2025-03-04 07:02:20,546 INFO L175 Difference]: Start difference. First operand has 1735 places, 1788 transitions, 3602 flow. Second operand 3 states and 5464 transitions. [2025-03-04 07:02:20,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1737 places, 1789 transitions, 3724 flow [2025-03-04 07:02:20,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1736 places, 1789 transitions, 3722 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 07:02:20,560 INFO L231 Difference]: Finished difference. Result has 1738 places, 1789 transitions, 3618 flow [2025-03-04 07:02:20,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=2133, PETRI_DIFFERENCE_MINUEND_FLOW=3600, PETRI_DIFFERENCE_MINUEND_PLACES=1734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3618, PETRI_PLACES=1738, PETRI_TRANSITIONS=1789} [2025-03-04 07:02:20,562 INFO L279 CegarLoopForPetriNet]: 1842 programPoint places, -104 predicate places. [2025-03-04 07:02:20,562 INFO L471 AbstractCegarLoop]: Abstraction has has 1738 places, 1789 transitions, 3618 flow [2025-03-04 07:02:20,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1803.6666666666667) internal successors, (5411), 3 states have internal predecessors, (5411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:20,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:02:20,563 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-03-04 07:02:20,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:02:20,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 07:02:20,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-03-04 07:02:20,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:02:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash 164233092, now seen corresponding path program 1 times [2025-03-04 07:02:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:02:20,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989206646] [2025-03-04 07:02:20,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:20,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:02:20,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 07:02:20,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 07:02:20,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:20,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:02:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:02:20,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989206646] [2025-03-04 07:02:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989206646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:02:20,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636427460] [2025-03-04 07:02:20,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:02:20,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:02:20,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:02:20,852 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:02:20,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:02:21,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 07:02:21,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 07:02:21,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:02:21,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:02:21,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:02:21,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:02:21,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:02:21,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 07:02:21,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:02:21,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-04 07:02:21,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:02:21,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-04 07:02:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:02:21,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:02:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636427460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:02:21,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:02:21,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 07:02:21,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077198303] [2025-03-04 07:02:21,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:02:21,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:02:21,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:02:21,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:02:21,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:02:21,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1709 out of 2133 [2025-03-04 07:02:21,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1738 places, 1789 transitions, 3618 flow. Second operand has 6 states, 6 states have (on average 1711.0) internal successors, (10266), 6 states have internal predecessors, (10266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:02:21,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:02:21,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1709 of 2133 [2025-03-04 07:02:21,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand