./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/semaphore.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/semaphore.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 c654263c1c366ef9cc67f02592c2d3fd912134a9cb5af429926a9f4627826820 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:46:47,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:46:47,607 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:47,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:46:47,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:46:47,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:46:47,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:46:47,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:46:47,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:46:47,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:46:47,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:46:47,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:46:47,626 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:46:47,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:46:47,627 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:46:47,628 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:46:47,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:46:47,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:46:47,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:46:47,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:46:47,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:46:47,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:46:47,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:47,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:46:47,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:46:47,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:46:47,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:46:47,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:46:47,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:46:47,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:46:47,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:46:47,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:46:47,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:46:47,629 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 -> c654263c1c366ef9cc67f02592c2d3fd912134a9cb5af429926a9f4627826820 [2025-02-08 05:46:47,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:46:47,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:46:47,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:46:47,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:46:47,930 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:46:47,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/semaphore.i [2025-02-08 05:46:49,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4191ef524/211623069c054a74b69802fdf044f20e/FLAG8fd7fc703 [2025-02-08 05:46:49,644 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:46:49,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/semaphore.i [2025-02-08 05:46:49,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4191ef524/211623069c054a74b69802fdf044f20e/FLAG8fd7fc703 [2025-02-08 05:46:49,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4191ef524/211623069c054a74b69802fdf044f20e [2025-02-08 05:46:49,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:46:49,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:46:49,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:49,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:46:49,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:46:49,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:49" (1/1) ... [2025-02-08 05:46:49,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26edb0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:49, skipping insertion in model container [2025-02-08 05:46:49,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:49" (1/1) ... [2025-02-08 05:46:49,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:46:51,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:51,888 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:46:51,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-08 05:46:51,977 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-08 05:46:51,977 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-08 05:46:51,977 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-08 05:46:51,978 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-08 05:46:51,978 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-08 05:46:51,978 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-08 05:46:51,979 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-08 05:46:51,979 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-08 05:46:51,979 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-08 05:46:51,979 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-08 05:46:51,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-08 05:46:51,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-08 05:46:51,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-08 05:46:51,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-08 05:46:51,981 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-08 05:46:51,981 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-08 05:46:51,981 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-08 05:46:51,981 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-08 05:46:51,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-08 05:46:51,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-08 05:46:51,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-08 05:46:51,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-08 05:46:51,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-08 05:46:51,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-08 05:46:51,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-08 05:46:51,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-08 05:46:51,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-08 05:46:51,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-08 05:46:51,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-08 05:46:51,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-08 05:46:51,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-08 05:46:51,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-08 05:46:51,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-08 05:46:51,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-08 05:46:51,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-08 05:46:51,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-08 05:46:51,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-08 05:46:51,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-08 05:46:51,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-08 05:46:51,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-08 05:46:51,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-08 05:46:51,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-08 05:46:51,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-08 05:46:51,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-08 05:46:51,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-08 05:46:51,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-08 05:46:51,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-08 05:46:51,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-08 05:46:51,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-08 05:46:51,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-08 05:46:51,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-08 05:46:51,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-08 05:46:51,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-08 05:46:51,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-08 05:46:51,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-08 05:46:51,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-08 05:46:51,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-08 05:46:51,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-08 05:46:51,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-08 05:46:51,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-08 05:46:51,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-08 05:46:51,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-08 05:46:51,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-08 05:46:51,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-08 05:46:51,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-08 05:46:51,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-08 05:46:51,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-08 05:46:51,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-08 05:46:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-08 05:46:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-08 05:46:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-08 05:46:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-08 05:46:51,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-08 05:46:51,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-08 05:46:52,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-08 05:46:52,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-08 05:46:52,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-08 05:46:52,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-08 05:46:52,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-08 05:46:52,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-08 05:46:52,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-08 05:46:52,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-08 05:46:52,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-08 05:46:52,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-08 05:46:52,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-08 05:46:52,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-08 05:46:52,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-08 05:46:52,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-08 05:46:52,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-08 05:46:52,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-08 05:46:52,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-08 05:46:52,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-08 05:46:52,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-08 05:46:52,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-08 05:46:52,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-08 05:46:52,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-08 05:46:52,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-08 05:46:52,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-08 05:46:52,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-08 05:46:52,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:52,314 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:46:52,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:52 WrapperNode [2025-02-08 05:46:52,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:52,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:52,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:46:52,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:46:52,321 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:52" (1/1) ... [2025-02-08 05:46:52,379 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:52" (1/1) ... [2025-02-08 05:46:52,445 INFO L138 Inliner]: procedures = 921, calls = 921, calls flagged for inlining = 820, calls inlined = 50, statements flattened = 585 [2025-02-08 05:46:52,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:52,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:46:52,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:46:52,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:46:52,457 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:52" (1/1) ... [2025-02-08 05:46:52,457 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:52" (1/1) ... [2025-02-08 05:46:52,465 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:52" (1/1) ... [2025-02-08 05:46:52,465 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:52" (1/1) ... [2025-02-08 05:46:52,480 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:52" (1/1) ... [2025-02-08 05:46:52,481 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:52" (1/1) ... [2025-02-08 05:46:52,484 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:52" (1/1) ... [2025-02-08 05:46:52,485 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:52" (1/1) ... [2025-02-08 05:46:52,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:46:52,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:46:52,491 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:46:52,491 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:46:52,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:52" (1/1) ... [2025-02-08 05:46:52,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:52,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:52,522 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:52,525 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:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-02-08 05:46:52,543 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-02-08 05:46:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:46:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:46:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:46:52,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:46:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:46:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:46:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:46:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-02-08 05:46:52,543 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-02-08 05:46:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:46:52,544 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:52,694 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:46:52,695 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:46:52,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:52,990 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:52,990 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:52,990 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:52,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041: havoc vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:52,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-1: havoc vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:52,990 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:52,991 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:52,991 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:52,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:52,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-5: havoc vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:52,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-6: havoc vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:52,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:52,991 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:52,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-9: havoc vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:52,991 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:52,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-7: assume 0 != vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:52,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-7: assume !(0 != vatomic32_await_neq_#t~ite674#1); [2025-02-08 05:46:52,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-8: havoc vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:52,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:52,992 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:52,992 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:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:52,992 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:52,992 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:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-15: vatomic32_await_neq_#t~ite674#1 := 1; [2025-02-08 05:46:52,992 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:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 05:46:52,992 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:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-20: vatomic32_await_neq_#t~ret673#1 := vatomic32_read_#res#1; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 05:46:52,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 05:46:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 05:46:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 05:46:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 05:46:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 05:46:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813: assume true; [2025-02-08 05:46:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813: assume !true; [2025-02-08 05:46:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813-1: assume false; [2025-02-08 05:46:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813-1: assume !false; [2025-02-08 05:46:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2425: havoc vatomic32_await_ge_sub_acq_#t~ret202#1; [2025-02-08 05:46:52,993 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:52,993 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:52,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039: havoc vatomic32_await_ge_sub_#t~ret723#1; [2025-02-08 05:46:52,993 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:52,993 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:52,993 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:52,993 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:53,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 05:46:53,173 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L6007-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-08 05:46:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: verification_spin_end_~v#1 := verification_spin_end_#in~v#1; [2025-02-08 05:46:53,388 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:53,388 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:53,388 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:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041: havoc vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5041-1: havoc vatomic32_await_ge_sub_#t~ret724#1; [2025-02-08 05:46:53,388 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:53,388 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:53,388 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:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-2: havoc verification_spin_end_~v#1; [2025-02-08 05:46:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-5: havoc vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-6: havoc vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-3: havoc verification_spin_end_~v#1; [2025-02-08 05:46:53,389 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:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-9: havoc vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:53,389 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:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-7: assume 0 != vatomic32_await_neq_#t~ite674#1; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-7: assume !(0 != vatomic32_await_neq_#t~ite674#1); [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-8: havoc vatomic32_await_neq_#t~ret673#1; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-13: havoc verification_spin_end_~v#1; [2025-02-08 05:46:53,389 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:53,389 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:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-11: havoc verification_spin_end_#in~v#1; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-12: havoc verification_spin_end_~v#1; [2025-02-08 05:46:53,389 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:53,389 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:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-15: vatomic32_await_neq_#t~ite674#1 := 1; [2025-02-08 05:46:53,389 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:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume true; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: assume !true; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume false; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-1: assume !false; [2025-02-08 05:46:53,389 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:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume true; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-2: assume !true; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4812-20: vatomic32_await_neq_#t~ret673#1 := vatomic32_read_#res#1; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume false; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-3: assume !false; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume true; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-4: assume !true; [2025-02-08 05:46:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-5: assume !false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume true; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-6: assume !true; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-7: assume !false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume true; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-8: assume !true; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-9: assume !false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume true; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-10: assume !true; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568-11: assume !false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813: assume true; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813: assume !true; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813-1: assume false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4813-1: assume !false; [2025-02-08 05:46:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2425: havoc vatomic32_await_ge_sub_acq_#t~ret202#1; [2025-02-08 05:46:53,390 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:53,390 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:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5039: havoc vatomic32_await_ge_sub_#t~ret723#1; [2025-02-08 05:46:53,390 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:53,390 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:53,390 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:53,390 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:53,391 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:46:53,393 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:46:53,527 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:46:53,527 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:46:53,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:53 BoogieIcfgContainer [2025-02-08 05:46:53,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:46:53,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:46:53,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:46:53,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:46:53,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:46:49" (1/3) ... [2025-02-08 05:46:53,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c4376e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:53, skipping insertion in model container [2025-02-08 05:46:53,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:52" (2/3) ... [2025-02-08 05:46:53,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c4376e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:53, skipping insertion in model container [2025-02-08 05:46:53,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:53" (3/3) ... [2025-02-08 05:46:53,535 INFO L128 eAbstractionObserver]: Analyzing ICFG semaphore.i [2025-02-08 05:46:53,545 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:46:53,547 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG semaphore.i that has 3 procedures, 496 locations, 1 initial locations, 53 loop locations, and 25 error locations. [2025-02-08 05:46:53,547 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:46:53,726 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:46:53,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 502 places, 565 transitions, 1144 flow [2025-02-08 05:46:54,111 INFO L124 PetriNetUnfolderBase]: 140/1039 cut-off events. [2025-02-08 05:46:54,113 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:46:54,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1039 events. 140/1039 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4248 event pairs, 0 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 594. Up to 12 conditions per place. [2025-02-08 05:46:54,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 502 places, 565 transitions, 1144 flow [2025-02-08 05:46:54,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 502 places, 565 transitions, 1144 flow [2025-02-08 05:46:54,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:54,165 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;@30bf0cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:54,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-02-08 05:46:54,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:54,172 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 05:46:54,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:54,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:54,173 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] [2025-02-08 05:46:54,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:46:54,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2110295466, now seen corresponding path program 1 times [2025-02-08 05:46:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213648102] [2025-02-08 05:46:54,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:54,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:46:54,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:46:54,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:54,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:54,577 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,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:54,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213648102] [2025-02-08 05:46:54,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213648102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:54,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:54,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:46:54,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413962285] [2025-02-08 05:46:54,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:54,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:54,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:54,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:54,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 565 [2025-02-08 05:46:54,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 565 transitions, 1144 flow. Second operand has 2 states, 2 states have (on average 469.5) internal successors, (939), 2 states have internal predecessors, (939), 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,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:54,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 565 [2025-02-08 05:46:54,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:54,863 INFO L124 PetriNetUnfolderBase]: 12/1022 cut-off events. [2025-02-08 05:46:54,863 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:46:54,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 1022 events. 12/1022 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5154 event pairs, 12 based on Foata normal form. 458/1406 useless extension candidates. Maximal degree in co-relation 789. Up to 38 conditions per place. [2025-02-08 05:46:54,880 INFO L140 encePairwiseOnDemand]: 514/565 looper letters, 9 selfloop transitions, 0 changer transitions 0/293 dead transitions. [2025-02-08 05:46:54,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 293 transitions, 612 flow [2025-02-08 05:46:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:46:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:46:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 998 transitions. [2025-02-08 05:46:54,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8831858407079646 [2025-02-08 05:46:54,899 INFO L175 Difference]: Start difference. First operand has 502 places, 565 transitions, 1144 flow. Second operand 2 states and 998 transitions. [2025-02-08 05:46:54,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 293 transitions, 612 flow [2025-02-08 05:46:54,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 293 transitions, 612 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:54,911 INFO L231 Difference]: Finished difference. Result has 299 places, 293 transitions, 594 flow [2025-02-08 05:46:54,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=594, PETRI_PLACES=299, PETRI_TRANSITIONS=293} [2025-02-08 05:46:54,917 INFO L279 CegarLoopForPetriNet]: 502 programPoint places, -203 predicate places. [2025-02-08 05:46:54,917 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 293 transitions, 594 flow [2025-02-08 05:46:54,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 469.5) internal successors, (939), 2 states have internal predecessors, (939), 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,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:54,918 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] [2025-02-08 05:46:54,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:46:54,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:46:54,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:54,921 INFO L85 PathProgramCache]: Analyzing trace with hash -416119102, now seen corresponding path program 1 times [2025-02-08 05:46:54,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:54,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997310275] [2025-02-08 05:46:54,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:54,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:46:54,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:46:54,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:54,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:55,797 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:55,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:55,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997310275] [2025-02-08 05:46:55,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997310275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:55,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:55,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:55,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781503697] [2025-02-08 05:46:55,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:55,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:55,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:55,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:56,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 565 [2025-02-08 05:46:56,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 293 transitions, 594 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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:56,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:56,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 565 [2025-02-08 05:46:56,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:56,536 INFO L124 PetriNetUnfolderBase]: 348/2503 cut-off events. [2025-02-08 05:46:56,536 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:46:56,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 2503 events. 348/2503 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 21154 event pairs, 321 based on Foata normal form. 0/2248 useless extension candidates. Maximal degree in co-relation 3202. Up to 659 conditions per place. [2025-02-08 05:46:56,547 INFO L140 encePairwiseOnDemand]: 555/565 looper letters, 29 selfloop transitions, 18 changer transitions 4/310 dead transitions. [2025-02-08 05:46:56,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 310 transitions, 726 flow [2025-02-08 05:46:56,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2726 transitions. [2025-02-08 05:46:56,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8041297935103244 [2025-02-08 05:46:56,553 INFO L175 Difference]: Start difference. First operand has 299 places, 293 transitions, 594 flow. Second operand 6 states and 2726 transitions. [2025-02-08 05:46:56,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 310 transitions, 726 flow [2025-02-08 05:46:56,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 310 transitions, 726 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:56,558 INFO L231 Difference]: Finished difference. Result has 309 places, 306 transitions, 710 flow [2025-02-08 05:46:56,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=309, PETRI_TRANSITIONS=306} [2025-02-08 05:46:56,559 INFO L279 CegarLoopForPetriNet]: 502 programPoint places, -193 predicate places. [2025-02-08 05:46:56,559 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 306 transitions, 710 flow [2025-02-08 05:46:56,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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:56,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:56,561 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] [2025-02-08 05:46:56,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:46:56,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:46:56,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:56,561 INFO L85 PathProgramCache]: Analyzing trace with hash 648317518, now seen corresponding path program 1 times [2025-02-08 05:46:56,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:56,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033278316] [2025-02-08 05:46:56,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:56,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:46:56,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:46:56,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:56,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:56,646 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:56,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:56,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033278316] [2025-02-08 05:46:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033278316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:56,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:56,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:56,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307141548] [2025-02-08 05:46:56,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:56,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:56,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:56,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:56,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:56,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 565 [2025-02-08 05:46:56,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 306 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 464.6666666666667) internal successors, (1394), 3 states have internal predecessors, (1394), 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:56,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:56,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 565 [2025-02-08 05:46:56,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:56,859 INFO L124 PetriNetUnfolderBase]: 38/1339 cut-off events. [2025-02-08 05:46:56,860 INFO L125 PetriNetUnfolderBase]: For 103/156 co-relation queries the response was YES. [2025-02-08 05:46:56,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 1339 events. 38/1339 cut-off events. For 103/156 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8550 event pairs, 18 based on Foata normal form. 4/1249 useless extension candidates. Maximal degree in co-relation 1559. Up to 77 conditions per place. [2025-02-08 05:46:56,871 INFO L140 encePairwiseOnDemand]: 562/565 looper letters, 28 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-02-08 05:46:56,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 310 transitions, 788 flow [2025-02-08 05:46:56,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2025-02-08 05:46:56,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8300884955752212 [2025-02-08 05:46:56,875 INFO L175 Difference]: Start difference. First operand has 309 places, 306 transitions, 710 flow. Second operand 3 states and 1407 transitions. [2025-02-08 05:46:56,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 310 transitions, 788 flow [2025-02-08 05:46:56,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 310 transitions, 788 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:56,883 INFO L231 Difference]: Finished difference. Result has 308 places, 306 transitions, 718 flow [2025-02-08 05:46:56,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=565, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=308, PETRI_TRANSITIONS=306} [2025-02-08 05:46:56,885 INFO L279 CegarLoopForPetriNet]: 502 programPoint places, -194 predicate places. [2025-02-08 05:46:56,885 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 306 transitions, 718 flow [2025-02-08 05:46:56,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 464.6666666666667) internal successors, (1394), 3 states have internal predecessors, (1394), 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:56,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:56,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:56,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:46:56,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:46:56,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:56,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2135487855, now seen corresponding path program 1 times [2025-02-08 05:46:56,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:56,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723342610] [2025-02-08 05:46:56,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:56,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:56,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:46:56,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:46:56,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:56,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:56,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:56,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:46:56,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:46:56,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:56,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:56,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:56,993 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:56,997 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2025-02-08 05:46:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-02-08 05:46:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-02-08 05:46:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-02-08 05:46:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-02-08 05:46:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-02-08 05:46:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (38 of 45 remaining) [2025-02-08 05:46:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-02-08 05:46:56,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-02-08 05:46:56,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (20 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (19 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (18 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-02-08 05:46:57,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr9ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr7ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr6ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr8ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr5ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-02-08 05:46:57,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-02-08 05:46:57,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:46:57,002 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:46:57,003 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:46:57,003 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:46:57,182 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 05:46:57,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 853 places, 954 transitions, 1940 flow [2025-02-08 05:46:58,025 INFO L124 PetriNetUnfolderBase]: 399/2859 cut-off events. [2025-02-08 05:46:58,025 INFO L125 PetriNetUnfolderBase]: For 40/52 co-relation queries the response was YES. [2025-02-08 05:46:58,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 2859 events. 399/2859 cut-off events. For 40/52 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 17174 event pairs, 1 based on Foata normal form. 0/2278 useless extension candidates. Maximal degree in co-relation 1756. Up to 48 conditions per place. [2025-02-08 05:46:58,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 853 places, 954 transitions, 1940 flow [2025-02-08 05:46:58,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 853 places, 954 transitions, 1940 flow [2025-02-08 05:46:58,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:58,114 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;@30bf0cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:58,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2025-02-08 05:46:58,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:58,115 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 05:46:58,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:58,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:58,115 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] [2025-02-08 05:46:58,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:46:58,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash -522160170, now seen corresponding path program 1 times [2025-02-08 05:46:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:58,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590010516] [2025-02-08 05:46:58,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:58,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:58,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:46:58,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:46:58,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:58,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:58,182 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:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:58,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590010516] [2025-02-08 05:46:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590010516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:58,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:46:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136022591] [2025-02-08 05:46:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:58,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:46:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:58,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:46:58,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:46:58,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 954 [2025-02-08 05:46:58,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 853 places, 954 transitions, 1940 flow. Second operand has 2 states, 2 states have (on average 790.5) internal successors, (1581), 2 states have internal predecessors, (1581), 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:58,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:58,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 954 [2025-02-08 05:46:58,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:01,495 INFO L124 PetriNetUnfolderBase]: 804/16764 cut-off events. [2025-02-08 05:47:01,495 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2025-02-08 05:47:01,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18323 conditions, 16764 events. 804/16764 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 206775 event pairs, 804 based on Foata normal form. 9290/24862 useless extension candidates. Maximal degree in co-relation 4349. Up to 1246 conditions per place. [2025-02-08 05:47:01,646 INFO L140 encePairwiseOnDemand]: 879/954 looper letters, 17 selfloop transitions, 0 changer transitions 0/445 dead transitions. [2025-02-08 05:47:01,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 445 transitions, 944 flow [2025-02-08 05:47:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:47:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:47:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1672 transitions. [2025-02-08 05:47:01,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8763102725366876 [2025-02-08 05:47:01,650 INFO L175 Difference]: Start difference. First operand has 853 places, 954 transitions, 1940 flow. Second operand 2 states and 1672 transitions. [2025-02-08 05:47:01,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 445 transitions, 944 flow [2025-02-08 05:47:01,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 445 transitions, 944 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:01,655 INFO L231 Difference]: Finished difference. Result has 455 places, 445 transitions, 910 flow [2025-02-08 05:47:01,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=954, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=910, PETRI_PLACES=455, PETRI_TRANSITIONS=445} [2025-02-08 05:47:01,656 INFO L279 CegarLoopForPetriNet]: 853 programPoint places, -398 predicate places. [2025-02-08 05:47:01,657 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 445 transitions, 910 flow [2025-02-08 05:47:01,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 790.5) internal successors, (1581), 2 states have internal predecessors, (1581), 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:01,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:01,657 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] [2025-02-08 05:47:01,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:47:01,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:47:01,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:01,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2027014142, now seen corresponding path program 1 times [2025-02-08 05:47:01,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:01,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117166401] [2025-02-08 05:47:01,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:01,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:47:01,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:47:01,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:01,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:02,215 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:47:02,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117166401] [2025-02-08 05:47:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117166401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071193920] [2025-02-08 05:47:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:02,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:47:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:02,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:47:02,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:47:02,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 954 [2025-02-08 05:47:02,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 445 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 768.6666666666666) internal successors, (4612), 6 states have internal predecessors, (4612), 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,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:02,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 954 [2025-02-08 05:47:02,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:11,961 INFO L124 PetriNetUnfolderBase]: 12521/44405 cut-off events. [2025-02-08 05:47:11,961 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2025-02-08 05:47:12,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62402 conditions, 44405 events. 12521/44405 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 571354 event pairs, 12297 based on Foata normal form. 0/40198 useless extension candidates. Maximal degree in co-relation 62395. Up to 17546 conditions per place. [2025-02-08 05:47:12,388 INFO L140 encePairwiseOnDemand]: 941/954 looper letters, 38 selfloop transitions, 30 changer transitions 4/475 dead transitions. [2025-02-08 05:47:12,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 475 transitions, 1115 flow [2025-02-08 05:47:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4673 transitions. [2025-02-08 05:47:12,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.81638714185884 [2025-02-08 05:47:12,401 INFO L175 Difference]: Start difference. First operand has 455 places, 445 transitions, 910 flow. Second operand 6 states and 4673 transitions. [2025-02-08 05:47:12,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 475 transitions, 1115 flow [2025-02-08 05:47:12,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 475 transitions, 1115 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:12,410 INFO L231 Difference]: Finished difference. Result has 465 places, 470 transitions, 1104 flow [2025-02-08 05:47:12,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=954, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1104, PETRI_PLACES=465, PETRI_TRANSITIONS=470} [2025-02-08 05:47:12,412 INFO L279 CegarLoopForPetriNet]: 853 programPoint places, -388 predicate places. [2025-02-08 05:47:12,413 INFO L471 AbstractCegarLoop]: Abstraction has has 465 places, 470 transitions, 1104 flow [2025-02-08 05:47:12,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 768.6666666666666) internal successors, (4612), 6 states have internal predecessors, (4612), 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,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:12,415 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] [2025-02-08 05:47:12,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:47:12,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:47:12,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash 229598574, now seen corresponding path program 1 times [2025-02-08 05:47:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:12,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146751619] [2025-02-08 05:47:12,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:12,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 05:47:12,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 05:47:12,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:12,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:12,478 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:47:12,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:12,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146751619] [2025-02-08 05:47:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146751619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:12,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:12,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:47:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375292837] [2025-02-08 05:47:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:12,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:47:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:12,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:47:12,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:47:12,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 784 out of 954 [2025-02-08 05:47:12,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 470 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 785.6666666666666) internal successors, (2357), 3 states have internal predecessors, (2357), 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,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:12,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 784 of 954 [2025-02-08 05:47:12,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:16,303 INFO L124 PetriNetUnfolderBase]: 1111/18602 cut-off events. [2025-02-08 05:47:16,303 INFO L125 PetriNetUnfolderBase]: For 1559/2029 co-relation queries the response was YES. [2025-02-08 05:47:16,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21932 conditions, 18602 events. 1111/18602 cut-off events. For 1559/2029 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 233879 event pairs, 932 based on Foata normal form. 4/17245 useless extension candidates. Maximal degree in co-relation 21920. Up to 1639 conditions per place. [2025-02-08 05:47:16,498 INFO L140 encePairwiseOnDemand]: 951/954 looper letters, 49 selfloop transitions, 2 changer transitions 0/475 dead transitions. [2025-02-08 05:47:16,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 475 transitions, 1226 flow [2025-02-08 05:47:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:47:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:47:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2379 transitions. [2025-02-08 05:47:16,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8312368972746331 [2025-02-08 05:47:16,503 INFO L175 Difference]: Start difference. First operand has 465 places, 470 transitions, 1104 flow. Second operand 3 states and 2379 transitions. [2025-02-08 05:47:16,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 475 transitions, 1226 flow [2025-02-08 05:47:16,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 475 transitions, 1226 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:47:16,511 INFO L231 Difference]: Finished difference. Result has 464 places, 471 transitions, 1116 flow [2025-02-08 05:47:16,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=954, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1116, PETRI_PLACES=464, PETRI_TRANSITIONS=471} [2025-02-08 05:47:16,513 INFO L279 CegarLoopForPetriNet]: 853 programPoint places, -389 predicate places. [2025-02-08 05:47:16,513 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 471 transitions, 1116 flow [2025-02-08 05:47:16,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 785.6666666666666) internal successors, (2357), 3 states have internal predecessors, (2357), 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:16,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:16,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:47:16,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:47:16,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1748220297, now seen corresponding path program 1 times [2025-02-08 05:47:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436231887] [2025-02-08 05:47:16,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:16,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:16,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:47:16,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:47:16,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:16,811 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:47:16,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:16,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436231887] [2025-02-08 05:47:16,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436231887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:16,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:16,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196050877] [2025-02-08 05:47:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:16,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:47:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:16,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:47:16,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:47:16,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 782 out of 954 [2025-02-08 05:47:16,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 471 transitions, 1116 flow. Second operand has 5 states, 5 states have (on average 783.8) internal successors, (3919), 5 states have internal predecessors, (3919), 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:16,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:16,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 782 of 954 [2025-02-08 05:47:16,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:20,045 INFO L124 PetriNetUnfolderBase]: 1051/15691 cut-off events. [2025-02-08 05:47:20,046 INFO L125 PetriNetUnfolderBase]: For 1476/2013 co-relation queries the response was YES. [2025-02-08 05:47:20,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18888 conditions, 15691 events. 1051/15691 cut-off events. For 1476/2013 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 190208 event pairs, 515 based on Foata normal form. 47/14623 useless extension candidates. Maximal degree in co-relation 18874. Up to 1385 conditions per place. [2025-02-08 05:47:20,171 INFO L140 encePairwiseOnDemand]: 949/954 looper letters, 75 selfloop transitions, 5 changer transitions 0/502 dead transitions. [2025-02-08 05:47:20,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 502 transitions, 1424 flow [2025-02-08 05:47:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:47:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:47:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4735 transitions. [2025-02-08 05:47:20,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8272187281621244 [2025-02-08 05:47:20,178 INFO L175 Difference]: Start difference. First operand has 464 places, 471 transitions, 1116 flow. Second operand 6 states and 4735 transitions. [2025-02-08 05:47:20,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 502 transitions, 1424 flow [2025-02-08 05:47:20,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 502 transitions, 1422 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:47:20,185 INFO L231 Difference]: Finished difference. Result has 471 places, 473 transitions, 1140 flow [2025-02-08 05:47:20,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=954, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1140, PETRI_PLACES=471, PETRI_TRANSITIONS=473} [2025-02-08 05:47:20,186 INFO L279 CegarLoopForPetriNet]: 853 programPoint places, -382 predicate places. [2025-02-08 05:47:20,186 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 473 transitions, 1140 flow [2025-02-08 05:47:20,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 783.8) internal successors, (3919), 5 states have internal predecessors, (3919), 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:20,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:20,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:20,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:47:20,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:47:20,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash -970256489, now seen corresponding path program 1 times [2025-02-08 05:47:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:20,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947681630] [2025-02-08 05:47:20,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:20,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:20,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 05:47:20,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 05:47:20,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:20,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:20,369 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:47:20,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:20,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947681630] [2025-02-08 05:47:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947681630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:20,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:20,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:47:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835589573] [2025-02-08 05:47:20,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:20,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:47:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:20,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:47:20,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:47:20,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 781 out of 954 [2025-02-08 05:47:20,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 473 transitions, 1140 flow. Second operand has 7 states, 7 states have (on average 783.0) internal successors, (5481), 7 states have internal predecessors, (5481), 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:20,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:20,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 781 of 954 [2025-02-08 05:47:20,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:47:24,200 INFO L124 PetriNetUnfolderBase]: 857/14203 cut-off events. [2025-02-08 05:47:24,200 INFO L125 PetriNetUnfolderBase]: For 1099/1281 co-relation queries the response was YES. [2025-02-08 05:47:24,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16715 conditions, 14203 events. 857/14203 cut-off events. For 1099/1281 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 169853 event pairs, 214 based on Foata normal form. 87/13250 useless extension candidates. Maximal degree in co-relation 16698. Up to 1035 conditions per place. [2025-02-08 05:47:24,331 INFO L140 encePairwiseOnDemand]: 948/954 looper letters, 68 selfloop transitions, 8 changer transitions 0/496 dead transitions. [2025-02-08 05:47:24,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 496 transitions, 1362 flow [2025-02-08 05:47:24,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:47:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:47:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 7092 transitions. [2025-02-08 05:47:24,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8259958071278826 [2025-02-08 05:47:24,341 INFO L175 Difference]: Start difference. First operand has 471 places, 473 transitions, 1140 flow. Second operand 9 states and 7092 transitions. [2025-02-08 05:47:24,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 496 transitions, 1362 flow [2025-02-08 05:47:24,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 496 transitions, 1355 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 05:47:24,350 INFO L231 Difference]: Finished difference. Result has 476 places, 461 transitions, 1083 flow [2025-02-08 05:47:24,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=954, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1083, PETRI_PLACES=476, PETRI_TRANSITIONS=461} [2025-02-08 05:47:24,351 INFO L279 CegarLoopForPetriNet]: 853 programPoint places, -377 predicate places. [2025-02-08 05:47:24,351 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 461 transitions, 1083 flow [2025-02-08 05:47:24,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 783.0) internal successors, (5481), 7 states have internal predecessors, (5481), 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,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:47:24,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:47:24,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:47:24,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [readerErr7ASSERT_VIOLATIONDATA_RACE, readerErr5ASSERT_VIOLATIONDATA_RACE, readerErr4ASSERT_VIOLATIONDATA_RACE, readerErr6ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:47:24,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:47:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1056391375, now seen corresponding path program 1 times [2025-02-08 05:47:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:47:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521836702] [2025-02-08 05:47:24,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:47:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:47:24,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:47:24,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:47:24,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:47:24,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:47:25,132 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:47:25,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:47:25,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521836702] [2025-02-08 05:47:25,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521836702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:47:25,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:47:25,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:47:25,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47938740] [2025-02-08 05:47:25,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:47:25,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:47:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:47:25,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:47:25,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:47:25,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 767 out of 954 [2025-02-08 05:47:25,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 461 transitions, 1083 flow. Second operand has 6 states, 6 states have (on average 769.6666666666666) internal successors, (4618), 6 states have internal predecessors, (4618), 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:25,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:47:25,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 767 of 954 [2025-02-08 05:47:25,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand