./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/libvsync/hclhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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/hclhlock.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 b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:38:05,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:38:05,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:38:05,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:38:05,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:38:05,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:38:05,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:38:05,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:38:05,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:38:05,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:38:05,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:38:05,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:38:05,701 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:38:05,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:38:05,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:38:05,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:38:05,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:38:05,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:38:05,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:38:05,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:38:05,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:38:05,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:38:05,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:38:05,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:38:05,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:38:05,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:38:05,703 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 -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-02-06 09:38:05,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:38:05,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:38:05,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:38:05,924 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:38:05,924 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:38:05,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-02-06 09:38:07,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d1696c96/473805cb48824f5e8e7555e7f1664493/FLAG2d979f9fc [2025-02-06 09:38:07,575 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:38:07,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-02-06 09:38:07,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d1696c96/473805cb48824f5e8e7555e7f1664493/FLAG2d979f9fc [2025-02-06 09:38:07,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d1696c96/473805cb48824f5e8e7555e7f1664493 [2025-02-06 09:38:07,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:38:07,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:38:07,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:38:07,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:38:07,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:38:07,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:38:07" (1/1) ... [2025-02-06 09:38:07,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba96874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:07, skipping insertion in model container [2025-02-06 09:38:07,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:38:07" (1/1) ... [2025-02-06 09:38:07,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:38:09,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:38:09,925 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:38:09,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-06 09:38:09,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-06 09:38:09,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-06 09:38:09,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-06 09:38:09,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-06 09:38:10,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-06 09:38:10,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-06 09:38:10,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-06 09:38:10,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-06 09:38:10,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-06 09:38:10,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-06 09:38:10,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-06 09:38:10,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-06 09:38:10,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-06 09:38:10,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-06 09:38:10,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-06 09:38:10,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-06 09:38:10,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-06 09:38:10,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-06 09:38:10,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-06 09:38:10,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-06 09:38:10,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-06 09:38:10,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-06 09:38:10,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-06 09:38:10,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-06 09:38:10,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-06 09:38:10,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-06 09:38:10,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-06 09:38:10,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-06 09:38:10,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-06 09:38:10,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-06 09:38:10,013 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-06 09:38:10,013 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-06 09:38:10,014 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-06 09:38:10,015 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-06 09:38:10,015 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-06 09:38:10,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-06 09:38:10,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-06 09:38:10,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-06 09:38:10,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-06 09:38:10,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-06 09:38:10,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-06 09:38:10,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-06 09:38:10,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-06 09:38:10,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-06 09:38:10,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-06 09:38:10,022 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-06 09:38:10,023 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-06 09:38:10,023 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-06 09:38:10,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-06 09:38:10,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-06 09:38:10,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-06 09:38:10,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-06 09:38:10,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-06 09:38:10,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-06 09:38:10,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-06 09:38:10,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-06 09:38:10,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-06 09:38:10,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-06 09:38:10,030 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-06 09:38:10,030 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-06 09:38:10,030 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-06 09:38:10,031 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-06 09:38:10,031 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-06 09:38:10,031 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-06 09:38:10,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-06 09:38:10,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-06 09:38:10,032 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-06 09:38:10,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-06 09:38:10,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-06 09:38:10,033 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-06 09:38:10,034 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-06 09:38:10,034 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-06 09:38:10,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-06 09:38:10,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-06 09:38:10,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-06 09:38:10,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-06 09:38:10,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-06 09:38:10,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-06 09:38:10,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-06 09:38:10,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-06 09:38:10,040 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-06 09:38:10,041 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-06 09:38:10,041 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-06 09:38:10,041 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-06 09:38:10,041 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-06 09:38:10,041 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-06 09:38:10,042 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-06 09:38:10,042 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-06 09:38:10,042 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-06 09:38:10,043 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-06 09:38:10,043 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-06 09:38:10,043 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-06 09:38:10,044 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-06 09:38:10,044 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-06 09:38:10,044 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-06 09:38:10,044 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-06 09:38:10,045 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-06 09:38:10,045 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-06 09:38:10,045 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-06 09:38:10,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:38:10,298 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:38:10,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10 WrapperNode [2025-02-06 09:38:10,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:38:10,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:38:10,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:38:10,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:38:10,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,418 INFO L138 Inliner]: procedures = 921, calls = 972, calls flagged for inlining = 848, calls inlined = 84, statements flattened = 1082 [2025-02-06 09:38:10,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:38:10,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:38:10,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:38:10,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:38:10,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:38:10,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:38:10,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:38:10,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:38:10,484 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (1/1) ... [2025-02-06 09:38:10,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:38:10,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:10,519 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-06 09:38:10,522 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-06 09:38:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:38:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:38:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:38:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:38:10,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:38:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-06 09:38:10,540 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-06 09:38:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:38:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:38:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:38:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:38:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:38:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:38:10,542 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:38:10,687 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:38:10,689 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:38:11,103 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-06 09:38:11,104 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-06 09:38:11,770 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-06 09:38:11,770 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-06 09:38:11,770 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-06 09:38:11,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-27: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-06 09:38:11,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-02-06 09:38:11,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-9: havoc vatomic32_read_acq_#t~ret113#1; [2025-02-06 09:38:11,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-02-06 09:38:11,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-9: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-02-06 09:38:11,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-02-06 09:38:11,771 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-02-06 09:38:11,772 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:38:11,772 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:38:11,957 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:38:11,958 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:38:11,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:38:11 BoogieIcfgContainer [2025-02-06 09:38:11,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:38:11,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:38:11,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:38:11,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:38:11,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:38:07" (1/3) ... [2025-02-06 09:38:11,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e91f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:38:11, skipping insertion in model container [2025-02-06 09:38:11,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:38:10" (2/3) ... [2025-02-06 09:38:11,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e91f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:38:11, skipping insertion in model container [2025-02-06 09:38:11,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:38:11" (3/3) ... [2025-02-06 09:38:11,969 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-02-06 09:38:11,983 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:38:11,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 1103 locations, 1 initial locations, 60 loop locations, and 42 error locations. [2025-02-06 09:38:11,984 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:38:12,231 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:38:12,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1106 places, 1272 transitions, 2551 flow [2025-02-06 09:38:12,674 INFO L124 PetriNetUnfolderBase]: 183/1351 cut-off events. [2025-02-06 09:38:12,678 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:38:12,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 1351 events. 183/1351 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4777 event pairs, 0 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 1026. Up to 6 conditions per place. [2025-02-06 09:38:12,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 1106 places, 1272 transitions, 2551 flow [2025-02-06 09:38:12,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1106 places, 1272 transitions, 2551 flow [2025-02-06 09:38:12,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:38:12,746 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;@7eabd3f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:38:12,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-02-06 09:38:12,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:38:12,756 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-02-06 09:38:12,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:38:12,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:12,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:12,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:12,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1859063657, now seen corresponding path program 1 times [2025-02-06 09:38:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:12,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547362447] [2025-02-06 09:38:12,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:12,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 09:38:12,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 09:38:12,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:12,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:13,179 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-06 09:38:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547362447] [2025-02-06 09:38:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547362447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:13,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:13,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 09:38:13,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445620774] [2025-02-06 09:38:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:13,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:38:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:13,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:38:13,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:38:13,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1086 out of 1272 [2025-02-06 09:38:13,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1106 places, 1272 transitions, 2551 flow. Second operand has 2 states, 2 states have (on average 1086.5) internal successors, (2173), 2 states have internal predecessors, (2173), 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-06 09:38:13,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:13,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1086 of 1272 [2025-02-06 09:38:13,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:13,577 INFO L124 PetriNetUnfolderBase]: 33/1139 cut-off events. [2025-02-06 09:38:13,578 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:38:13,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 1139 events. 33/1139 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3000 event pairs, 0 based on Foata normal form. 346/1404 useless extension candidates. Maximal degree in co-relation 889. Up to 30 conditions per place. [2025-02-06 09:38:13,590 INFO L140 encePairwiseOnDemand]: 1115/1272 looper letters, 29 selfloop transitions, 0 changer transitions 12/1078 dead transitions. [2025-02-06 09:38:13,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 1078 transitions, 2221 flow [2025-02-06 09:38:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:38:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:38:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2358 transitions. [2025-02-06 09:38:13,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9268867924528302 [2025-02-06 09:38:13,650 INFO L175 Difference]: Start difference. First operand has 1106 places, 1272 transitions, 2551 flow. Second operand 2 states and 2358 transitions. [2025-02-06 09:38:13,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 1078 transitions, 2221 flow [2025-02-06 09:38:13,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1049 places, 1078 transitions, 2221 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:13,670 INFO L231 Difference]: Finished difference. Result has 1049 places, 1066 transitions, 2139 flow [2025-02-06 09:38:13,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=1048, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1078, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1078, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2139, PETRI_PLACES=1049, PETRI_TRANSITIONS=1066} [2025-02-06 09:38:13,676 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -57 predicate places. [2025-02-06 09:38:13,676 INFO L471 AbstractCegarLoop]: Abstraction has has 1049 places, 1066 transitions, 2139 flow [2025-02-06 09:38:13,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1086.5) internal successors, (2173), 2 states have internal predecessors, (2173), 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-06 09:38:13,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:13,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:13,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:38:13,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:13,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1623563853, now seen corresponding path program 1 times [2025-02-06 09:38:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:13,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028007715] [2025-02-06 09:38:13,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:13,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:13,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 09:38:13,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 09:38:13,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:13,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:13,847 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-06 09:38:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:13,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028007715] [2025-02-06 09:38:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028007715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:13,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:38:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821232223] [2025-02-06 09:38:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:13,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:13,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:13,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:13,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:13,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1080 out of 1272 [2025-02-06 09:38:13,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1049 places, 1066 transitions, 2139 flow. Second operand has 3 states, 3 states have (on average 1082.3333333333333) internal successors, (3247), 3 states have internal predecessors, (3247), 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-06 09:38:13,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:13,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1080 of 1272 [2025-02-06 09:38:13,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:14,118 INFO L124 PetriNetUnfolderBase]: 33/1145 cut-off events. [2025-02-06 09:38:14,118 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:38:14,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 1145 events. 33/1145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2932 event pairs, 0 based on Foata normal form. 1/1070 useless extension candidates. Maximal degree in co-relation 1185. Up to 33 conditions per place. [2025-02-06 09:38:14,127 INFO L140 encePairwiseOnDemand]: 1269/1272 looper letters, 35 selfloop transitions, 2 changer transitions 0/1068 dead transitions. [2025-02-06 09:38:14,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 1068 transitions, 2217 flow [2025-02-06 09:38:14,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3278 transitions. [2025-02-06 09:38:14,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590146750524109 [2025-02-06 09:38:14,133 INFO L175 Difference]: Start difference. First operand has 1049 places, 1066 transitions, 2139 flow. Second operand 3 states and 3278 transitions. [2025-02-06 09:38:14,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1039 places, 1068 transitions, 2217 flow [2025-02-06 09:38:14,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1039 places, 1068 transitions, 2217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:14,148 INFO L231 Difference]: Finished difference. Result has 1040 places, 1067 transitions, 2151 flow [2025-02-06 09:38:14,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=2139, PETRI_DIFFERENCE_MINUEND_PLACES=1037, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1066, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1064, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=1040, PETRI_TRANSITIONS=1067} [2025-02-06 09:38:14,150 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -66 predicate places. [2025-02-06 09:38:14,150 INFO L471 AbstractCegarLoop]: Abstraction has has 1040 places, 1067 transitions, 2151 flow [2025-02-06 09:38:14,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1082.3333333333333) internal successors, (3247), 3 states have internal predecessors, (3247), 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-06 09:38:14,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:14,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:14,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:38:14,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:14,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1414290432, now seen corresponding path program 1 times [2025-02-06 09:38:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:14,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565004439] [2025-02-06 09:38:14,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:14,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:38:14,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:38:14,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:14,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:14,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:14,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565004439] [2025-02-06 09:38:14,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565004439] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:14,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3574239] [2025-02-06 09:38:14,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:14,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:14,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:14,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:14,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:38:14,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:38:14,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:38:14,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:14,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:14,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:38:14,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:14,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:38:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:38:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3574239] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:14,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 09:38:14,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-02-06 09:38:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905238491] [2025-02-06 09:38:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:14,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:14,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:14,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:14,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:38:14,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1079 out of 1272 [2025-02-06 09:38:14,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1040 places, 1067 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 1081.6666666666667) internal successors, (3245), 3 states have internal predecessors, (3245), 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-06 09:38:14,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:14,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1079 of 1272 [2025-02-06 09:38:14,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:14,878 INFO L124 PetriNetUnfolderBase]: 33/1146 cut-off events. [2025-02-06 09:38:14,879 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:38:14,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 1146 events. 33/1146 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2479 event pairs, 0 based on Foata normal form. 0/1070 useless extension candidates. Maximal degree in co-relation 1192. Up to 33 conditions per place. [2025-02-06 09:38:14,887 INFO L140 encePairwiseOnDemand]: 1268/1272 looper letters, 34 selfloop transitions, 3 changer transitions 0/1068 dead transitions. [2025-02-06 09:38:14,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 1068 transitions, 2227 flow [2025-02-06 09:38:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3275 transitions. [2025-02-06 09:38:14,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8582285115303984 [2025-02-06 09:38:14,893 INFO L175 Difference]: Start difference. First operand has 1040 places, 1067 transitions, 2151 flow. Second operand 3 states and 3275 transitions. [2025-02-06 09:38:14,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 1068 transitions, 2227 flow [2025-02-06 09:38:14,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1041 places, 1068 transitions, 2225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:38:14,907 INFO L231 Difference]: Finished difference. Result has 1043 places, 1068 transitions, 2167 flow [2025-02-06 09:38:14,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1064, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2167, PETRI_PLACES=1043, PETRI_TRANSITIONS=1068} [2025-02-06 09:38:14,909 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -63 predicate places. [2025-02-06 09:38:14,909 INFO L471 AbstractCegarLoop]: Abstraction has has 1043 places, 1068 transitions, 2167 flow [2025-02-06 09:38:14,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1081.6666666666667) internal successors, (3245), 3 states have internal predecessors, (3245), 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-06 09:38:14,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:14,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:14,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:38:15,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:15,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:15,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1383392318, now seen corresponding path program 1 times [2025-02-06 09:38:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:15,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670157135] [2025-02-06 09:38:15,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:15,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:15,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 09:38:15,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 09:38:15,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:15,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:15,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:15,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670157135] [2025-02-06 09:38:15,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670157135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:15,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396979089] [2025-02-06 09:38:15,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:15,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:15,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:15,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:15,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:38:15,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 09:38:15,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 09:38:15,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:15,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:15,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 09:38:15,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:15,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 09:38:15,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-06 09:38:15,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:15,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-02-06 09:38:15,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:15,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-02-06 09:38:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:38:15,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:38:15,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396979089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:15,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:38:15,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-06 09:38:15,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120346669] [2025-02-06 09:38:15,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:15,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:15,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:15,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:15,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:38:15,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1272 [2025-02-06 09:38:15,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1043 places, 1068 transitions, 2167 flow. Second operand has 6 states, 6 states have (on average 1029.0) internal successors, (6174), 6 states have internal predecessors, (6174), 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-06 09:38:15,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:15,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1272 [2025-02-06 09:38:15,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:17,290 INFO L124 PetriNetUnfolderBase]: 690/7900 cut-off events. [2025-02-06 09:38:17,290 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:38:17,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8956 conditions, 7900 events. 690/7900 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 67693 event pairs, 432 based on Foata normal form. 0/7390 useless extension candidates. Maximal degree in co-relation 8949. Up to 1029 conditions per place. [2025-02-06 09:38:17,321 INFO L140 encePairwiseOnDemand]: 1266/1272 looper letters, 82 selfloop transitions, 5 changer transitions 0/1067 dead transitions. [2025-02-06 09:38:17,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1047 places, 1067 transitions, 2339 flow [2025-02-06 09:38:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6250 transitions. [2025-02-06 09:38:17,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8189203354297694 [2025-02-06 09:38:17,331 INFO L175 Difference]: Start difference. First operand has 1043 places, 1068 transitions, 2167 flow. Second operand 6 states and 6250 transitions. [2025-02-06 09:38:17,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1047 places, 1067 transitions, 2339 flow [2025-02-06 09:38:17,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 1067 transitions, 2333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:38:17,343 INFO L231 Difference]: Finished difference. Result has 1045 places, 1067 transitions, 2169 flow [2025-02-06 09:38:17,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=2159, PETRI_DIFFERENCE_MINUEND_PLACES=1040, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2169, PETRI_PLACES=1045, PETRI_TRANSITIONS=1067} [2025-02-06 09:38:17,345 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -61 predicate places. [2025-02-06 09:38:17,345 INFO L471 AbstractCegarLoop]: Abstraction has has 1045 places, 1067 transitions, 2169 flow [2025-02-06 09:38:17,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1029.0) internal successors, (6174), 6 states have internal predecessors, (6174), 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-06 09:38:17,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:17,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:17,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:38:17,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:17,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:17,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash 130631609, now seen corresponding path program 1 times [2025-02-06 09:38:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:17,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437825450] [2025-02-06 09:38:17,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:17,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:17,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 09:38:17,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:38:17,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:17,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:17,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437825450] [2025-02-06 09:38:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437825450] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604449559] [2025-02-06 09:38:17,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:17,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:17,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:17,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:17,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:38:17,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 09:38:17,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:38:17,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:17,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:17,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 09:38:17,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:17,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 09:38:17,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 09:38:17,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:17,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-02-06 09:38:18,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:18,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-02-06 09:38:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:38:18,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:38:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604449559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:18,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:38:18,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-06 09:38:18,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343059549] [2025-02-06 09:38:18,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:18,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:18,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:18,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:38:18,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1272 [2025-02-06 09:38:18,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1045 places, 1067 transitions, 2169 flow. Second operand has 6 states, 6 states have (on average 1029.0) internal successors, (6174), 6 states have internal predecessors, (6174), 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-06 09:38:18,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:18,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1272 [2025-02-06 09:38:18,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:19,594 INFO L124 PetriNetUnfolderBase]: 690/7899 cut-off events. [2025-02-06 09:38:19,595 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:38:19,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8957 conditions, 7899 events. 690/7899 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 67691 event pairs, 432 based on Foata normal form. 0/7389 useless extension candidates. Maximal degree in co-relation 8950. Up to 1029 conditions per place. [2025-02-06 09:38:19,624 INFO L140 encePairwiseOnDemand]: 1266/1272 looper letters, 82 selfloop transitions, 5 changer transitions 0/1066 dead transitions. [2025-02-06 09:38:19,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 1066 transitions, 2341 flow [2025-02-06 09:38:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6250 transitions. [2025-02-06 09:38:19,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8189203354297694 [2025-02-06 09:38:19,636 INFO L175 Difference]: Start difference. First operand has 1045 places, 1067 transitions, 2169 flow. Second operand 6 states and 6250 transitions. [2025-02-06 09:38:19,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 1066 transitions, 2341 flow [2025-02-06 09:38:19,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 1066 transitions, 2331 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:38:19,651 INFO L231 Difference]: Finished difference. Result has 1044 places, 1066 transitions, 2167 flow [2025-02-06 09:38:19,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1066, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2167, PETRI_PLACES=1044, PETRI_TRANSITIONS=1066} [2025-02-06 09:38:19,653 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -62 predicate places. [2025-02-06 09:38:19,653 INFO L471 AbstractCegarLoop]: Abstraction has has 1044 places, 1066 transitions, 2167 flow [2025-02-06 09:38:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1029.0) internal successors, (6174), 6 states have internal predecessors, (6174), 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-06 09:38:19,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:19,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:19,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 09:38:19,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:19,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash 555711985, now seen corresponding path program 1 times [2025-02-06 09:38:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151836175] [2025-02-06 09:38:19,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:19,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 09:38:19,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 09:38:19,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:19,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:38:20,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151836175] [2025-02-06 09:38:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151836175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041690443] [2025-02-06 09:38:20,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:20,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:20,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:20,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:20,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:38:20,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 09:38:20,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 09:38:20,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:20,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:20,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 09:38:20,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:20,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 09:38:20,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 09:38:20,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:20,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-06 09:38:20,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:38:20,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-06 09:38:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:20,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:38:21,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2025-02-06 09:38:21,287 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2025-02-06 09:38:21,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 1 [2025-02-06 09:38:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:38:21,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041690443] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:21,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 09:38:21,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 19] total 27 [2025-02-06 09:38:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767200101] [2025-02-06 09:38:21,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:21,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:38:21,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:21,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:38:21,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-02-06 09:38:21,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1019 out of 1272 [2025-02-06 09:38:21,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 1066 transitions, 2167 flow. Second operand has 6 states, 6 states have (on average 1022.5) internal successors, (6135), 6 states have internal predecessors, (6135), 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-06 09:38:21,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:21,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1019 of 1272 [2025-02-06 09:38:21,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:24,337 INFO L124 PetriNetUnfolderBase]: 1638/15599 cut-off events. [2025-02-06 09:38:24,337 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:38:24,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18196 conditions, 15599 events. 1638/15599 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 160673 event pairs, 538 based on Foata normal form. 0/14518 useless extension candidates. Maximal degree in co-relation 18189. Up to 2160 conditions per place. [2025-02-06 09:38:24,394 INFO L140 encePairwiseOnDemand]: 1211/1272 looper letters, 123 selfloop transitions, 222 changer transitions 0/1315 dead transitions. [2025-02-06 09:38:24,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 1315 transitions, 3355 flow [2025-02-06 09:38:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:38:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:38:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6460 transitions. [2025-02-06 09:38:24,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464360587002097 [2025-02-06 09:38:24,405 INFO L175 Difference]: Start difference. First operand has 1044 places, 1066 transitions, 2167 flow. Second operand 6 states and 6460 transitions. [2025-02-06 09:38:24,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 1315 transitions, 3355 flow [2025-02-06 09:38:24,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 1315 transitions, 3345 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:38:24,426 INFO L231 Difference]: Finished difference. Result has 1049 places, 1287 transitions, 3607 flow [2025-02-06 09:38:24,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1066, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1006, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3607, PETRI_PLACES=1049, PETRI_TRANSITIONS=1287} [2025-02-06 09:38:24,428 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -57 predicate places. [2025-02-06 09:38:24,428 INFO L471 AbstractCegarLoop]: Abstraction has has 1049 places, 1287 transitions, 3607 flow [2025-02-06 09:38:24,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1022.5) internal successors, (6135), 6 states have internal predecessors, (6135), 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-06 09:38:24,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:24,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:24,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 09:38:24,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 09:38:24,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:24,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1016442814, now seen corresponding path program 1 times [2025-02-06 09:38:24,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:24,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024002489] [2025-02-06 09:38:24,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:24,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:24,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-06 09:38:24,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-06 09:38:24,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:24,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:38:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024002489] [2025-02-06 09:38:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024002489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:24,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:24,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122909976] [2025-02-06 09:38:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:24,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:24,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:24,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:24,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1272 [2025-02-06 09:38:24,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1049 places, 1287 transitions, 3607 flow. Second operand has 3 states, 3 states have (on average 1078.0) internal successors, (3234), 3 states have internal predecessors, (3234), 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-06 09:38:24,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:24,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1272 [2025-02-06 09:38:24,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:26,222 INFO L124 PetriNetUnfolderBase]: 968/10993 cut-off events. [2025-02-06 09:38:26,222 INFO L125 PetriNetUnfolderBase]: For 782/1060 co-relation queries the response was YES. [2025-02-06 09:38:26,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13750 conditions, 10993 events. 968/10993 cut-off events. For 782/1060 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 91268 event pairs, 55 based on Foata normal form. 43/10204 useless extension candidates. Maximal degree in co-relation 13739. Up to 1000 conditions per place. [2025-02-06 09:38:26,259 INFO L140 encePairwiseOnDemand]: 1263/1272 looper letters, 114 selfloop transitions, 6 changer transitions 0/1312 dead transitions. [2025-02-06 09:38:26,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1050 places, 1312 transitions, 3925 flow [2025-02-06 09:38:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3295 transitions. [2025-02-06 09:38:26,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8634696016771488 [2025-02-06 09:38:26,263 INFO L175 Difference]: Start difference. First operand has 1049 places, 1287 transitions, 3607 flow. Second operand 3 states and 3295 transitions. [2025-02-06 09:38:26,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1050 places, 1312 transitions, 3925 flow [2025-02-06 09:38:26,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1050 places, 1312 transitions, 3925 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:26,285 INFO L231 Difference]: Finished difference. Result has 1052 places, 1291 transitions, 3653 flow [2025-02-06 09:38:26,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=3605, PETRI_DIFFERENCE_MINUEND_PLACES=1048, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3653, PETRI_PLACES=1052, PETRI_TRANSITIONS=1291} [2025-02-06 09:38:26,288 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -54 predicate places. [2025-02-06 09:38:26,288 INFO L471 AbstractCegarLoop]: Abstraction has has 1052 places, 1291 transitions, 3653 flow [2025-02-06 09:38:26,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1078.0) internal successors, (3234), 3 states have internal predecessors, (3234), 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-06 09:38:26,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:26,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:26,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:38:26,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:26,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1844039742, now seen corresponding path program 1 times [2025-02-06 09:38:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:26,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873134040] [2025-02-06 09:38:26,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:26,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:26,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-06 09:38:26,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-06 09:38:26,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:26,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 09:38:26,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:26,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873134040] [2025-02-06 09:38:26,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873134040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:26,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:26,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:38:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742335147] [2025-02-06 09:38:26,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:26,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:26,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:26,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:26,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1079 out of 1272 [2025-02-06 09:38:26,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1052 places, 1291 transitions, 3653 flow. Second operand has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 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-06 09:38:26,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:26,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1079 of 1272 [2025-02-06 09:38:26,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:28,839 INFO L124 PetriNetUnfolderBase]: 1095/14391 cut-off events. [2025-02-06 09:38:28,840 INFO L125 PetriNetUnfolderBase]: For 898/1092 co-relation queries the response was YES. [2025-02-06 09:38:28,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17646 conditions, 14391 events. 1095/14391 cut-off events. For 898/1092 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 126435 event pairs, 57 based on Foata normal form. 35/13396 useless extension candidates. Maximal degree in co-relation 17633. Up to 1220 conditions per place. [2025-02-06 09:38:28,899 INFO L140 encePairwiseOnDemand]: 1266/1272 looper letters, 111 selfloop transitions, 4 changer transitions 0/1314 dead transitions. [2025-02-06 09:38:28,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1053 places, 1314 transitions, 3957 flow [2025-02-06 09:38:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3298 transitions. [2025-02-06 09:38:28,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8642557651991615 [2025-02-06 09:38:28,905 INFO L175 Difference]: Start difference. First operand has 1052 places, 1291 transitions, 3653 flow. Second operand 3 states and 3298 transitions. [2025-02-06 09:38:28,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1053 places, 1314 transitions, 3957 flow [2025-02-06 09:38:28,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1051 places, 1314 transitions, 3945 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:38:28,928 INFO L231 Difference]: Finished difference. Result has 1053 places, 1293 transitions, 3669 flow [2025-02-06 09:38:28,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=3639, PETRI_DIFFERENCE_MINUEND_PLACES=1049, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3669, PETRI_PLACES=1053, PETRI_TRANSITIONS=1293} [2025-02-06 09:38:28,930 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -53 predicate places. [2025-02-06 09:38:28,930 INFO L471 AbstractCegarLoop]: Abstraction has has 1053 places, 1293 transitions, 3669 flow [2025-02-06 09:38:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 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-06 09:38:28,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:28,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:28,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:38:28,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:28,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:28,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1703837713, now seen corresponding path program 1 times [2025-02-06 09:38:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48676753] [2025-02-06 09:38:28,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:28,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 09:38:28,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 09:38:28,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:28,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:38:29,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48676753] [2025-02-06 09:38:29,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48676753] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682617227] [2025-02-06 09:38:29,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:29,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:29,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:29,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:29,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 09:38:29,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 09:38:29,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 09:38:29,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:29,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:29,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:38:29,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:38:29,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:38:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 09:38:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682617227] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:29,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 09:38:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-02-06 09:38:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17195136] [2025-02-06 09:38:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:29,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:29,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:29,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:38:29,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1079 out of 1272 [2025-02-06 09:38:29,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1053 places, 1293 transitions, 3669 flow. Second operand has 3 states, 3 states have (on average 1081.6666666666667) internal successors, (3245), 3 states have internal predecessors, (3245), 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-06 09:38:29,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:29,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1079 of 1272 [2025-02-06 09:38:29,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:32,152 INFO L124 PetriNetUnfolderBase]: 1146/15254 cut-off events. [2025-02-06 09:38:32,153 INFO L125 PetriNetUnfolderBase]: For 1026/1449 co-relation queries the response was YES. [2025-02-06 09:38:32,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18781 conditions, 15254 events. 1146/15254 cut-off events. For 1026/1449 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 137197 event pairs, 75 based on Foata normal form. 47/14189 useless extension candidates. Maximal degree in co-relation 18767. Up to 1297 conditions per place. [2025-02-06 09:38:32,224 INFO L140 encePairwiseOnDemand]: 1268/1272 looper letters, 111 selfloop transitions, 3 changer transitions 0/1315 dead transitions. [2025-02-06 09:38:32,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1055 places, 1315 transitions, 3969 flow [2025-02-06 09:38:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3296 transitions. [2025-02-06 09:38:32,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8637316561844863 [2025-02-06 09:38:32,228 INFO L175 Difference]: Start difference. First operand has 1053 places, 1293 transitions, 3669 flow. Second operand 3 states and 3296 transitions. [2025-02-06 09:38:32,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1055 places, 1315 transitions, 3969 flow [2025-02-06 09:38:32,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1053 places, 1315 transitions, 3961 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:38:32,248 INFO L231 Difference]: Finished difference. Result has 1055 places, 1294 transitions, 3679 flow [2025-02-06 09:38:32,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=3661, PETRI_DIFFERENCE_MINUEND_PLACES=1051, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3679, PETRI_PLACES=1055, PETRI_TRANSITIONS=1294} [2025-02-06 09:38:32,250 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -51 predicate places. [2025-02-06 09:38:32,250 INFO L471 AbstractCegarLoop]: Abstraction has has 1055 places, 1294 transitions, 3679 flow [2025-02-06 09:38:32,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1081.6666666666667) internal successors, (3245), 3 states have internal predecessors, (3245), 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-06 09:38:32,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:32,252 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:32,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 09:38:32,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:32,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:32,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1485682684, now seen corresponding path program 1 times [2025-02-06 09:38:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:32,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122569320] [2025-02-06 09:38:32,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:32,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 09:38:32,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 09:38:32,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:32,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:38:32,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:32,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122569320] [2025-02-06 09:38:32,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122569320] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:32,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324058187] [2025-02-06 09:38:32,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:32,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:32,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:32,641 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:32,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 09:38:32,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 09:38:32,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 09:38:32,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:32,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:32,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 09:38:32,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:38:32,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:38:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:38:33,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324058187] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:38:33,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:38:33,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 09:38:33,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461426023] [2025-02-06 09:38:33,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:38:33,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:38:33,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:33,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:38:33,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:38:33,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1272 [2025-02-06 09:38:33,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1055 places, 1294 transitions, 3679 flow. Second operand has 11 states, 11 states have (on average 1072.909090909091) internal successors, (11802), 11 states have internal predecessors, (11802), 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-06 09:38:33,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:33,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1272 [2025-02-06 09:38:33,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:35,963 INFO L124 PetriNetUnfolderBase]: 885/13327 cut-off events. [2025-02-06 09:38:35,963 INFO L125 PetriNetUnfolderBase]: For 735/833 co-relation queries the response was YES. [2025-02-06 09:38:35,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16060 conditions, 13327 events. 885/13327 cut-off events. For 735/833 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 111705 event pairs, 12 based on Foata normal form. 1/12501 useless extension candidates. Maximal degree in co-relation 16045. Up to 1096 conditions per place. [2025-02-06 09:38:35,994 INFO L140 encePairwiseOnDemand]: 1261/1272 looper letters, 110 selfloop transitions, 14 changer transitions 0/1314 dead transitions. [2025-02-06 09:38:35,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1067 places, 1314 transitions, 3977 flow [2025-02-06 09:38:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 09:38:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 09:38:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13968 transitions. [2025-02-06 09:38:36,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447024673439768 [2025-02-06 09:38:36,008 INFO L175 Difference]: Start difference. First operand has 1055 places, 1294 transitions, 3679 flow. Second operand 13 states and 13968 transitions. [2025-02-06 09:38:36,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1067 places, 1314 transitions, 3977 flow [2025-02-06 09:38:36,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1065 places, 1314 transitions, 3971 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:38:36,025 INFO L231 Difference]: Finished difference. Result has 1071 places, 1304 transitions, 3763 flow [2025-02-06 09:38:36,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=3673, PETRI_DIFFERENCE_MINUEND_PLACES=1053, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3763, PETRI_PLACES=1071, PETRI_TRANSITIONS=1304} [2025-02-06 09:38:36,027 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -35 predicate places. [2025-02-06 09:38:36,027 INFO L471 AbstractCegarLoop]: Abstraction has has 1071 places, 1304 transitions, 3763 flow [2025-02-06 09:38:36,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1072.909090909091) internal successors, (11802), 11 states have internal predecessors, (11802), 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-06 09:38:36,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:36,030 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:36,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 09:38:36,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 09:38:36,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:36,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash 358172055, now seen corresponding path program 2 times [2025-02-06 09:38:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:36,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950829601] [2025-02-06 09:38:36,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:38:36,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:36,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 382 statements into 2 equivalence classes. [2025-02-06 09:38:36,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 382 of 382 statements. [2025-02-06 09:38:36,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:38:36,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 168 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 09:38:36,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950829601] [2025-02-06 09:38:36,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950829601] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329093384] [2025-02-06 09:38:36,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:38:36,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:36,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:36,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:36,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 09:38:37,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 382 statements into 2 equivalence classes. [2025-02-06 09:38:37,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 382 of 382 statements. [2025-02-06 09:38:37,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:38:37,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:37,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 09:38:37,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 168 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 09:38:37,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:38:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 168 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 09:38:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329093384] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:38:38,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:38:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-02-06 09:38:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80933461] [2025-02-06 09:38:38,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:38:38,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:38:38,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:38,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:38:38,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:38:39,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1053 out of 1272 [2025-02-06 09:38:39,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1071 places, 1304 transitions, 3763 flow. Second operand has 23 states, 23 states have (on average 1057.695652173913) internal successors, (24327), 23 states have internal predecessors, (24327), 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-06 09:38:39,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:39,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1053 of 1272 [2025-02-06 09:38:39,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:42,560 INFO L124 PetriNetUnfolderBase]: 884/13334 cut-off events. [2025-02-06 09:38:42,560 INFO L125 PetriNetUnfolderBase]: For 749/847 co-relation queries the response was YES. [2025-02-06 09:38:42,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16160 conditions, 13334 events. 884/13334 cut-off events. For 749/847 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 111790 event pairs, 12 based on Foata normal form. 1/12514 useless extension candidates. Maximal degree in co-relation 16140. Up to 1096 conditions per place. [2025-02-06 09:38:42,595 INFO L140 encePairwiseOnDemand]: 1251/1272 looper letters, 155 selfloop transitions, 25 changer transitions 0/1362 dead transitions. [2025-02-06 09:38:42,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1087 places, 1362 transitions, 4239 flow [2025-02-06 09:38:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 09:38:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 09:38:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18026 transitions. [2025-02-06 09:38:42,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8336108028116908 [2025-02-06 09:38:42,610 INFO L175 Difference]: Start difference. First operand has 1071 places, 1304 transitions, 3763 flow. Second operand 17 states and 18026 transitions. [2025-02-06 09:38:42,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1087 places, 1362 transitions, 4239 flow [2025-02-06 09:38:42,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1086 places, 1362 transitions, 4235 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 09:38:42,627 INFO L231 Difference]: Finished difference. Result has 1095 places, 1326 transitions, 3923 flow [2025-02-06 09:38:42,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1272, PETRI_DIFFERENCE_MINUEND_FLOW=3759, PETRI_DIFFERENCE_MINUEND_PLACES=1070, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3923, PETRI_PLACES=1095, PETRI_TRANSITIONS=1326} [2025-02-06 09:38:42,629 INFO L279 CegarLoopForPetriNet]: 1106 programPoint places, -11 predicate places. [2025-02-06 09:38:42,629 INFO L471 AbstractCegarLoop]: Abstraction has has 1095 places, 1326 transitions, 3923 flow [2025-02-06 09:38:42,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1057.695652173913) internal successors, (24327), 23 states have internal predecessors, (24327), 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-06 09:38:42,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:42,635 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:42,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 09:38:42,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:42,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-02-06 09:38:42,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:42,837 INFO L85 PathProgramCache]: Analyzing trace with hash -226184, now seen corresponding path program 1 times [2025-02-06 09:38:42,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:42,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171869225] [2025-02-06 09:38:42,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:42,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:42,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-06 09:38:42,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-06 09:38:42,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:42,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:38:42,977 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:38:42,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-06 09:38:43,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-06 09:38:43,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:43,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:38:43,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:38:43,219 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:38:43,220 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (72 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (71 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (70 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (69 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (68 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (67 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (66 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (65 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (64 of 74 remaining) [2025-02-06 09:38:43,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (62 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30ASSERT_VIOLATIONDATA_RACE (61 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (60 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (59 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29ASSERT_VIOLATIONDATA_RACE (58 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (57 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28ASSERT_VIOLATIONDATA_RACE (56 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22ASSERT_VIOLATIONDATA_RACE (55 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (54 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONDATA_RACE (53 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26ASSERT_VIOLATIONDATA_RACE (52 of 74 remaining) [2025-02-06 09:38:43,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (51 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21ASSERT_VIOLATIONDATA_RACE (50 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (49 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (48 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (47 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (46 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25ASSERT_VIOLATIONDATA_RACE (45 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (44 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (43 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23ASSERT_VIOLATIONDATA_RACE (42 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (41 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONDATA_RACE (40 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (39 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (38 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (37 of 74 remaining) [2025-02-06 09:38:43,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (36 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (35 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (34 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (33 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (32 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (31 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30ASSERT_VIOLATIONDATA_RACE (30 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (29 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (28 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29ASSERT_VIOLATIONDATA_RACE (27 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (26 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28ASSERT_VIOLATIONDATA_RACE (25 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22ASSERT_VIOLATIONDATA_RACE (24 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (23 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONDATA_RACE (22 of 74 remaining) [2025-02-06 09:38:43,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26ASSERT_VIOLATIONDATA_RACE (21 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (20 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21ASSERT_VIOLATIONDATA_RACE (19 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (18 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (17 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (16 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (15 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25ASSERT_VIOLATIONDATA_RACE (14 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (13 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (12 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23ASSERT_VIOLATIONDATA_RACE (11 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (10 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONDATA_RACE (9 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (8 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (7 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (6 of 74 remaining) [2025-02-06 09:38:43,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (5 of 74 remaining) [2025-02-06 09:38:43,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (4 of 74 remaining) [2025-02-06 09:38:43,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (3 of 74 remaining) [2025-02-06 09:38:43,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (2 of 74 remaining) [2025-02-06 09:38:43,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (1 of 74 remaining) [2025-02-06 09:38:43,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (0 of 74 remaining) [2025-02-06 09:38:43,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:38:43,228 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:43,230 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:38:43,230 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:38:43,384 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:38:43,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1924 places, 2215 transitions, 4446 flow [2025-02-06 09:38:44,244 INFO L124 PetriNetUnfolderBase]: 333/2437 cut-off events. [2025-02-06 09:38:44,245 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:38:44,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2449 conditions, 2437 events. 333/2437 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 12096 event pairs, 0 based on Foata normal form. 0/2013 useless extension candidates. Maximal degree in co-relation 2021. Up to 12 conditions per place. [2025-02-06 09:38:44,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 1924 places, 2215 transitions, 4446 flow [2025-02-06 09:38:44,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1924 places, 2215 transitions, 4446 flow [2025-02-06 09:38:44,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:38:44,372 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;@7eabd3f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:38:44,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-02-06 09:38:44,373 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:38:44,374 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-02-06 09:38:44,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:38:44,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:44,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:44,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-02-06 09:38:44,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1444695081, now seen corresponding path program 1 times [2025-02-06 09:38:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90212704] [2025-02-06 09:38:44,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:44,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:44,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 09:38:44,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 09:38:44,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:44,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:44,431 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-06 09:38:44,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90212704] [2025-02-06 09:38:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90212704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 09:38:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076733186] [2025-02-06 09:38:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:44,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:38:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:44,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:38:44,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:38:44,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1890 out of 2215 [2025-02-06 09:38:44,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1924 places, 2215 transitions, 4446 flow. Second operand has 2 states, 2 states have (on average 1890.5) internal successors, (3781), 2 states have internal predecessors, (3781), 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-06 09:38:44,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:44,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1890 of 2215 [2025-02-06 09:38:44,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:50,609 INFO L124 PetriNetUnfolderBase]: 1209/22398 cut-off events. [2025-02-06 09:38:50,610 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-02-06 09:38:50,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23730 conditions, 22398 events. 1209/22398 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 247497 event pairs, 343 based on Foata normal form. 10343/30910 useless extension candidates. Maximal degree in co-relation 4510. Up to 1212 conditions per place. [2025-02-06 09:38:50,884 INFO L140 encePairwiseOnDemand]: 1942/2215 looper letters, 52 selfloop transitions, 0 changer transitions 12/1881 dead transitions. [2025-02-06 09:38:50,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1826 places, 1881 transitions, 3882 flow [2025-02-06 09:38:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:38:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:38:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4105 transitions. [2025-02-06 09:38:50,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9266365688487584 [2025-02-06 09:38:50,888 INFO L175 Difference]: Start difference. First operand has 1924 places, 2215 transitions, 4446 flow. Second operand 2 states and 4105 transitions. [2025-02-06 09:38:50,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1826 places, 1881 transitions, 3882 flow [2025-02-06 09:38:50,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1826 places, 1881 transitions, 3882 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:50,906 INFO L231 Difference]: Finished difference. Result has 1826 places, 1869 transitions, 3754 flow [2025-02-06 09:38:50,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=2215, PETRI_DIFFERENCE_MINUEND_FLOW=3778, PETRI_DIFFERENCE_MINUEND_PLACES=1825, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=3754, PETRI_PLACES=1826, PETRI_TRANSITIONS=1869} [2025-02-06 09:38:50,908 INFO L279 CegarLoopForPetriNet]: 1924 programPoint places, -98 predicate places. [2025-02-06 09:38:50,908 INFO L471 AbstractCegarLoop]: Abstraction has has 1826 places, 1869 transitions, 3754 flow [2025-02-06 09:38:50,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1890.5) internal successors, (3781), 2 states have internal predecessors, (3781), 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-06 09:38:50,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:50,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:50,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:38:50,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-02-06 09:38:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1596035628, now seen corresponding path program 1 times [2025-02-06 09:38:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:50,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786345593] [2025-02-06 09:38:50,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:50,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:50,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 09:38:50,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 09:38:50,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:50,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:50,959 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-06 09:38:50,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:50,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786345593] [2025-02-06 09:38:50,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786345593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:38:50,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:38:50,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:38:50,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21367731] [2025-02-06 09:38:50,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:50,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:50,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:50,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:50,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:38:50,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1884 out of 2215 [2025-02-06 09:38:50,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1826 places, 1869 transitions, 3754 flow. Second operand has 3 states, 3 states have (on average 1886.3333333333333) internal successors, (5659), 3 states have internal predecessors, (5659), 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-06 09:38:50,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:50,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1884 of 2215 [2025-02-06 09:38:50,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:38:56,888 INFO L124 PetriNetUnfolderBase]: 1209/22404 cut-off events. [2025-02-06 09:38:56,888 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-02-06 09:38:57,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23745 conditions, 22404 events. 1209/22404 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 247719 event pairs, 343 based on Foata normal form. 1/20579 useless extension candidates. Maximal degree in co-relation 23740. Up to 1215 conditions per place. [2025-02-06 09:38:57,130 INFO L140 encePairwiseOnDemand]: 2212/2215 looper letters, 58 selfloop transitions, 2 changer transitions 0/1871 dead transitions. [2025-02-06 09:38:57,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1816 places, 1871 transitions, 3878 flow [2025-02-06 09:38:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:38:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:38:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5713 transitions. [2025-02-06 09:38:57,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8597441685477802 [2025-02-06 09:38:57,134 INFO L175 Difference]: Start difference. First operand has 1826 places, 1869 transitions, 3754 flow. Second operand 3 states and 5713 transitions. [2025-02-06 09:38:57,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1816 places, 1871 transitions, 3878 flow [2025-02-06 09:38:57,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1816 places, 1871 transitions, 3878 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:38:57,151 INFO L231 Difference]: Finished difference. Result has 1817 places, 1870 transitions, 3766 flow [2025-02-06 09:38:57,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=2215, PETRI_DIFFERENCE_MINUEND_FLOW=3754, PETRI_DIFFERENCE_MINUEND_PLACES=1814, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3766, PETRI_PLACES=1817, PETRI_TRANSITIONS=1870} [2025-02-06 09:38:57,152 INFO L279 CegarLoopForPetriNet]: 1924 programPoint places, -107 predicate places. [2025-02-06 09:38:57,153 INFO L471 AbstractCegarLoop]: Abstraction has has 1817 places, 1870 transitions, 3766 flow [2025-02-06 09:38:57,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1886.3333333333333) internal successors, (5659), 3 states have internal predecessors, (5659), 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-06 09:38:57,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:38:57,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:38:57,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:38:57,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-02-06 09:38:57,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:38:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1464147488, now seen corresponding path program 1 times [2025-02-06 09:38:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:38:57,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732599689] [2025-02-06 09:38:57,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:38:57,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:38:57,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:38:57,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:57,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:57,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:38:57,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732599689] [2025-02-06 09:38:57,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732599689] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:57,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241522382] [2025-02-06 09:38:57,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:38:57,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:38:57,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:38:57,359 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:38:57,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 09:38:57,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:38:57,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:38:57,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:38:57,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:38:57,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:38:57,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:38:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:38:57,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:38:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:38:57,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241522382] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 09:38:57,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 09:38:57,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-02-06 09:38:57,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361823817] [2025-02-06 09:38:57,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:38:57,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:38:57,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:38:57,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:38:57,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:38:57,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1883 out of 2215 [2025-02-06 09:38:57,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1817 places, 1870 transitions, 3766 flow. Second operand has 3 states, 3 states have (on average 1885.6666666666667) internal successors, (5657), 3 states have internal predecessors, (5657), 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-06 09:38:57,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:38:57,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1883 of 2215 [2025-02-06 09:38:57,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:39:03,577 INFO L124 PetriNetUnfolderBase]: 1209/22405 cut-off events. [2025-02-06 09:39:03,577 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-02-06 09:39:03,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23754 conditions, 22405 events. 1209/22405 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 247142 event pairs, 343 based on Foata normal form. 0/20579 useless extension candidates. Maximal degree in co-relation 23747. Up to 1215 conditions per place. [2025-02-06 09:39:03,861 INFO L140 encePairwiseOnDemand]: 2211/2215 looper letters, 57 selfloop transitions, 3 changer transitions 0/1871 dead transitions. [2025-02-06 09:39:03,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1819 places, 1871 transitions, 3888 flow [2025-02-06 09:39:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:39:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:39:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5710 transitions. [2025-02-06 09:39:03,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8592927012791572 [2025-02-06 09:39:03,866 INFO L175 Difference]: Start difference. First operand has 1817 places, 1870 transitions, 3766 flow. Second operand 3 states and 5710 transitions. [2025-02-06 09:39:03,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1819 places, 1871 transitions, 3888 flow [2025-02-06 09:39:03,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1818 places, 1871 transitions, 3886 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:39:03,888 INFO L231 Difference]: Finished difference. Result has 1820 places, 1871 transitions, 3782 flow [2025-02-06 09:39:03,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=2215, PETRI_DIFFERENCE_MINUEND_FLOW=3764, PETRI_DIFFERENCE_MINUEND_PLACES=1816, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3782, PETRI_PLACES=1820, PETRI_TRANSITIONS=1871} [2025-02-06 09:39:03,890 INFO L279 CegarLoopForPetriNet]: 1924 programPoint places, -104 predicate places. [2025-02-06 09:39:03,890 INFO L471 AbstractCegarLoop]: Abstraction has has 1820 places, 1871 transitions, 3782 flow [2025-02-06 09:39:03,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1885.6666666666667) internal successors, (5657), 3 states have internal predecessors, (5657), 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-06 09:39:03,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:39:03,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:39:03,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 09:39:04,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 09:39:04,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-02-06 09:39:04,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:39:04,093 INFO L85 PathProgramCache]: Analyzing trace with hash 448924485, now seen corresponding path program 1 times [2025-02-06 09:39:04,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:39:04,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342521976] [2025-02-06 09:39:04,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:04,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:39:04,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 09:39:04,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 09:39:04,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:04,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:39:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:39:04,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342521976] [2025-02-06 09:39:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342521976] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:39:04,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544714273] [2025-02-06 09:39:04,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:39:04,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:39:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:39:04,228 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:39:04,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 09:39:04,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 09:39:04,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 09:39:04,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:39:04,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:39:04,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 09:39:04,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:39:04,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 09:39:04,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-06 09:39:04,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:39:04,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-02-06 09:39:04,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:39:04,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-02-06 09:39:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:39:04,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:39:04,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544714273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:39:04,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:39:04,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-06 09:39:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659475132] [2025-02-06 09:39:04,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:39:04,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:39:04,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:39:04,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:39:04,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:39:04,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1791 out of 2215 [2025-02-06 09:39:04,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1820 places, 1871 transitions, 3782 flow. Second operand has 6 states, 6 states have (on average 1793.0) internal successors, (10758), 6 states have internal predecessors, (10758), 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-06 09:39:04,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:39:04,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1791 of 2215 [2025-02-06 09:39:04,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand