./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/rwlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/rwlock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd8ac353802a2e1d548b78214c4e90430a3b2551f535af0ed9cab2c49366d321 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:46:40,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:46:40,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:46:40,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:46:40,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:46:40,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:46:40,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:46:40,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:46:40,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:46:40,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:46:40,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:46:40,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:46:40,927 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:46:40,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:46:40,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:46:40,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:46:40,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:46:40,929 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:46:40,929 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:46:40,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:46:40,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:46:40,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:40,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:46:40,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:46:40,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:46:40,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:46:40,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:46:40,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:46:40,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:46:40,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:46:40,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:46:40,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:46:40,930 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd8ac353802a2e1d548b78214c4e90430a3b2551f535af0ed9cab2c49366d321 [2025-02-08 05:46:41,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:46:41,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:46:41,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:46:41,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:46:41,255 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:46:41,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/rwlock.i [2025-02-08 05:46:42,473 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8649b798e/80061d9c42e54237ba53b3054863f2c9/FLAGb983700c8 [2025-02-08 05:46:43,096 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:46:43,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/rwlock.i [2025-02-08 05:46:43,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8649b798e/80061d9c42e54237ba53b3054863f2c9/FLAGb983700c8 [2025-02-08 05:46:43,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8649b798e/80061d9c42e54237ba53b3054863f2c9 [2025-02-08 05:46:43,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:46:43,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:46:43,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:43,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:46:43,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:46:43,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:43" (1/1) ... [2025-02-08 05:46:43,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2107ef4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:43, skipping insertion in model container [2025-02-08 05:46:43,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:43" (1/1) ... [2025-02-08 05:46:43,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:46:45,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:45,190 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:46:45,271 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-08 05:46:45,272 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-08 05:46:45,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-08 05:46:45,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-08 05:46:45,274 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-08 05:46:45,275 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-08 05:46:45,275 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-08 05:46:45,275 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-08 05:46:45,276 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-08 05:46:45,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-08 05:46:45,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-08 05:46:45,277 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-08 05:46:45,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-08 05:46:45,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-08 05:46:45,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-08 05:46:45,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-08 05:46:45,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-08 05:46:45,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-08 05:46:45,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-08 05:46:45,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-08 05:46:45,279 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-08 05:46:45,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-08 05:46:45,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-08 05:46:45,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-08 05:46:45,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-08 05:46:45,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-08 05:46:45,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-08 05:46:45,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-08 05:46:45,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-08 05:46:45,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-08 05:46:45,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-08 05:46:45,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-08 05:46:45,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-08 05:46:45,285 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-08 05:46:45,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-08 05:46:45,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-08 05:46:45,286 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-08 05:46:45,287 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-08 05:46:45,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-08 05:46:45,288 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-08 05:46:45,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-08 05:46:45,289 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-08 05:46:45,291 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-08 05:46:45,291 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-08 05:46:45,291 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-08 05:46:45,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-08 05:46:45,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-08 05:46:45,293 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-08 05:46:45,293 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-08 05:46:45,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-08 05:46:45,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-08 05:46:45,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-08 05:46:45,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-08 05:46:45,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-08 05:46:45,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-08 05:46:45,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-08 05:46:45,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-08 05:46:45,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-08 05:46:45,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-08 05:46:45,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-08 05:46:45,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-08 05:46:45,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-08 05:46:45,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-08 05:46:45,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-08 05:46:45,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-08 05:46:45,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-08 05:46:45,301 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-08 05:46:45,301 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-08 05:46:45,301 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-08 05:46:45,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-08 05:46:45,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-08 05:46:45,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-08 05:46:45,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-08 05:46:45,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-08 05:46:45,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-08 05:46:45,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-08 05:46:45,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-08 05:46:45,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-08 05:46:45,304 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-08 05:46:45,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-08 05:46:45,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-08 05:46:45,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-08 05:46:45,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-08 05:46:45,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-08 05:46:45,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-08 05:46:45,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-08 05:46:45,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-08 05:46:45,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-08 05:46:45,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-08 05:46:45,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-08 05:46:45,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-08 05:46:45,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-08 05:46:45,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-08 05:46:45,309 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-08 05:46:45,309 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-08 05:46:45,309 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-08 05:46:45,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-08 05:46:45,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-08 05:46:45,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-08 05:46:45,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-08 05:46:45,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:45,573 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:46:45,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45 WrapperNode [2025-02-08 05:46:45,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:45,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:45,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:46:45,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:46:45,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,661 INFO L138 Inliner]: procedures = 930, calls = 943, calls flagged for inlining = 835, calls inlined = 70, statements flattened = 789 [2025-02-08 05:46:45,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:45,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:46:45,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:46:45,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:46:45,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:46:45,717 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:46:45,718 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:46:45,718 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:46:45,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (1/1) ... [2025-02-08 05:46:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:45,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:46:45,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:46:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-02-08 05:46:45,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-02-08 05:46:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:46:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:46:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:46:45,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:46:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:46:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:46:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:46:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-02-08 05:46:45,769 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-02-08 05:46:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:46:45,771 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:46:45,913 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:46:45,915 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:46:46,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4842: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-2: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-3: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-2: assume { :end_inline_vatomic32_cmpxchg } true;vatomic32_await_ge_sub_~old~20#1 := vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-3: havoc vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041: havoc vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-1: havoc vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-4: havoc vatomic32_cmpxchg_#t~ret462#1, vatomic32_cmpxchg_#t~mem463#1, vatomic32_cmpxchg_#t~ret464#1, vatomic32_cmpxchg_#t~nondet465#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:46,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-5: vatomic32_await_ge_sub_#t~ret724#1 := vatomic32_cmpxchg_#res#1; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-5: havoc vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-6: havoc vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-9: havoc vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_neq_#t~ite674#1 := 0; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-7: assume 0 != vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-7: assume !(0 != vatomic32_await_neq_#t~ite674#1); [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-8: havoc vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-14: assume vatomic32_await_neq_~cur~5#1 % 4294967296 == vatomic32_await_neq_~c#1 % 4294967296; [2025-02-08 05:46:46,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-14: assume !(vatomic32_await_neq_~cur~5#1 % 4294967296 == vatomic32_await_neq_~c#1 % 4294967296); [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_neq_~cur~5#1 := vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-15: vatomic32_await_neq_#t~ite674#1 := 1; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-19: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 05:46:46,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-20: vatomic32_await_neq_#t~ret673#1 := vatomic32_read_#res#1; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 05:46:46,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume !true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813: assume true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813: assume !true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume !false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813-1: assume false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813-1: assume !false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume !true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume !false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume !true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume !false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume !true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume !false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume !true; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume false; [2025-02-08 05:46:46,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume !false; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume true; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume !true; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume false; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume !false; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: havoc vatomic32_await_eq_rlx_#t~ret168#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2425: havoc vatomic32_await_ge_sub_acq_#t~ret202#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5036-1: assume vatomic32_await_ge_sub_~old~20#1 % 4294967296 != vatomic32_await_ge_sub_~cur~15#1 % 4294967296; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5036-1: assume !(vatomic32_await_ge_sub_~old~20#1 % 4294967296 != vatomic32_await_ge_sub_~cur~15#1 % 4294967296); [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-5: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-6: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-9: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite680#1 := 0; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume 0 != vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume !(0 != vatomic32_await_eq_#t~ite680#1); [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-8: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:46,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:46,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-15: vatomic32_await_eq_#t~ite680#1 := 1; [2025-02-08 05:46:46,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:46,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-19: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:46,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-20: vatomic32_await_eq_#t~ret679#1 := vatomic32_read_#res#1; [2025-02-08 05:46:46,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039: havoc vatomic32_await_ge_sub_#t~ret723#1; [2025-02-08 05:46:46,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039-1: assume { :end_inline_vatomic32_await_neq } true;vatomic32_await_ge_sub_~cur~15#1 := vatomic32_await_ge_sub_#t~ret723#1; [2025-02-08 05:46:46,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039-4: vatomic32_await_ge_sub_#t~ret723#1 := vatomic32_await_neq_#res#1; [2025-02-08 05:46:46,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039-2: havoc vatomic32_await_neq_#in~a#1.base, vatomic32_await_neq_#in~a#1.offset, vatomic32_await_neq_#in~c#1; [2025-02-08 05:46:46,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039-3: havoc vatomic32_await_neq_#t~ret673#1, vatomic32_await_neq_#t~ite674#1, vatomic32_await_neq_~a#1.base, vatomic32_await_neq_~a#1.offset, vatomic32_await_neq_~c#1, vatomic32_await_neq_~cur~5#1; [2025-02-08 05:46:46,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume true; [2025-02-08 05:46:46,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume !true; [2025-02-08 05:46:46,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume false; [2025-02-08 05:46:46,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume !false; [2025-02-08 05:46:46,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6076-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 05:46:46,368 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6076: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-1: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-2: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565-3: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 05:46:46,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-12: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-13: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-14: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-15: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-16: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-17: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-18: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-19: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-20: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-21: assume !false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-22: assume !true; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume false; [2025-02-08 05:46:46,630 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-23: assume !false; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2425: havoc vatomic32_await_ge_sub_acq_#t~ret202#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5036-1: assume vatomic32_await_ge_sub_~old~20#1 % 4294967296 != vatomic32_await_ge_sub_~cur~15#1 % 4294967296; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5036-1: assume !(vatomic32_await_ge_sub_~old~20#1 % 4294967296 != vatomic32_await_ge_sub_~cur~15#1 % 4294967296); [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5334-1: assume vatomic32_await_eq_set_#t~ret792#1 != vatomic32_await_eq_set_~c#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5334-1: assume !(vatomic32_await_eq_set_#t~ret792#1 != vatomic32_await_eq_set_~c#1); [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5335: assume { :end_inline_vatomic32_await_eq } true;havoc vatomic32_await_eq_set_#t~ret791#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5335-1: havoc vatomic32_await_eq_#in~a#1.base, vatomic32_await_eq_#in~a#1.offset, vatomic32_await_eq_#in~c#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5335-2: havoc vatomic32_await_eq_#t~ret679#1, vatomic32_await_eq_#t~ite680#1, vatomic32_await_eq_~a#1.base, vatomic32_await_eq_~a#1.offset, vatomic32_await_eq_~c#1, vatomic32_await_eq_~ret~0#1, vatomic32_await_eq_~o~5#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5335-3: vatomic32_await_eq_set_#t~ret791#1 := vatomic32_await_eq_#res#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-5: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-6: havoc vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-9: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_eq_#t~ite680#1 := 0; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume 0 != vatomic32_await_eq_#t~ite680#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-7: assume !(0 != vatomic32_await_eq_#t~ite680#1); [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-8: havoc vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296; [2025-02-08 05:46:46,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-14: assume !(vatomic32_await_eq_~o~5#1 % 4294967296 != vatomic32_await_eq_~c#1 % 4294967296); [2025-02-08 05:46:46,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:46,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-1: havoc vatomic32_await_eq_set_#t~ret792#1; [2025-02-08 05:46:46,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_eq_~o~5#1 := vatomic32_await_eq_#t~ret679#1; [2025-02-08 05:46:46,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-2: havoc vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1;assume { :end_inline_vatomic32_cmpxchg } true; [2025-02-08 05:46:46,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:46,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-15: vatomic32_await_eq_#t~ite680#1 := 1; [2025-02-08 05:46:46,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336: havoc vatomic32_await_eq_set_#t~ret792#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-5: havoc vatomic32_cmpxchg_#t~ret462#1, vatomic32_cmpxchg_#t~mem463#1, vatomic32_cmpxchg_#t~ret464#1, vatomic32_cmpxchg_#t~nondet465#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-6: havoc vatomic32_cmpxchg_#res#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-3: havoc vatomic32_cmpxchg_#t~ret462#1, vatomic32_cmpxchg_#t~mem463#1, vatomic32_cmpxchg_#t~ret464#1, vatomic32_cmpxchg_#t~nondet465#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-19: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-4: vatomic32_await_eq_set_#t~ret792#1 := vatomic32_cmpxchg_#res#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4840-20: vatomic32_await_eq_#t~ret679#1 := vatomic32_read_#res#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039: havoc vatomic32_await_ge_sub_#t~ret723#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039-1: assume { :end_inline_vatomic32_await_neq } true;vatomic32_await_ge_sub_~cur~15#1 := vatomic32_await_ge_sub_#t~ret723#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336-7: assume { :begin_inline_vatomic32_cmpxchg } true;vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1 := vatomic32_await_eq_set_~a#1.base, vatomic32_await_eq_set_~a#1.offset, vatomic32_await_eq_set_~c#1, vatomic32_await_eq_set_~v#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039-4: vatomic32_await_ge_sub_#t~ret723#1 := vatomic32_await_neq_#res#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039-2: havoc vatomic32_await_neq_#in~a#1.base, vatomic32_await_neq_#in~a#1.offset, vatomic32_await_neq_#in~c#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039-3: havoc vatomic32_await_neq_#t~ret673#1, vatomic32_await_neq_#t~ite674#1, vatomic32_await_neq_~a#1.base, vatomic32_await_neq_~a#1.offset, vatomic32_await_neq_~c#1, vatomic32_await_neq_~cur~5#1; [2025-02-08 05:46:46,633 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume true; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841: assume !true; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume false; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4841-1: assume !false; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4842: vatomic32_await_eq_~ret~0#1 := vatomic32_await_eq_~o~5#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-2: assume { :end_inline_vatomic32_cmpxchg } true;vatomic32_await_ge_sub_~old~20#1 := vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-3: havoc vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset, vatomic32_cmpxchg_#in~e#1, vatomic32_cmpxchg_#in~v#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041: havoc vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-1: havoc vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-4: havoc vatomic32_cmpxchg_#t~ret462#1, vatomic32_cmpxchg_#t~mem463#1, vatomic32_cmpxchg_#t~ret464#1, vatomic32_cmpxchg_#t~nondet465#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, vatomic32_cmpxchg_~e#1, vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-5: vatomic32_await_ge_sub_#t~ret724#1 := vatomic32_cmpxchg_#res#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-1: havoc verification_spin_end_#in~v#1;assume { :end_inline_verification_spin_end } true; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-5: havoc vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-6: havoc vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-4: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 0; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-9: havoc vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-10: assume { :end_inline_verification_spin_end } true;vatomic32_await_neq_#t~ite674#1 := 0; [2025-02-08 05:46:46,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-7: assume 0 != vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-7: assume !(0 != vatomic32_await_neq_#t~ite674#1); [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-8: havoc vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-14: assume vatomic32_await_neq_~cur~5#1 % 4294967296 == vatomic32_await_neq_~c#1 % 4294967296; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-14: assume !(vatomic32_await_neq_~cur~5#1 % 4294967296 == vatomic32_await_neq_~c#1 % 4294967296); [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-17: assume { :end_inline_vatomic32_read } true;vatomic32_await_neq_~cur~5#1 := vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-18: havoc vatomic32_read_#in~a#1.base, vatomic32_read_#in~a#1.offset; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-15: vatomic32_await_neq_#t~ite674#1 := 1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-16: assume { :begin_inline_verification_spin_end } true;verification_spin_end_#in~v#1 := 1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-19: havoc vatomic32_read_#t~mem432#1, vatomic32_read_~a#1.base, vatomic32_read_~a#1.offset, vatomic32_read_~tmp~2#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-20: vatomic32_await_neq_#t~ret673#1 := vatomic32_read_#res#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813: assume true; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813: assume !true; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813-1: assume false; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813-1: assume !false; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923-3: vatomic32_cmpxchg_~v#1 := vatomic32_cmpxchg_#in~v#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923-5: vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#in~a#1.base, vatomic32_cmpxchg_#in~a#1.offset; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923-4: vatomic32_cmpxchg_~e#1 := vatomic32_cmpxchg_#in~e#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2570: havoc vatomic32_await_eq_set_rlx_#t~ret231#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3926-1: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_~e#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-26: havoc vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-28: havoc vatomic32_cmpxchg_#t~mem463#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-27: havoc vatomic32_cmpxchg_#t~ret464#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-30: havoc vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-29: havoc vatomic32_cmpxchg_#t~ret462#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-32: havoc vatomic32_cmpxchg_#t~mem463#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-31: havoc vatomic32_cmpxchg_#t~ret464#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-34: [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-33: havoc vatomic32_cmpxchg_#t~ret462#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-36: #race := #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-35: assume ((#race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1 && #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-35: assume !(((#race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1 && #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1) && #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset] == vatomic32_cmpxchg_#t~nondet465#1); [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-38: #race := #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-37: #race := #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:46,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-40: havoc vatomic32_cmpxchg_#t~nondet465#1; [2025-02-08 05:46:46,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-39: #race := #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset := vatomic32_cmpxchg_#t~nondet465#1]; [2025-02-08 05:46:46,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-42: assume 0 != vatomic32_cmpxchg_#t~ret462#1 % 256; [2025-02-08 05:46:46,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-42: assume !(0 != vatomic32_cmpxchg_#t~ret462#1 % 256); [2025-02-08 05:46:46,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-41: SUMMARY for call write~int(vatomic32_cmpxchg_~v#1, vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:46,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-44: vatomic32_cmpxchg_#t~ret462#1 := (if vatomic32_cmpxchg_#t~mem463#1 == vatomic32_cmpxchg_#t~ret464#1 then 1 else 0); [2025-02-08 05:46:46,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-43: vatomic32_cmpxchg_~exp~2#1 := vatomic32_cmpxchg_#t~mem463#1; [2025-02-08 05:46:46,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-46: SUMMARY for call vatomic32_cmpxchg_#t~mem463#1 := read~int(vatomic32_cmpxchg_~a#1.base, vatomic32_cmpxchg_~a#1.offset, 4); srcloc: null [2025-02-08 05:46:46,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-45: vatomic32_cmpxchg_#t~ret464#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:46,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-48: #race := #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:46,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-47: assume ((0 == #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] && 0 == #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset]; [2025-02-08 05:46:46,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-47: assume !(((0 == #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset] && 0 == #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset]) && 0 == #race[vatomic32_cmpxchg_~a#1.base,3 + vatomic32_cmpxchg_~a#1.offset]); [2025-02-08 05:46:46,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-50: #race := #race[vatomic32_cmpxchg_~a#1.base,1 + vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:46,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-49: #race := #race[vatomic32_cmpxchg_~a#1.base,2 + vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:46,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928-51: #race := #race[vatomic32_cmpxchg_~a#1.base,vatomic32_cmpxchg_~a#1.offset := 0]; [2025-02-08 05:46:46,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3931-3: vatomic32_cmpxchg_#res#1 := vatomic32_cmpxchg_~exp~2#1; [2025-02-08 05:46:46,638 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:46:46,638 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:46:46,761 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:46:46,761 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:46:46,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:46 BoogieIcfgContainer [2025-02-08 05:46:46,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:46:46,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:46:46,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:46:46,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:46:46,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:46:43" (1/3) ... [2025-02-08 05:46:46,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@970a069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:46, skipping insertion in model container [2025-02-08 05:46:46,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:45" (2/3) ... [2025-02-08 05:46:46,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@970a069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:46, skipping insertion in model container [2025-02-08 05:46:46,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:46" (3/3) ... [2025-02-08 05:46:46,768 INFO L128 eAbstractionObserver]: Analyzing ICFG rwlock.i [2025-02-08 05:46:46,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:46:46,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rwlock.i that has 3 procedures, 607 locations, 1 initial locations, 70 loop locations, and 31 error locations. [2025-02-08 05:46:46,780 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:46:46,969 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:46:47,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 613 places, 676 transitions, 1366 flow [2025-02-08 05:46:47,350 INFO L124 PetriNetUnfolderBase]: 140/1192 cut-off events. [2025-02-08 05:46:47,352 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:47,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 1192 events. 140/1192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4727 event pairs, 0 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 719. Up to 12 conditions per place. [2025-02-08 05:46:47,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 613 places, 676 transitions, 1366 flow [2025-02-08 05:46:47,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 613 places, 676 transitions, 1366 flow [2025-02-08 05:46:47,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:47,413 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;@767ba9ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:47,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-02-08 05:46:47,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:47,420 INFO L124 PetriNetUnfolderBase]: 12/65 cut-off events. [2025-02-08 05:46:47,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:47,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:47,421 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] [2025-02-08 05:46:47,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:46:47,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:47,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1162159210, now seen corresponding path program 1 times [2025-02-08 05:46:47,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934064671] [2025-02-08 05:46:47,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:47,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:46:47,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:46:47,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:47,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:47,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:47,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934064671] [2025-02-08 05:46:47,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934064671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:47,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:47,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:47,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772433180] [2025-02-08 05:46:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:47,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:47,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:47,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:47,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 573 out of 676 [2025-02-08 05:46:47,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 676 transitions, 1366 flow. Second operand has 2 states, 2 states have (on average 573.5) internal successors, (1147), 2 states have internal predecessors, (1147), 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-02-08 05:46:47,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:47,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 573 of 676 [2025-02-08 05:46:47,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:47,648 INFO L124 PetriNetUnfolderBase]: 2/556 cut-off events. [2025-02-08 05:46:47,649 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:47,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 556 events. 2/556 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2195 event pairs, 2 based on Foata normal form. 181/687 useless extension candidates. Maximal degree in co-relation 349. Up to 11 conditions per place. [2025-02-08 05:46:47,652 INFO L140 encePairwiseOnDemand]: 633/676 looper letters, 4 selfloop transitions, 0 changer transitions 0/205 dead transitions. [2025-02-08 05:46:47,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 205 transitions, 426 flow [2025-02-08 05:46:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1193 transitions. [2025-02-08 05:46:47,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882396449704142 [2025-02-08 05:46:47,670 INFO L175 Difference]: Start difference. First operand has 613 places, 676 transitions, 1366 flow. Second operand 2 states and 1193 transitions. [2025-02-08 05:46:47,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 205 transitions, 426 flow [2025-02-08 05:46:47,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 205 transitions, 426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:47,677 INFO L231 Difference]: Finished difference. Result has 211 places, 205 transitions, 418 flow [2025-02-08 05:46:47,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=418, PETRI_PLACES=211, PETRI_TRANSITIONS=205} [2025-02-08 05:46:47,681 INFO L279 CegarLoopForPetriNet]: 613 programPoint places, -402 predicate places. [2025-02-08 05:46:47,682 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 205 transitions, 418 flow [2025-02-08 05:46:47,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 573.5) internal successors, (1147), 2 states have internal predecessors, (1147), 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-02-08 05:46:47,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:47,683 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] [2025-02-08 05:46:47,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:46:47,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:46:47,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2122311655, now seen corresponding path program 1 times [2025-02-08 05:46:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218660133] [2025-02-08 05:46:47,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:47,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:47,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:46:47,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:46:47,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:47,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:48,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:48,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218660133] [2025-02-08 05:46:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218660133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:48,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:48,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410978852] [2025-02-08 05:46:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:48,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:48,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:48,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:48,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 676 [2025-02-08 05:46:48,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 205 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 543.5) internal successors, (3261), 6 states have internal predecessors, (3261), 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-02-08 05:46:48,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:48,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 676 [2025-02-08 05:46:48,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:48,924 INFO L124 PetriNetUnfolderBase]: 70/797 cut-off events. [2025-02-08 05:46:48,924 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:46:48,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 797 events. 70/797 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5380 event pairs, 65 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 1007. Up to 186 conditions per place. [2025-02-08 05:46:48,928 INFO L140 encePairwiseOnDemand]: 668/676 looper letters, 24 selfloop transitions, 10 changer transitions 4/214 dead transitions. [2025-02-08 05:46:48,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 214 transitions, 508 flow [2025-02-08 05:46:48,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3289 transitions. [2025-02-08 05:46:48,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8108974358974359 [2025-02-08 05:46:48,936 INFO L175 Difference]: Start difference. First operand has 211 places, 205 transitions, 418 flow. Second operand 6 states and 3289 transitions. [2025-02-08 05:46:48,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 214 transitions, 508 flow [2025-02-08 05:46:48,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 214 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:48,942 INFO L231 Difference]: Finished difference. Result has 221 places, 210 transitions, 482 flow [2025-02-08 05:46:48,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=482, PETRI_PLACES=221, PETRI_TRANSITIONS=210} [2025-02-08 05:46:48,944 INFO L279 CegarLoopForPetriNet]: 613 programPoint places, -392 predicate places. [2025-02-08 05:46:48,944 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 210 transitions, 482 flow [2025-02-08 05:46:48,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 543.5) internal successors, (3261), 6 states have internal predecessors, (3261), 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-02-08 05:46:48,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:48,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:48,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:46:48,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:46:48,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:48,947 INFO L85 PathProgramCache]: Analyzing trace with hash 202068948, now seen corresponding path program 1 times [2025-02-08 05:46:48,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:48,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878255227] [2025-02-08 05:46:48,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:48,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:48,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:46:48,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:46:48,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:48,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:49,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878255227] [2025-02-08 05:46:49,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878255227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:49,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:49,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413675904] [2025-02-08 05:46:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:49,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:49,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:49,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:49,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:49,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 676 [2025-02-08 05:46:49,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 210 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 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-02-08 05:46:49,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:49,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 676 [2025-02-08 05:46:49,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:49,087 INFO L124 PetriNetUnfolderBase]: 10/479 cut-off events. [2025-02-08 05:46:49,088 INFO L125 PetriNetUnfolderBase]: For 36/77 co-relation queries the response was YES. [2025-02-08 05:46:49,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 479 events. 10/479 cut-off events. For 36/77 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1828 event pairs, 4 based on Foata normal form. 4/443 useless extension candidates. Maximal degree in co-relation 564. Up to 22 conditions per place. [2025-02-08 05:46:49,090 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-02-08 05:46:49,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 212 transitions, 522 flow [2025-02-08 05:46:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1712 transitions. [2025-02-08 05:46:49,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441814595660749 [2025-02-08 05:46:49,093 INFO L175 Difference]: Start difference. First operand has 221 places, 210 transitions, 482 flow. Second operand 3 states and 1712 transitions. [2025-02-08 05:46:49,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 212 transitions, 522 flow [2025-02-08 05:46:49,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:49,097 INFO L231 Difference]: Finished difference. Result has 220 places, 210 transitions, 490 flow [2025-02-08 05:46:49,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=220, PETRI_TRANSITIONS=210} [2025-02-08 05:46:49,098 INFO L279 CegarLoopForPetriNet]: 613 programPoint places, -393 predicate places. [2025-02-08 05:46:49,098 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 210 transitions, 490 flow [2025-02-08 05:46:49,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 568.3333333333334) internal successors, (1705), 3 states have internal predecessors, (1705), 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-02-08 05:46:49,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:49,099 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] [2025-02-08 05:46:49,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:46:49,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:46:49,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:49,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2095963616, now seen corresponding path program 1 times [2025-02-08 05:46:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:49,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723246722] [2025-02-08 05:46:49,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:49,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:46:49,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:46:49,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:49,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:49,123 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:49,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:46:49,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:46:49,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:49,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:49,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:49,161 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:49,161 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 54 remaining) [2025-02-08 05:46:49,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2025-02-08 05:46:49,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2025-02-08 05:46:49,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (47 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr15ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr12ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr11ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr10ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2025-02-08 05:46:49,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr15ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr12ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr11ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr10ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2025-02-08 05:46:49,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2025-02-08 05:46:49,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2025-02-08 05:46:49,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:46:49,169 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:46:49,174 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:46:49,174 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:46:49,366 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:46:49,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1089 places, 1190 transitions, 2412 flow [2025-02-08 05:46:50,558 INFO L124 PetriNetUnfolderBase]: 399/3263 cut-off events. [2025-02-08 05:46:50,559 INFO L125 PetriNetUnfolderBase]: For 40/52 co-relation queries the response was YES. [2025-02-08 05:46:50,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 3263 events. 399/3263 cut-off events. For 40/52 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 19411 event pairs, 1 based on Foata normal form. 0/2659 useless extension candidates. Maximal degree in co-relation 2034. Up to 48 conditions per place. [2025-02-08 05:46:50,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 1089 places, 1190 transitions, 2412 flow [2025-02-08 05:46:50,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1089 places, 1190 transitions, 2412 flow [2025-02-08 05:46:50,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:50,724 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;@767ba9ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:50,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-02-08 05:46:50,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:50,730 INFO L124 PetriNetUnfolderBase]: 12/65 cut-off events. [2025-02-08 05:46:50,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:50,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:50,730 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] [2025-02-08 05:46:50,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:46:50,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1351910858, now seen corresponding path program 1 times [2025-02-08 05:46:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:50,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57451251] [2025-02-08 05:46:50,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:50,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:46:50,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:46:50,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:50,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:50,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57451251] [2025-02-08 05:46:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57451251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363703207] [2025-02-08 05:46:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:50,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:50,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:50,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:50,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1010 out of 1190 [2025-02-08 05:46:50,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1089 places, 1190 transitions, 2412 flow. Second operand has 2 states, 2 states have (on average 1010.5) internal successors, (2021), 2 states have internal predecessors, (2021), 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-02-08 05:46:50,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:50,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1010 of 1190 [2025-02-08 05:46:50,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:51,215 INFO L124 PetriNetUnfolderBase]: 46/2696 cut-off events. [2025-02-08 05:46:51,215 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-08 05:46:51,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 2696 events. 46/2696 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 20368 event pairs, 46 based on Foata normal form. 1184/3636 useless extension candidates. Maximal degree in co-relation 1288. Up to 95 conditions per place. [2025-02-08 05:46:51,236 INFO L140 encePairwiseOnDemand]: 1130/1190 looper letters, 8 selfloop transitions, 0 changer transitions 0/282 dead transitions. [2025-02-08 05:46:51,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 282 transitions, 600 flow [2025-02-08 05:46:51,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2088 transitions. [2025-02-08 05:46:51,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8773109243697479 [2025-02-08 05:46:51,241 INFO L175 Difference]: Start difference. First operand has 1089 places, 1190 transitions, 2412 flow. Second operand 2 states and 2088 transitions. [2025-02-08 05:46:51,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 282 transitions, 600 flow [2025-02-08 05:46:51,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 282 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:51,245 INFO L231 Difference]: Finished difference. Result has 292 places, 282 transitions, 584 flow [2025-02-08 05:46:51,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=584, PETRI_PLACES=292, PETRI_TRANSITIONS=282} [2025-02-08 05:46:51,246 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -797 predicate places. [2025-02-08 05:46:51,247 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 282 transitions, 584 flow [2025-02-08 05:46:51,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1010.5) internal successors, (2021), 2 states have internal predecessors, (2021), 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-02-08 05:46:51,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:51,248 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] [2025-02-08 05:46:51,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:46:51,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:46:51,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash -366274388, now seen corresponding path program 1 times [2025-02-08 05:46:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979071952] [2025-02-08 05:46:51,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:51,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:46:51,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:46:51,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:51,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:51,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:51,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979071952] [2025-02-08 05:46:51,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979071952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:51,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:51,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:51,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370378760] [2025-02-08 05:46:51,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:51,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:51,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:51,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:51,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:52,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 971 out of 1190 [2025-02-08 05:46:52,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 282 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 972.5) internal successors, (5835), 6 states have internal predecessors, (5835), 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-02-08 05:46:52,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:52,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 971 of 1190 [2025-02-08 05:46:52,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:52,994 INFO L124 PetriNetUnfolderBase]: 801/4241 cut-off events. [2025-02-08 05:46:52,994 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-02-08 05:46:53,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5743 conditions, 4241 events. 801/4241 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 42414 event pairs, 769 based on Foata normal form. 0/3683 useless extension candidates. Maximal degree in co-relation 5736. Up to 1387 conditions per place. [2025-02-08 05:46:53,030 INFO L140 encePairwiseOnDemand]: 1181/1190 looper letters, 29 selfloop transitions, 14 changer transitions 4/296 dead transitions. [2025-02-08 05:46:53,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 707 flow [2025-02-08 05:46:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5872 transitions. [2025-02-08 05:46:53,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8224089635854341 [2025-02-08 05:46:53,039 INFO L175 Difference]: Start difference. First operand has 292 places, 282 transitions, 584 flow. Second operand 6 states and 5872 transitions. [2025-02-08 05:46:53,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 707 flow [2025-02-08 05:46:53,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 296 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:53,043 INFO L231 Difference]: Finished difference. Result has 302 places, 291 transitions, 674 flow [2025-02-08 05:46:53,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=674, PETRI_PLACES=302, PETRI_TRANSITIONS=291} [2025-02-08 05:46:53,044 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -787 predicate places. [2025-02-08 05:46:53,044 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 291 transitions, 674 flow [2025-02-08 05:46:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 972.5) internal successors, (5835), 6 states have internal predecessors, (5835), 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-02-08 05:46:53,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:53,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:53,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:46:53,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:46:53,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash 668307513, now seen corresponding path program 1 times [2025-02-08 05:46:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669073277] [2025-02-08 05:46:53,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:53,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:46:53,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:46:53,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:53,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:53,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669073277] [2025-02-08 05:46:53,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669073277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:53,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573510249] [2025-02-08 05:46:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:53,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:53,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:53,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:53,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1004 out of 1190 [2025-02-08 05:46:53,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 291 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 1005.3333333333334) internal successors, (3016), 3 states have internal predecessors, (3016), 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-02-08 05:46:53,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:53,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1004 of 1190 [2025-02-08 05:46:53,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:53,399 INFO L124 PetriNetUnfolderBase]: 97/2660 cut-off events. [2025-02-08 05:46:53,400 INFO L125 PetriNetUnfolderBase]: For 249/570 co-relation queries the response was YES. [2025-02-08 05:46:53,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 2660 events. 97/2660 cut-off events. For 249/570 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 21607 event pairs, 65 based on Foata normal form. 4/2416 useless extension candidates. Maximal degree in co-relation 3099. Up to 160 conditions per place. [2025-02-08 05:46:53,427 INFO L140 encePairwiseOnDemand]: 1187/1190 looper letters, 22 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2025-02-08 05:46:53,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 294 transitions, 734 flow [2025-02-08 05:46:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3028 transitions. [2025-02-08 05:46:53,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481792717086835 [2025-02-08 05:46:53,432 INFO L175 Difference]: Start difference. First operand has 302 places, 291 transitions, 674 flow. Second operand 3 states and 3028 transitions. [2025-02-08 05:46:53,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 294 transitions, 734 flow [2025-02-08 05:46:53,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 294 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:53,436 INFO L231 Difference]: Finished difference. Result has 301 places, 292 transitions, 686 flow [2025-02-08 05:46:53,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=301, PETRI_TRANSITIONS=292} [2025-02-08 05:46:53,437 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -788 predicate places. [2025-02-08 05:46:53,437 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 292 transitions, 686 flow [2025-02-08 05:46:53,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1005.3333333333334) internal successors, (3016), 3 states have internal predecessors, (3016), 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-02-08 05:46:53,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:53,439 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] [2025-02-08 05:46:53,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:46:53,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:46:53,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1989251717, now seen corresponding path program 1 times [2025-02-08 05:46:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:53,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771759874] [2025-02-08 05:46:53,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:53,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:46:53,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:46:53,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:53,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:53,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:53,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771759874] [2025-02-08 05:46:53,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771759874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:53,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:53,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274966501] [2025-02-08 05:46:53,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:53,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:46:53,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:53,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:46:53,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:46:53,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1190 [2025-02-08 05:46:53,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 292 transitions, 686 flow. Second operand has 5 states, 5 states have (on average 1003.6) internal successors, (5018), 5 states have internal predecessors, (5018), 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-02-08 05:46:53,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:53,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1190 [2025-02-08 05:46:53,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:53,858 INFO L124 PetriNetUnfolderBase]: 95/1944 cut-off events. [2025-02-08 05:46:53,858 INFO L125 PetriNetUnfolderBase]: For 235/625 co-relation queries the response was YES. [2025-02-08 05:46:53,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 1944 events. 95/1944 cut-off events. For 235/625 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 13863 event pairs, 30 based on Foata normal form. 19/1795 useless extension candidates. Maximal degree in co-relation 2376. Up to 120 conditions per place. [2025-02-08 05:46:53,880 INFO L140 encePairwiseOnDemand]: 1185/1190 looper letters, 32 selfloop transitions, 5 changer transitions 0/305 dead transitions. [2025-02-08 05:46:53,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 820 flow [2025-02-08 05:46:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6036 transitions. [2025-02-08 05:46:53,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8453781512605042 [2025-02-08 05:46:53,890 INFO L175 Difference]: Start difference. First operand has 301 places, 292 transitions, 686 flow. Second operand 6 states and 6036 transitions. [2025-02-08 05:46:53,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 820 flow [2025-02-08 05:46:53,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 305 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:46:53,894 INFO L231 Difference]: Finished difference. Result has 308 places, 294 transitions, 710 flow [2025-02-08 05:46:53,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=308, PETRI_TRANSITIONS=294} [2025-02-08 05:46:53,895 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -781 predicate places. [2025-02-08 05:46:53,895 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 294 transitions, 710 flow [2025-02-08 05:46:53,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1003.6) internal successors, (5018), 5 states have internal predecessors, (5018), 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-02-08 05:46:53,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:53,898 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:46:53,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:46:53,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:46:53,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:53,898 INFO L85 PathProgramCache]: Analyzing trace with hash -841605808, now seen corresponding path program 1 times [2025-02-08 05:46:53,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:53,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858792659] [2025-02-08 05:46:53,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:53,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:46:53,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:46:53,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:53,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:54,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858792659] [2025-02-08 05:46:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858792659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:54,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:54,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:46:54,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690309460] [2025-02-08 05:46:54,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:54,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:46:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:54,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:46:54,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:46:54,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1190 [2025-02-08 05:46:54,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 294 transitions, 710 flow. Second operand has 7 states, 7 states have (on average 1002.8571428571429) internal successors, (7020), 7 states have internal predecessors, (7020), 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-02-08 05:46:54,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:54,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1190 [2025-02-08 05:46:54,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:54,420 INFO L124 PetriNetUnfolderBase]: 69/1820 cut-off events. [2025-02-08 05:46:54,420 INFO L125 PetriNetUnfolderBase]: For 170/318 co-relation queries the response was YES. [2025-02-08 05:46:54,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1820 events. 69/1820 cut-off events. For 170/318 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 12533 event pairs, 18 based on Foata normal form. 37/1702 useless extension candidates. Maximal degree in co-relation 2152. Up to 68 conditions per place. [2025-02-08 05:46:54,440 INFO L140 encePairwiseOnDemand]: 1184/1190 looper letters, 29 selfloop transitions, 8 changer transitions 0/303 dead transitions. [2025-02-08 05:46:54,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 303 transitions, 814 flow [2025-02-08 05:46:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:46:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:46:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9041 transitions. [2025-02-08 05:46:54,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441643323996265 [2025-02-08 05:46:54,454 INFO L175 Difference]: Start difference. First operand has 308 places, 294 transitions, 710 flow. Second operand 9 states and 9041 transitions. [2025-02-08 05:46:54,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 303 transitions, 814 flow [2025-02-08 05:46:54,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 303 transitions, 807 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 05:46:54,459 INFO L231 Difference]: Finished difference. Result has 313 places, 290 transitions, 701 flow [2025-02-08 05:46:54,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=701, PETRI_PLACES=313, PETRI_TRANSITIONS=290} [2025-02-08 05:46:54,460 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -776 predicate places. [2025-02-08 05:46:54,460 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 290 transitions, 701 flow [2025-02-08 05:46:54,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1002.8571428571429) internal successors, (7020), 7 states have internal predecessors, (7020), 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-02-08 05:46:54,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:54,464 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:46:54,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:46:54,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:46:54,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:54,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1957578246, now seen corresponding path program 1 times [2025-02-08 05:46:54,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:54,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892083467] [2025-02-08 05:46:54,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:54,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:46:54,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:46:54,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:54,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:54,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:54,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892083467] [2025-02-08 05:46:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892083467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:54,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698962137] [2025-02-08 05:46:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:54,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:54,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:54,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:55,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 971 out of 1190 [2025-02-08 05:46:55,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 290 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 973.5) internal successors, (5841), 6 states have internal predecessors, (5841), 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-02-08 05:46:55,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:55,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 971 of 1190 [2025-02-08 05:46:55,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:55,860 INFO L124 PetriNetUnfolderBase]: 905/3863 cut-off events. [2025-02-08 05:46:55,860 INFO L125 PetriNetUnfolderBase]: For 607/726 co-relation queries the response was YES. [2025-02-08 05:46:55,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6048 conditions, 3863 events. 905/3863 cut-off events. For 607/726 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 35096 event pairs, 525 based on Foata normal form. 8/3465 useless extension candidates. Maximal degree in co-relation 6031. Up to 1297 conditions per place. [2025-02-08 05:46:55,903 INFO L140 encePairwiseOnDemand]: 1179/1190 looper letters, 38 selfloop transitions, 22 changer transitions 0/313 dead transitions. [2025-02-08 05:46:55,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 313 transitions, 891 flow [2025-02-08 05:46:55,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5879 transitions. [2025-02-08 05:46:55,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8233893557422969 [2025-02-08 05:46:55,911 INFO L175 Difference]: Start difference. First operand has 313 places, 290 transitions, 701 flow. Second operand 6 states and 5879 transitions. [2025-02-08 05:46:55,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 313 transitions, 891 flow [2025-02-08 05:46:55,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 313 transitions, 863 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-02-08 05:46:55,918 INFO L231 Difference]: Finished difference. Result has 313 places, 311 transitions, 839 flow [2025-02-08 05:46:55,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=313, PETRI_TRANSITIONS=311} [2025-02-08 05:46:55,919 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -776 predicate places. [2025-02-08 05:46:55,919 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 311 transitions, 839 flow [2025-02-08 05:46:55,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 973.5) internal successors, (5841), 6 states have internal predecessors, (5841), 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-02-08 05:46:55,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:55,921 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:46:55,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:46:55,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:46:55,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash 973821275, now seen corresponding path program 1 times [2025-02-08 05:46:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:55,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547830262] [2025-02-08 05:46:55,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:55,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:46:55,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:46:55,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:55,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:57,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:57,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547830262] [2025-02-08 05:46:57,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547830262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:57,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:57,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 05:46:57,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244915822] [2025-02-08 05:46:57,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:57,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:46:57,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:57,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:46:57,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-08 05:47:02,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 1190 [2025-02-08 05:47:02,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 311 transitions, 839 flow. Second operand has 20 states, 20 states have (on average 940.75) internal successors, (18815), 20 states have internal predecessors, (18815), 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-02-08 05:47:02,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:02,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 1190 [2025-02-08 05:47:02,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:08,268 INFO L124 PetriNetUnfolderBase]: 7917/27932 cut-off events. [2025-02-08 05:47:08,269 INFO L125 PetriNetUnfolderBase]: For 12339/31663 co-relation queries the response was YES. [2025-02-08 05:47:08,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52607 conditions, 27932 events. 7917/27932 cut-off events. For 12339/31663 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 351757 event pairs, 5736 based on Foata normal form. 65/26022 useless extension candidates. Maximal degree in co-relation 52588. Up to 11089 conditions per place. [2025-02-08 05:47:08,667 INFO L140 encePairwiseOnDemand]: 1168/1190 looper letters, 149 selfloop transitions, 46 changer transitions 1/430 dead transitions. [2025-02-08 05:47:08,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 430 transitions, 1627 flow [2025-02-08 05:47:08,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 05:47:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-08 05:47:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18015 transitions. [2025-02-08 05:47:08,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7967713401149934 [2025-02-08 05:47:08,691 INFO L175 Difference]: Start difference. First operand has 313 places, 311 transitions, 839 flow. Second operand 19 states and 18015 transitions. [2025-02-08 05:47:08,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 430 transitions, 1627 flow [2025-02-08 05:47:09,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 430 transitions, 1611 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:09,022 INFO L231 Difference]: Finished difference. Result has 343 places, 344 transitions, 1183 flow [2025-02-08 05:47:09,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1183, PETRI_PLACES=343, PETRI_TRANSITIONS=344} [2025-02-08 05:47:09,023 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -746 predicate places. [2025-02-08 05:47:09,023 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 344 transitions, 1183 flow [2025-02-08 05:47:09,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 940.75) internal successors, (18815), 20 states have internal predecessors, (18815), 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-02-08 05:47:09,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:09,036 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:47:09,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:47:09,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:47:09,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1887772063, now seen corresponding path program 2 times [2025-02-08 05:47:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:09,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576182456] [2025-02-08 05:47:09,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:47:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:09,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-08 05:47:09,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 94 statements. [2025-02-08 05:47:09,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:47:09,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:47:10,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576182456] [2025-02-08 05:47:10,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576182456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:10,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:10,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 05:47:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837357622] [2025-02-08 05:47:10,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:10,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:47:10,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:10,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:47:10,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-02-08 05:47:12,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 1190 [2025-02-08 05:47:12,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 344 transitions, 1183 flow. Second operand has 20 states, 20 states have (on average 940.8) internal successors, (18816), 20 states have internal predecessors, (18816), 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-02-08 05:47:12,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:12,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 1190 [2025-02-08 05:47:12,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:17,277 INFO L124 PetriNetUnfolderBase]: 7437/18527 cut-off events. [2025-02-08 05:47:17,278 INFO L125 PetriNetUnfolderBase]: For 19065/28657 co-relation queries the response was YES. [2025-02-08 05:47:17,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44839 conditions, 18527 events. 7437/18527 cut-off events. For 19065/28657 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 196482 event pairs, 967 based on Foata normal form. 381/17908 useless extension candidates. Maximal degree in co-relation 44807. Up to 4684 conditions per place. [2025-02-08 05:47:17,546 INFO L140 encePairwiseOnDemand]: 1169/1190 looper letters, 451 selfloop transitions, 108 changer transitions 0/793 dead transitions. [2025-02-08 05:47:17,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 793 transitions, 4767 flow [2025-02-08 05:47:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 05:47:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-02-08 05:47:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 27553 transitions. [2025-02-08 05:47:17,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7984062590553462 [2025-02-08 05:47:17,561 INFO L175 Difference]: Start difference. First operand has 343 places, 344 transitions, 1183 flow. Second operand 29 states and 27553 transitions. [2025-02-08 05:47:17,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 793 transitions, 4767 flow [2025-02-08 05:47:17,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 793 transitions, 4683 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-02-08 05:47:17,619 INFO L231 Difference]: Finished difference. Result has 369 places, 404 transitions, 1851 flow [2025-02-08 05:47:17,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1851, PETRI_PLACES=369, PETRI_TRANSITIONS=404} [2025-02-08 05:47:17,620 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -720 predicate places. [2025-02-08 05:47:17,620 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 404 transitions, 1851 flow [2025-02-08 05:47:17,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 940.8) internal successors, (18816), 20 states have internal predecessors, (18816), 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-02-08 05:47:17,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:17,624 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:47:17,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:47:17,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:47:17,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1989322173, now seen corresponding path program 3 times [2025-02-08 05:47:17,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:17,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121671376] [2025-02-08 05:47:17,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:47:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:17,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 94 statements into 2 equivalence classes. [2025-02-08 05:47:17,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 93 of 94 statements. [2025-02-08 05:47:17,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:47:17,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:47:19,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121671376] [2025-02-08 05:47:19,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121671376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:19,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:19,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 05:47:19,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873781492] [2025-02-08 05:47:19,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:19,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:47:19,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:19,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:47:19,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-02-08 05:47:24,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 1190 [2025-02-08 05:47:24,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 404 transitions, 1851 flow. Second operand has 20 states, 20 states have (on average 940.75) internal successors, (18815), 20 states have internal predecessors, (18815), 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-02-08 05:47:24,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:24,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 1190 [2025-02-08 05:47:24,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:30,417 INFO L124 PetriNetUnfolderBase]: 7488/27215 cut-off events. [2025-02-08 05:47:30,417 INFO L125 PetriNetUnfolderBase]: For 27252/44512 co-relation queries the response was YES. [2025-02-08 05:47:30,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57709 conditions, 27215 events. 7488/27215 cut-off events. For 27252/44512 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 340824 event pairs, 5168 based on Foata normal form. 436/25768 useless extension candidates. Maximal degree in co-relation 57672. Up to 10409 conditions per place. [2025-02-08 05:47:30,807 INFO L140 encePairwiseOnDemand]: 1168/1190 looper letters, 218 selfloop transitions, 143 changer transitions 0/595 dead transitions. [2025-02-08 05:47:30,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 595 transitions, 3864 flow [2025-02-08 05:47:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 05:47:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-08 05:47:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 18982 transitions. [2025-02-08 05:47:30,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.797563025210084 [2025-02-08 05:47:30,819 INFO L175 Difference]: Start difference. First operand has 369 places, 404 transitions, 1851 flow. Second operand 20 states and 18982 transitions. [2025-02-08 05:47:30,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 595 transitions, 3864 flow [2025-02-08 05:47:30,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 595 transitions, 3831 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 05:47:30,877 INFO L231 Difference]: Finished difference. Result has 396 places, 468 transitions, 3057 flow [2025-02-08 05:47:30,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3057, PETRI_PLACES=396, PETRI_TRANSITIONS=468} [2025-02-08 05:47:30,878 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -693 predicate places. [2025-02-08 05:47:30,878 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 468 transitions, 3057 flow [2025-02-08 05:47:30,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 940.75) internal successors, (18815), 20 states have internal predecessors, (18815), 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-02-08 05:47:30,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:30,881 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:47:30,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:47:30,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:47:30,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash -138435991, now seen corresponding path program 4 times [2025-02-08 05:47:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:30,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276018643] [2025-02-08 05:47:30,883 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:47:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:30,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 94 statements into 2 equivalence classes. [2025-02-08 05:47:30,912 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:47:30,912 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:47:30,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:47:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276018643] [2025-02-08 05:47:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276018643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:31,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 05:47:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7969879] [2025-02-08 05:47:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:31,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:47:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:31,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:47:31,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-02-08 05:47:34,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 1190 [2025-02-08 05:47:34,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 468 transitions, 3057 flow. Second operand has 20 states, 20 states have (on average 940.8) internal successors, (18816), 20 states have internal predecessors, (18816), 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-02-08 05:47:34,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:34,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 1190 [2025-02-08 05:47:34,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:40,101 INFO L124 PetriNetUnfolderBase]: 7509/18219 cut-off events. [2025-02-08 05:47:40,102 INFO L125 PetriNetUnfolderBase]: For 40134/51539 co-relation queries the response was YES. [2025-02-08 05:47:40,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51342 conditions, 18219 events. 7509/18219 cut-off events. For 40134/51539 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 188943 event pairs, 628 based on Foata normal form. 1388/18711 useless extension candidates. Maximal degree in co-relation 51293. Up to 4622 conditions per place. [2025-02-08 05:47:40,337 INFO L140 encePairwiseOnDemand]: 1168/1190 looper letters, 456 selfloop transitions, 188 changer transitions 0/878 dead transitions. [2025-02-08 05:47:40,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 878 transitions, 7069 flow [2025-02-08 05:47:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 05:47:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-02-08 05:47:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 27544 transitions. [2025-02-08 05:47:40,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7981454650825848 [2025-02-08 05:47:40,352 INFO L175 Difference]: Start difference. First operand has 396 places, 468 transitions, 3057 flow. Second operand 29 states and 27544 transitions. [2025-02-08 05:47:40,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 878 transitions, 7069 flow [2025-02-08 05:47:40,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 878 transitions, 6906 flow, removed 29 selfloop flow, removed 6 redundant places. [2025-02-08 05:47:40,601 INFO L231 Difference]: Finished difference. Result has 425 places, 503 transitions, 3986 flow [2025-02-08 05:47:40,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=2995, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3986, PETRI_PLACES=425, PETRI_TRANSITIONS=503} [2025-02-08 05:47:40,602 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -664 predicate places. [2025-02-08 05:47:40,602 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 503 transitions, 3986 flow [2025-02-08 05:47:40,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 940.8) internal successors, (18816), 20 states have internal predecessors, (18816), 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-02-08 05:47:40,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:40,603 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:47:40,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:47:40,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:47:40,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash -595558393, now seen corresponding path program 5 times [2025-02-08 05:47:40,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:40,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556368298] [2025-02-08 05:47:40,604 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:47:40,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:40,618 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-02-08 05:47:40,624 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:47:40,625 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:47:40,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:47:42,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:42,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556368298] [2025-02-08 05:47:42,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556368298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:42,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:42,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 05:47:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702290392] [2025-02-08 05:47:42,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:42,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:47:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:42,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:47:42,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-02-08 05:47:45,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 1190 [2025-02-08 05:47:45,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 503 transitions, 3986 flow. Second operand has 20 states, 20 states have (on average 940.75) internal successors, (18815), 20 states have internal predecessors, (18815), 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-02-08 05:47:45,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:45,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 1190 [2025-02-08 05:47:45,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:52,694 INFO L124 PetriNetUnfolderBase]: 7622/27776 cut-off events. [2025-02-08 05:47:52,694 INFO L125 PetriNetUnfolderBase]: For 44709/63974 co-relation queries the response was YES. [2025-02-08 05:47:52,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62348 conditions, 27776 events. 7622/27776 cut-off events. For 44709/63974 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 348015 event pairs, 5189 based on Foata normal form. 1017/26906 useless extension candidates. Maximal degree in co-relation 62292. Up to 10475 conditions per place. [2025-02-08 05:47:53,122 INFO L140 encePairwiseOnDemand]: 1168/1190 looper letters, 231 selfloop transitions, 209 changer transitions 0/674 dead transitions. [2025-02-08 05:47:53,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 674 transitions, 6330 flow [2025-02-08 05:47:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:47:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:47:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 19921 transitions. [2025-02-08 05:47:53,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7971588635454182 [2025-02-08 05:47:53,137 INFO L175 Difference]: Start difference. First operand has 425 places, 503 transitions, 3986 flow. Second operand 21 states and 19921 transitions. [2025-02-08 05:47:53,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 674 transitions, 6330 flow [2025-02-08 05:47:53,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 674 transitions, 5877 flow, removed 12 selfloop flow, removed 21 redundant places. [2025-02-08 05:47:53,232 INFO L231 Difference]: Finished difference. Result has 435 places, 548 transitions, 5122 flow [2025-02-08 05:47:53,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=3718, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5122, PETRI_PLACES=435, PETRI_TRANSITIONS=548} [2025-02-08 05:47:53,233 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -654 predicate places. [2025-02-08 05:47:53,233 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 548 transitions, 5122 flow [2025-02-08 05:47:53,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 940.75) internal successors, (18815), 20 states have internal predecessors, (18815), 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-02-08 05:47:53,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:53,235 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:47:53,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:47:53,236 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:47:53,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1829226395, now seen corresponding path program 6 times [2025-02-08 05:47:53,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:53,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66076030] [2025-02-08 05:47:53,237 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:47:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:53,251 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 94 statements into 2 equivalence classes. [2025-02-08 05:47:53,257 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 93 of 94 statements. [2025-02-08 05:47:53,257 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 05:47:53,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:47:54,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:54,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66076030] [2025-02-08 05:47:54,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66076030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:54,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:54,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 05:47:54,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201318919] [2025-02-08 05:47:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:54,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:47:54,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:54,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:47:54,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2025-02-08 05:47:56,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 939 out of 1190 [2025-02-08 05:47:56,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 548 transitions, 5122 flow. Second operand has 20 states, 20 states have (on average 940.8) internal successors, (18816), 20 states have internal predecessors, (18816), 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-02-08 05:47:56,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:56,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 939 of 1190 [2025-02-08 05:47:56,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:48:02,619 INFO L124 PetriNetUnfolderBase]: 7633/18922 cut-off events. [2025-02-08 05:48:02,619 INFO L125 PetriNetUnfolderBase]: For 57542/71174 co-relation queries the response was YES. [2025-02-08 05:48:02,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54933 conditions, 18922 events. 7633/18922 cut-off events. For 57542/71174 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 198531 event pairs, 605 based on Foata normal form. 2148/20082 useless extension candidates. Maximal degree in co-relation 54866. Up to 4616 conditions per place. [2025-02-08 05:48:02,955 INFO L140 encePairwiseOnDemand]: 1168/1190 looper letters, 449 selfloop transitions, 264 changer transitions 0/947 dead transitions. [2025-02-08 05:48:02,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 947 transitions, 9838 flow [2025-02-08 05:48:02,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 05:48:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-02-08 05:48:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 27529 transitions. [2025-02-08 05:48:02,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7977108084613156 [2025-02-08 05:48:02,973 INFO L175 Difference]: Start difference. First operand has 435 places, 548 transitions, 5122 flow. Second operand 29 states and 27529 transitions. [2025-02-08 05:48:02,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 947 transitions, 9838 flow [2025-02-08 05:48:03,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 947 transitions, 9663 flow, removed 38 selfloop flow, removed 7 redundant places. [2025-02-08 05:48:03,279 INFO L231 Difference]: Finished difference. Result has 465 places, 608 transitions, 7031 flow [2025-02-08 05:48:03,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1190, PETRI_DIFFERENCE_MINUEND_FLOW=5042, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=7031, PETRI_PLACES=465, PETRI_TRANSITIONS=608} [2025-02-08 05:48:03,280 INFO L279 CegarLoopForPetriNet]: 1089 programPoint places, -624 predicate places. [2025-02-08 05:48:03,280 INFO L471 AbstractCegarLoop]: Abstraction has has 465 places, 608 transitions, 7031 flow [2025-02-08 05:48:03,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 940.8) internal successors, (18816), 20 states have internal predecessors, (18816), 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-02-08 05:48:03,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:48:03,282 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:48:03,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:48:03,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr8ASSERT_VIOLATIONDATA_RACE, readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-02-08 05:48:03,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash 283297017, now seen corresponding path program 7 times [2025-02-08 05:48:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235535573] [2025-02-08 05:48:03,283 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 05:48:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:03,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:48:03,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:48:03,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:03,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:48:04,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:04,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235535573] [2025-02-08 05:48:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235535573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:04,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:04,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-08 05:48:04,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283084382] [2025-02-08 05:48:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:04,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:48:04,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:04,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:48:04,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380