./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/hclhlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:13:18,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:13:18,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:13:18,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:13:18,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:13:18,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:13:18,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:13:18,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:13:18,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:13:18,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:13:18,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:13:18,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:13:18,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:13:18,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:13:18,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:13:18,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:13:18,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:13:18,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:13:18,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:13:18,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:13:18,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:13:18,341 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-03-08 22:13:18,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:13:18,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:13:18,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:13:18,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:13:18,591 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:13:18,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-03-08 22:13:19,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb55e068/59dea8d7889641009caa8031baa371e8/FLAG614b60b7a [2025-03-08 22:13:20,199 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:13:20,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-03-08 22:13:20,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb55e068/59dea8d7889641009caa8031baa371e8/FLAG614b60b7a [2025-03-08 22:13:20,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb55e068/59dea8d7889641009caa8031baa371e8 [2025-03-08 22:13:20,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:13:20,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:13:20,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:13:20,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:13:20,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:13:20,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:20" (1/1) ... [2025-03-08 22:13:20,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670247f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:20, skipping insertion in model container [2025-03-08 22:13:20,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:13:20" (1/1) ... [2025-03-08 22:13:20,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:13:21,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:13:21,880 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:13:21,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-08 22:13:21,957 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-08 22:13:21,957 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-08 22:13:21,958 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-08 22:13:21,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-08 22:13:21,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-08 22:13:21,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-08 22:13:21,960 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-08 22:13:21,960 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-08 22:13:21,960 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-08 22:13:21,961 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-08 22:13:21,961 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-08 22:13:21,961 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-08 22:13:21,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-08 22:13:21,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-08 22:13:21,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-08 22:13:21,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-08 22:13:21,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-08 22:13:21,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-08 22:13:21,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-08 22:13:21,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-08 22:13:21,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-08 22:13:21,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-08 22:13:21,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-08 22:13:21,968 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-08 22:13:21,968 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-08 22:13:21,968 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-08 22:13:21,969 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-08 22:13:21,969 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-08 22:13:21,970 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-08 22:13:21,971 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-08 22:13:21,971 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-08 22:13:21,972 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-08 22:13:21,972 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-08 22:13:21,973 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-08 22:13:21,974 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-08 22:13:21,974 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-08 22:13:21,974 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-08 22:13:21,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-08 22:13:21,976 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-08 22:13:21,976 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-08 22:13:21,977 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-08 22:13:21,978 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-08 22:13:21,979 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-08 22:13:21,979 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-08 22:13:21,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-08 22:13:21,981 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-08 22:13:21,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-08 22:13:21,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-08 22:13:21,983 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-08 22:13:21,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-08 22:13:21,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-08 22:13:21,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-08 22:13:21,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-08 22:13:21,986 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-08 22:13:21,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-08 22:13:21,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-08 22:13:21,987 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-08 22:13:21,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-08 22:13:21,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-08 22:13:21,989 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-08 22:13:21,990 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-08 22:13:21,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-08 22:13:21,991 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-08 22:13:21,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-08 22:13:21,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-08 22:13:21,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-08 22:13:21,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-08 22:13:21,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-08 22:13:21,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-08 22:13:21,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-08 22:13:21,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-08 22:13:21,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-08 22:13:21,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-08 22:13:21,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-08 22:13:21,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-08 22:13:22,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-08 22:13:22,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-08 22:13:22,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-08 22:13:22,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-08 22:13:22,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-08 22:13:22,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-08 22:13:22,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-08 22:13:22,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-08 22:13:22,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-08 22:13:22,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-08 22:13:22,004 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-08 22:13:22,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-08 22:13:22,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-08 22:13:22,005 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-08 22:13:22,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-08 22:13:22,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-08 22:13:22,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-08 22:13:22,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-08 22:13:22,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-08 22:13:22,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-08 22:13:22,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-08 22:13:22,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-08 22:13:22,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-08 22:13:22,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-08 22:13:22,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:13:22,272 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:13:22,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22 WrapperNode [2025-03-08 22:13:22,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:13:22,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:13:22,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:13:22,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:13:22,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,407 INFO L138 Inliner]: procedures = 921, calls = 972, calls flagged for inlining = 848, calls inlined = 84, statements flattened = 1082 [2025-03-08 22:13:22,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:13:22,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:13:22,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:13:22,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:13:22,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:13:22,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:13:22,491 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:13:22,491 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:13:22,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (1/1) ... [2025-03-08 22:13:22,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:13:22,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:22,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:13:22,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:13:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:13:22,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-08 22:13:22,557 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 22:13:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:13:22,560 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:13:22,717 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:13:22,718 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:13:23,143 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-08 22:13:23,143 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-27: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-9: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-9: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-08 22:13:23,770 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-08 22:13:23,771 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:13:23,771 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:13:23,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:13:23,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:13:23,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:23 BoogieIcfgContainer [2025-03-08 22:13:23,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:13:23,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:13:23,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:13:23,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:13:23,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:13:20" (1/3) ... [2025-03-08 22:13:23,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd023e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:23, skipping insertion in model container [2025-03-08 22:13:23,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:13:22" (2/3) ... [2025-03-08 22:13:23,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd023e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:13:23, skipping insertion in model container [2025-03-08 22:13:23,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:13:23" (3/3) ... [2025-03-08 22:13:23,962 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-03-08 22:13:23,974 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:13:23,975 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 1057 locations, 1 initial locations, 42 loop locations, and 42 error locations. [2025-03-08 22:13:23,975 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:13:24,246 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:13:24,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1060 places, 1226 transitions, 2459 flow [2025-03-08 22:13:24,569 INFO L124 PetriNetUnfolderBase]: 183/1302 cut-off events. [2025-03-08 22:13:24,571 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:13:24,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 1302 events. 183/1302 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4403 event pairs, 0 based on Foata normal form. 0/1069 useless extension candidates. Maximal degree in co-relation 987. Up to 8 conditions per place. [2025-03-08 22:13:24,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 1060 places, 1226 transitions, 2459 flow [2025-03-08 22:13:24,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1060 places, 1226 transitions, 2459 flow [2025-03-08 22:13:24,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:13:24,644 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;@479952e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:13:24,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-08 22:13:24,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:13:24,651 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-03-08 22:13:24,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:13:24,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:24,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:24,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:24,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash 994676861, now seen corresponding path program 1 times [2025-03-08 22:13:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:24,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135041188] [2025-03-08 22:13:24,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:24,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:24,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 22:13:24,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 22:13:24,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:24,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:25,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135041188] [2025-03-08 22:13:25,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135041188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:13:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376782589] [2025-03-08 22:13:25,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:25,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:13:25,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:25,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:13:25,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:13:25,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1040 out of 1226 [2025-03-08 22:13:25,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1060 places, 1226 transitions, 2459 flow. Second operand has 2 states, 2 states have (on average 1040.5) internal successors, (2081), 2 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:25,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:25,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1040 of 1226 [2025-03-08 22:13:25,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:25,497 INFO L124 PetriNetUnfolderBase]: 33/1090 cut-off events. [2025-03-08 22:13:25,497 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:13:25,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 1090 events. 33/1090 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2901 event pairs, 0 based on Foata normal form. 272/1281 useless extension candidates. Maximal degree in co-relation 850. Up to 30 conditions per place. [2025-03-08 22:13:25,507 INFO L140 encePairwiseOnDemand]: 1069/1226 looper letters, 29 selfloop transitions, 0 changer transitions 12/1032 dead transitions. [2025-03-08 22:13:25,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1032 transitions, 2129 flow [2025-03-08 22:13:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:13:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 22:13:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2266 transitions. [2025-03-08 22:13:25,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241435562805873 [2025-03-08 22:13:25,529 INFO L175 Difference]: Start difference. First operand has 1060 places, 1226 transitions, 2459 flow. Second operand 2 states and 2266 transitions. [2025-03-08 22:13:25,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1032 transitions, 2129 flow [2025-03-08 22:13:25,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1003 places, 1032 transitions, 2129 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:13:25,550 INFO L231 Difference]: Finished difference. Result has 1003 places, 1020 transitions, 2047 flow [2025-03-08 22:13:25,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1032, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2047, PETRI_PLACES=1003, PETRI_TRANSITIONS=1020} [2025-03-08 22:13:25,558 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -57 predicate places. [2025-03-08 22:13:25,558 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 1020 transitions, 2047 flow [2025-03-08 22:13:25,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1040.5) internal successors, (2081), 2 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:25,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:25,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:25,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:13:25,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:25,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1830898718, now seen corresponding path program 1 times [2025-03-08 22:13:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:25,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125714163] [2025-03-08 22:13:25,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:25,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 22:13:25,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 22:13:25,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:25,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:25,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:25,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125714163] [2025-03-08 22:13:25,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125714163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:25,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:25,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:13:25,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708358970] [2025-03-08 22:13:25,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:25,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:13:25,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:25,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:13:25,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:13:25,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1034 out of 1226 [2025-03-08 22:13:25,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1020 transitions, 2047 flow. Second operand has 3 states, 3 states have (on average 1036.3333333333333) internal successors, (3109), 3 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:25,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:25,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1034 of 1226 [2025-03-08 22:13:25,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:25,989 INFO L124 PetriNetUnfolderBase]: 33/1096 cut-off events. [2025-03-08 22:13:25,989 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:13:25,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 1096 events. 33/1096 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2823 event pairs, 0 based on Foata normal form. 1/1021 useless extension candidates. Maximal degree in co-relation 1136. Up to 33 conditions per place. [2025-03-08 22:13:25,998 INFO L140 encePairwiseOnDemand]: 1223/1226 looper letters, 35 selfloop transitions, 2 changer transitions 0/1022 dead transitions. [2025-03-08 22:13:25,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1022 transitions, 2125 flow [2025-03-08 22:13:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:13:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:13:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3140 transitions. [2025-03-08 22:13:26,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8537248504622077 [2025-03-08 22:13:26,006 INFO L175 Difference]: Start difference. First operand has 1003 places, 1020 transitions, 2047 flow. Second operand 3 states and 3140 transitions. [2025-03-08 22:13:26,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1022 transitions, 2125 flow [2025-03-08 22:13:26,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1022 transitions, 2125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:13:26,021 INFO L231 Difference]: Finished difference. Result has 994 places, 1021 transitions, 2059 flow [2025-03-08 22:13:26,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2059, PETRI_PLACES=994, PETRI_TRANSITIONS=1021} [2025-03-08 22:13:26,023 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -66 predicate places. [2025-03-08 22:13:26,023 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1021 transitions, 2059 flow [2025-03-08 22:13:26,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1036.3333333333333) internal successors, (3109), 3 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:26,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:26,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:26,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:13:26,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:26,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash 501591966, now seen corresponding path program 1 times [2025-03-08 22:13:26,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:26,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361389338] [2025-03-08 22:13:26,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:26,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:13:26,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:13:26,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:26,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:26,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:26,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361389338] [2025-03-08 22:13:26,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361389338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:26,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447422934] [2025-03-08 22:13:26,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:26,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:26,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:26,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:13:26,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:13:26,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:13:26,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:13:26,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:26,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:26,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:13:26,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:13:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:26,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:13:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:26,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447422934] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:26,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:13:26,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-03-08 22:13:26,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63735827] [2025-03-08 22:13:26,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:26,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:13:26,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:26,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:13:26,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:13:26,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1033 out of 1226 [2025-03-08 22:13:26,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1021 transitions, 2059 flow. Second operand has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:26,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:26,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1033 of 1226 [2025-03-08 22:13:26,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:26,779 INFO L124 PetriNetUnfolderBase]: 33/1097 cut-off events. [2025-03-08 22:13:26,780 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 22:13:26,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 1097 events. 33/1097 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2377 event pairs, 0 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1143. Up to 33 conditions per place. [2025-03-08 22:13:26,789 INFO L140 encePairwiseOnDemand]: 1222/1226 looper letters, 34 selfloop transitions, 3 changer transitions 0/1022 dead transitions. [2025-03-08 22:13:26,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1022 transitions, 2135 flow [2025-03-08 22:13:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:13:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:13:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3137 transitions. [2025-03-08 22:13:26,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8529091897770528 [2025-03-08 22:13:26,794 INFO L175 Difference]: Start difference. First operand has 994 places, 1021 transitions, 2059 flow. Second operand 3 states and 3137 transitions. [2025-03-08 22:13:26,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1022 transitions, 2135 flow [2025-03-08 22:13:26,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 1022 transitions, 2133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:13:26,811 INFO L231 Difference]: Finished difference. Result has 997 places, 1022 transitions, 2075 flow [2025-03-08 22:13:26,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2057, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2075, PETRI_PLACES=997, PETRI_TRANSITIONS=1022} [2025-03-08 22:13:26,814 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -63 predicate places. [2025-03-08 22:13:26,814 INFO L471 AbstractCegarLoop]: Abstraction has has 997 places, 1022 transitions, 2075 flow [2025-03-08 22:13:26,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:26,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:26,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:26,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:13:27,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:27,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:27,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:27,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1594463537, now seen corresponding path program 1 times [2025-03-08 22:13:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:27,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889627719] [2025-03-08 22:13:27,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:27,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:13:27,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:13:27,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:27,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:27,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889627719] [2025-03-08 22:13:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889627719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362481083] [2025-03-08 22:13:27,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:27,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:27,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:27,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:13:27,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:13:27,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:13:27,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:13:27,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:27,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:27,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 22:13:27,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:13:27,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:13:27,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-08 22:13:27,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:27,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-08 22:13:27,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:27,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-08 22:13:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:27,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:13:27,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362481083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:27,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:13:27,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-08 22:13:27,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929290592] [2025-03-08 22:13:27,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:27,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:27,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:27,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:13:27,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1226 [2025-03-08 22:13:27,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 1022 transitions, 2075 flow. Second operand has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:27,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:27,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1226 [2025-03-08 22:13:27,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:29,098 INFO L124 PetriNetUnfolderBase]: 690/7587 cut-off events. [2025-03-08 22:13:29,098 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:13:29,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8643 conditions, 7587 events. 690/7587 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 64266 event pairs, 432 based on Foata normal form. 0/7077 useless extension candidates. Maximal degree in co-relation 8636. Up to 1029 conditions per place. [2025-03-08 22:13:29,133 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 82 selfloop transitions, 5 changer transitions 0/1021 dead transitions. [2025-03-08 22:13:29,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1021 transitions, 2247 flow [2025-03-08 22:13:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5974 transitions. [2025-03-08 22:13:29,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.812126155519304 [2025-03-08 22:13:29,143 INFO L175 Difference]: Start difference. First operand has 997 places, 1022 transitions, 2075 flow. Second operand 6 states and 5974 transitions. [2025-03-08 22:13:29,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1021 transitions, 2247 flow [2025-03-08 22:13:29,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1021 transitions, 2241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:13:29,155 INFO L231 Difference]: Finished difference. Result has 999 places, 1021 transitions, 2077 flow [2025-03-08 22:13:29,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2077, PETRI_PLACES=999, PETRI_TRANSITIONS=1021} [2025-03-08 22:13:29,157 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -61 predicate places. [2025-03-08 22:13:29,157 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1021 transitions, 2077 flow [2025-03-08 22:13:29,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:29,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:29,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:29,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:13:29,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 22:13:29,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:29,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1148168657, now seen corresponding path program 1 times [2025-03-08 22:13:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712764084] [2025-03-08 22:13:29,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:29,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 22:13:29,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 22:13:29,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:29,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:29,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:29,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712764084] [2025-03-08 22:13:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712764084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:29,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767200101] [2025-03-08 22:13:29,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:29,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:29,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:29,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:13:29,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:13:29,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 22:13:29,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 22:13:29,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:29,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:29,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:13:29,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:13:29,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:13:29,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 22:13:29,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:29,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-08 22:13:29,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:29,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-08 22:13:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:29,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:13:29,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767200101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:29,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:13:29,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-08 22:13:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687656529] [2025-03-08 22:13:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:29,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:29,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:29,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:13:30,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1226 [2025-03-08 22:13:30,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1021 transitions, 2077 flow. Second operand has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:30,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:30,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1226 [2025-03-08 22:13:30,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:31,167 INFO L124 PetriNetUnfolderBase]: 690/7586 cut-off events. [2025-03-08 22:13:31,168 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:13:31,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8644 conditions, 7586 events. 690/7586 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 64149 event pairs, 432 based on Foata normal form. 0/7076 useless extension candidates. Maximal degree in co-relation 8637. Up to 1029 conditions per place. [2025-03-08 22:13:31,194 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 82 selfloop transitions, 5 changer transitions 0/1020 dead transitions. [2025-03-08 22:13:31,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1020 transitions, 2249 flow [2025-03-08 22:13:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5974 transitions. [2025-03-08 22:13:31,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.812126155519304 [2025-03-08 22:13:31,204 INFO L175 Difference]: Start difference. First operand has 999 places, 1021 transitions, 2077 flow. Second operand 6 states and 5974 transitions. [2025-03-08 22:13:31,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1020 transitions, 2249 flow [2025-03-08 22:13:31,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1020 transitions, 2239 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:13:31,217 INFO L231 Difference]: Finished difference. Result has 998 places, 1020 transitions, 2075 flow [2025-03-08 22:13:31,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2075, PETRI_PLACES=998, PETRI_TRANSITIONS=1020} [2025-03-08 22:13:31,219 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -62 predicate places. [2025-03-08 22:13:31,219 INFO L471 AbstractCegarLoop]: Abstraction has has 998 places, 1020 transitions, 2075 flow [2025-03-08 22:13:31,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 983.0) internal successors, (5898), 6 states have internal predecessors, (5898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:31,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:31,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:31,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:13:31,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:31,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:31,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 209652502, now seen corresponding path program 1 times [2025-03-08 22:13:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:31,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983754909] [2025-03-08 22:13:31,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:31,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 22:13:31,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 22:13:31,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:31,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:31,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983754909] [2025-03-08 22:13:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983754909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034525290] [2025-03-08 22:13:31,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:31,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:31,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:31,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:13:31,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:13:31,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 22:13:31,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 22:13:31,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:31,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:31,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 22:13:31,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:13:32,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:13:32,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:13:32,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:32,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 22:13:32,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:13:32,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 22:13:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:32,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:13:32,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2025-03-08 22:13:32,880 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2025-03-08 22:13:32,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 1 [2025-03-08 22:13:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:13:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034525290] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:32,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:13:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 19] total 27 [2025-03-08 22:13:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461426023] [2025-03-08 22:13:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:32,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:13:32,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:32,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:13:32,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:13:33,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 973 out of 1226 [2025-03-08 22:13:33,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1020 transitions, 2075 flow. Second operand has 6 states, 6 states have (on average 976.5) internal successors, (5859), 6 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:33,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:33,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 973 of 1226 [2025-03-08 22:13:33,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:36,326 INFO L124 PetriNetUnfolderBase]: 1645/15129 cut-off events. [2025-03-08 22:13:36,326 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:13:36,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17727 conditions, 15129 events. 1645/15129 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 154556 event pairs, 545 based on Foata normal form. 0/14042 useless extension candidates. Maximal degree in co-relation 17720. Up to 2161 conditions per place. [2025-03-08 22:13:36,368 INFO L140 encePairwiseOnDemand]: 1165/1226 looper letters, 123 selfloop transitions, 222 changer transitions 0/1269 dead transitions. [2025-03-08 22:13:36,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1003 places, 1269 transitions, 3263 flow [2025-03-08 22:13:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6184 transitions. [2025-03-08 22:13:36,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8406742794997281 [2025-03-08 22:13:36,377 INFO L175 Difference]: Start difference. First operand has 998 places, 1020 transitions, 2075 flow. Second operand 6 states and 6184 transitions. [2025-03-08 22:13:36,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1003 places, 1269 transitions, 3263 flow [2025-03-08 22:13:36,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1269 transitions, 3253 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:13:36,393 INFO L231 Difference]: Finished difference. Result has 1003 places, 1241 transitions, 3515 flow [2025-03-08 22:13:36,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=960, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3515, PETRI_PLACES=1003, PETRI_TRANSITIONS=1241} [2025-03-08 22:13:36,396 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -57 predicate places. [2025-03-08 22:13:36,396 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 1241 transitions, 3515 flow [2025-03-08 22:13:36,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 976.5) internal successors, (5859), 6 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:36,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:36,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:36,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:13:36,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:36,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:36,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:36,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1691953310, now seen corresponding path program 1 times [2025-03-08 22:13:36,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:36,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884215956] [2025-03-08 22:13:36,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:36,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:36,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 22:13:36,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 22:13:36,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:36,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:13:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884215956] [2025-03-08 22:13:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884215956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:36,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:36,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:13:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950829601] [2025-03-08 22:13:36,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:36,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:13:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:36,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:13:36,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:13:36,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1030 out of 1226 [2025-03-08 22:13:36,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 1241 transitions, 3515 flow. Second operand has 3 states, 3 states have (on average 1032.0) internal successors, (3096), 3 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:36,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:36,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1030 of 1226 [2025-03-08 22:13:36,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:38,374 INFO L124 PetriNetUnfolderBase]: 889/10500 cut-off events. [2025-03-08 22:13:38,375 INFO L125 PetriNetUnfolderBase]: For 811/1149 co-relation queries the response was YES. [2025-03-08 22:13:38,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13153 conditions, 10500 events. 889/10500 cut-off events. For 811/1149 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 87007 event pairs, 55 based on Foata normal form. 43/9705 useless extension candidates. Maximal degree in co-relation 13142. Up to 1000 conditions per place. [2025-03-08 22:13:38,421 INFO L140 encePairwiseOnDemand]: 1217/1226 looper letters, 114 selfloop transitions, 6 changer transitions 0/1266 dead transitions. [2025-03-08 22:13:38,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1004 places, 1266 transitions, 3833 flow [2025-03-08 22:13:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:13:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:13:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3157 transitions. [2025-03-08 22:13:38,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.858346927678086 [2025-03-08 22:13:38,427 INFO L175 Difference]: Start difference. First operand has 1003 places, 1241 transitions, 3515 flow. Second operand 3 states and 3157 transitions. [2025-03-08 22:13:38,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1004 places, 1266 transitions, 3833 flow [2025-03-08 22:13:38,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1004 places, 1266 transitions, 3833 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:13:38,461 INFO L231 Difference]: Finished difference. Result has 1006 places, 1245 transitions, 3561 flow [2025-03-08 22:13:38,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3513, PETRI_DIFFERENCE_MINUEND_PLACES=1002, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3561, PETRI_PLACES=1006, PETRI_TRANSITIONS=1245} [2025-03-08 22:13:38,463 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -54 predicate places. [2025-03-08 22:13:38,464 INFO L471 AbstractCegarLoop]: Abstraction has has 1006 places, 1245 transitions, 3561 flow [2025-03-08 22:13:38,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1032.0) internal successors, (3096), 3 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:38,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:38,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:38,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:13:38,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:38,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1825544064, now seen corresponding path program 1 times [2025-03-08 22:13:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872133384] [2025-03-08 22:13:38,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:38,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 22:13:38,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 22:13:38,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:38,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:13:38,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:38,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872133384] [2025-03-08 22:13:38,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872133384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:38,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:38,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:13:38,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105985628] [2025-03-08 22:13:38,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:38,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:13:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:38,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:13:38,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:13:38,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1033 out of 1226 [2025-03-08 22:13:38,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1245 transitions, 3561 flow. Second operand has 3 states, 3 states have (on average 1035.0) internal successors, (3105), 3 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:38,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:38,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1033 of 1226 [2025-03-08 22:13:38,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:40,845 INFO L124 PetriNetUnfolderBase]: 1043/13791 cut-off events. [2025-03-08 22:13:40,845 INFO L125 PetriNetUnfolderBase]: For 925/1173 co-relation queries the response was YES. [2025-03-08 22:13:40,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16961 conditions, 13791 events. 1043/13791 cut-off events. For 925/1173 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 120764 event pairs, 53 based on Foata normal form. 43/12803 useless extension candidates. Maximal degree in co-relation 16948. Up to 1222 conditions per place. [2025-03-08 22:13:40,892 INFO L140 encePairwiseOnDemand]: 1220/1226 looper letters, 111 selfloop transitions, 4 changer transitions 0/1268 dead transitions. [2025-03-08 22:13:40,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1268 transitions, 3865 flow [2025-03-08 22:13:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:13:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:13:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3160 transitions. [2025-03-08 22:13:40,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8591625883632409 [2025-03-08 22:13:40,897 INFO L175 Difference]: Start difference. First operand has 1006 places, 1245 transitions, 3561 flow. Second operand 3 states and 3160 transitions. [2025-03-08 22:13:40,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1268 transitions, 3865 flow [2025-03-08 22:13:40,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1268 transitions, 3853 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:13:40,917 INFO L231 Difference]: Finished difference. Result has 1007 places, 1247 transitions, 3577 flow [2025-03-08 22:13:40,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3547, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3577, PETRI_PLACES=1007, PETRI_TRANSITIONS=1247} [2025-03-08 22:13:40,919 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -53 predicate places. [2025-03-08 22:13:40,919 INFO L471 AbstractCegarLoop]: Abstraction has has 1007 places, 1247 transitions, 3577 flow [2025-03-08 22:13:40,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.0) internal successors, (3105), 3 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:40,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:40,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:40,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:13:40,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:40,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:40,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1006388211, now seen corresponding path program 1 times [2025-03-08 22:13:40,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:40,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622814971] [2025-03-08 22:13:40,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:40,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:40,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 22:13:40,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 22:13:40,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:40,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:41,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:41,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622814971] [2025-03-08 22:13:41,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622814971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:41,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234219735] [2025-03-08 22:13:41,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:41,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:41,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:41,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:13:41,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:13:41,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 22:13:41,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 22:13:41,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:41,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:41,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:13:41,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:13:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:41,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:13:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:13:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234219735] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:41,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:13:41,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-03-08 22:13:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200447939] [2025-03-08 22:13:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:41,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:13:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:41,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:13:41,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:13:41,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1033 out of 1226 [2025-03-08 22:13:41,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 1247 transitions, 3577 flow. Second operand has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:41,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:41,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1033 of 1226 [2025-03-08 22:13:41,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:43,695 INFO L124 PetriNetUnfolderBase]: 1096/14601 cut-off events. [2025-03-08 22:13:43,695 INFO L125 PetriNetUnfolderBase]: For 1060/1509 co-relation queries the response was YES. [2025-03-08 22:13:43,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18054 conditions, 14601 events. 1096/14601 cut-off events. For 1060/1509 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 131216 event pairs, 73 based on Foata normal form. 47/13533 useless extension candidates. Maximal degree in co-relation 18040. Up to 1300 conditions per place. [2025-03-08 22:13:43,738 INFO L140 encePairwiseOnDemand]: 1222/1226 looper letters, 111 selfloop transitions, 3 changer transitions 0/1269 dead transitions. [2025-03-08 22:13:43,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1269 transitions, 3877 flow [2025-03-08 22:13:43,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:13:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:13:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3158 transitions. [2025-03-08 22:13:43,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8586188145731376 [2025-03-08 22:13:43,742 INFO L175 Difference]: Start difference. First operand has 1007 places, 1247 transitions, 3577 flow. Second operand 3 states and 3158 transitions. [2025-03-08 22:13:43,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 1269 transitions, 3877 flow [2025-03-08 22:13:43,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 1269 transitions, 3869 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:13:43,761 INFO L231 Difference]: Finished difference. Result has 1009 places, 1248 transitions, 3587 flow [2025-03-08 22:13:43,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3569, PETRI_DIFFERENCE_MINUEND_PLACES=1005, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3587, PETRI_PLACES=1009, PETRI_TRANSITIONS=1248} [2025-03-08 22:13:43,764 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -51 predicate places. [2025-03-08 22:13:43,764 INFO L471 AbstractCegarLoop]: Abstraction has has 1009 places, 1248 transitions, 3587 flow [2025-03-08 22:13:43,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1035.6666666666667) internal successors, (3107), 3 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:43,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:43,766 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:43,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:13:43,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:43,967 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:43,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1966189418, now seen corresponding path program 1 times [2025-03-08 22:13:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:43,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211242931] [2025-03-08 22:13:43,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:43,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 22:13:44,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 22:13:44,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:44,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211242931] [2025-03-08 22:13:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211242931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930700637] [2025-03-08 22:13:44,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:44,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:44,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:44,158 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:13:44,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:13:44,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 22:13:44,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 22:13:44,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:44,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:44,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:13:44,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:13:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:44,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:13:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:13:44,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930700637] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:13:44,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:13:44,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-08 22:13:44,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809234133] [2025-03-08 22:13:44,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:13:44,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:13:44,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:44,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:13:44,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:13:44,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1023 out of 1226 [2025-03-08 22:13:44,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1248 transitions, 3587 flow. Second operand has 11 states, 11 states have (on average 1026.909090909091) internal successors, (11296), 11 states have internal predecessors, (11296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:44,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:44,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1023 of 1226 [2025-03-08 22:13:44,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:47,264 INFO L124 PetriNetUnfolderBase]: 831/12722 cut-off events. [2025-03-08 22:13:47,264 INFO L125 PetriNetUnfolderBase]: For 760/882 co-relation queries the response was YES. [2025-03-08 22:13:47,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15376 conditions, 12722 events. 831/12722 cut-off events. For 760/882 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 106645 event pairs, 12 based on Foata normal form. 1/11896 useless extension candidates. Maximal degree in co-relation 15361. Up to 1096 conditions per place. [2025-03-08 22:13:47,308 INFO L140 encePairwiseOnDemand]: 1215/1226 looper letters, 110 selfloop transitions, 14 changer transitions 0/1268 dead transitions. [2025-03-08 22:13:47,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1268 transitions, 3885 flow [2025-03-08 22:13:47,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:13:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 22:13:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13370 transitions. [2025-03-08 22:13:47,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388756431170786 [2025-03-08 22:13:47,325 INFO L175 Difference]: Start difference. First operand has 1009 places, 1248 transitions, 3587 flow. Second operand 13 states and 13370 transitions. [2025-03-08 22:13:47,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1268 transitions, 3885 flow [2025-03-08 22:13:47,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1268 transitions, 3879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:13:47,349 INFO L231 Difference]: Finished difference. Result has 1025 places, 1258 transitions, 3671 flow [2025-03-08 22:13:47,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3581, PETRI_DIFFERENCE_MINUEND_PLACES=1007, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3671, PETRI_PLACES=1025, PETRI_TRANSITIONS=1258} [2025-03-08 22:13:47,352 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -35 predicate places. [2025-03-08 22:13:47,352 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1258 transitions, 3671 flow [2025-03-08 22:13:47,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1026.909090909091) internal successors, (11296), 11 states have internal predecessors, (11296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:47,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:47,355 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:47,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:13:47,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:47,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:47,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash -354777110, now seen corresponding path program 2 times [2025-03-08 22:13:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:47,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253855889] [2025-03-08 22:13:47,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:13:47,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:47,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 367 statements into 2 equivalence classes. [2025-03-08 22:13:47,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 22:13:47,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:13:47,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 148 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 22:13:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253855889] [2025-03-08 22:13:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253855889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:13:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813644745] [2025-03-08 22:13:48,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:13:48,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:48,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:13:48,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:13:48,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:13:48,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 367 statements into 2 equivalence classes. [2025-03-08 22:13:49,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 22:13:49,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:13:49,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:49,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 22:13:49,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:13:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 148 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 22:13:49,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:13:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 148 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 22:13:49,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813644745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:13:49,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:13:49,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-03-08 22:13:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934297235] [2025-03-08 22:13:49,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:13:49,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:13:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:49,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:13:49,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:13:51,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1226 [2025-03-08 22:13:51,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1258 transitions, 3671 flow. Second operand has 22 states, 22 states have (on average 1011.7727272727273) internal successors, (22259), 22 states have internal predecessors, (22259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:51,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:51,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1226 [2025-03-08 22:13:51,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:54,345 INFO L124 PetriNetUnfolderBase]: 830/12729 cut-off events. [2025-03-08 22:13:54,345 INFO L125 PetriNetUnfolderBase]: For 774/896 co-relation queries the response was YES. [2025-03-08 22:13:54,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15476 conditions, 12729 events. 830/12729 cut-off events. For 774/896 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 106786 event pairs, 12 based on Foata normal form. 1/11909 useless extension candidates. Maximal degree in co-relation 15456. Up to 1096 conditions per place. [2025-03-08 22:13:54,399 INFO L140 encePairwiseOnDemand]: 1205/1226 looper letters, 155 selfloop transitions, 25 changer transitions 0/1316 dead transitions. [2025-03-08 22:13:54,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1041 places, 1316 transitions, 4147 flow [2025-03-08 22:13:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:13:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-08 22:13:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17244 transitions. [2025-03-08 22:13:54,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8273678149889646 [2025-03-08 22:13:54,412 INFO L175 Difference]: Start difference. First operand has 1025 places, 1258 transitions, 3671 flow. Second operand 17 states and 17244 transitions. [2025-03-08 22:13:54,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1041 places, 1316 transitions, 4147 flow [2025-03-08 22:13:54,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1040 places, 1316 transitions, 4143 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 22:13:54,432 INFO L231 Difference]: Finished difference. Result has 1049 places, 1280 transitions, 3831 flow [2025-03-08 22:13:54,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1226, PETRI_DIFFERENCE_MINUEND_FLOW=3667, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3831, PETRI_PLACES=1049, PETRI_TRANSITIONS=1280} [2025-03-08 22:13:54,433 INFO L279 CegarLoopForPetriNet]: 1060 programPoint places, -11 predicate places. [2025-03-08 22:13:54,433 INFO L471 AbstractCegarLoop]: Abstraction has has 1049 places, 1280 transitions, 3831 flow [2025-03-08 22:13:54,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1011.7727272727273) internal successors, (22259), 22 states have internal predecessors, (22259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:54,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:54,438 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:54,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:13:54,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:13:54,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 71 more)] === [2025-03-08 22:13:54,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:54,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2039926727, now seen corresponding path program 1 times [2025-03-08 22:13:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:54,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689381625] [2025-03-08 22:13:54,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:54,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-08 22:13:54,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-08 22:13:54,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:54,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:13:54,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:13:54,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-03-08 22:13:54,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-03-08 22:13:54,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:54,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:13:55,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:13:55,079 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:13:55,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 74 remaining) [2025-03-08 22:13:55,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (72 of 74 remaining) [2025-03-08 22:13:55,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (71 of 74 remaining) [2025-03-08 22:13:55,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (70 of 74 remaining) [2025-03-08 22:13:55,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (69 of 74 remaining) [2025-03-08 22:13:55,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (68 of 74 remaining) [2025-03-08 22:13:55,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (67 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (66 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (65 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (64 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (62 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30ASSERT_VIOLATIONDATA_RACE (61 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (60 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (59 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29ASSERT_VIOLATIONDATA_RACE (58 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (57 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28ASSERT_VIOLATIONDATA_RACE (56 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22ASSERT_VIOLATIONDATA_RACE (55 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (54 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONDATA_RACE (53 of 74 remaining) [2025-03-08 22:13:55,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26ASSERT_VIOLATIONDATA_RACE (52 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (51 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21ASSERT_VIOLATIONDATA_RACE (50 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (49 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (48 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (47 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (46 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25ASSERT_VIOLATIONDATA_RACE (45 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (44 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (43 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23ASSERT_VIOLATIONDATA_RACE (42 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (41 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONDATA_RACE (40 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (39 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (38 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (37 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (36 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (35 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (34 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (33 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (32 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (31 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30ASSERT_VIOLATIONDATA_RACE (30 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONDATA_RACE (29 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONDATA_RACE (28 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29ASSERT_VIOLATIONDATA_RACE (27 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONDATA_RACE (26 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28ASSERT_VIOLATIONDATA_RACE (25 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22ASSERT_VIOLATIONDATA_RACE (24 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19ASSERT_VIOLATIONDATA_RACE (23 of 74 remaining) [2025-03-08 22:13:55,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONDATA_RACE (22 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26ASSERT_VIOLATIONDATA_RACE (21 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONDATA_RACE (20 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21ASSERT_VIOLATIONDATA_RACE (19 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20ASSERT_VIOLATIONDATA_RACE (18 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18ASSERT_VIOLATIONDATA_RACE (17 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONDATA_RACE (16 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONDATA_RACE (15 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25ASSERT_VIOLATIONDATA_RACE (14 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONDATA_RACE (13 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONDATA_RACE (12 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23ASSERT_VIOLATIONDATA_RACE (11 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15ASSERT_VIOLATIONDATA_RACE (10 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONDATA_RACE (9 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONDATA_RACE (8 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONDATA_RACE (7 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16ASSERT_VIOLATIONDATA_RACE (6 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12ASSERT_VIOLATIONDATA_RACE (5 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONDATA_RACE (4 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11ASSERT_VIOLATIONDATA_RACE (3 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONDATA_RACE (2 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONDATA_RACE (1 of 74 remaining) [2025-03-08 22:13:55,086 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONDATA_RACE (0 of 74 remaining) [2025-03-08 22:13:55,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:13:55,087 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:55,089 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:13:55,090 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:13:55,245 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:13:55,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1842 places, 2133 transitions, 4282 flow [2025-03-08 22:13:55,991 INFO L124 PetriNetUnfolderBase]: 333/2349 cut-off events. [2025-03-08 22:13:55,991 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:13:56,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 2349 events. 333/2349 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 11350 event pairs, 0 based on Foata normal form. 0/1925 useless extension candidates. Maximal degree in co-relation 1946. Up to 12 conditions per place. [2025-03-08 22:13:56,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 1842 places, 2133 transitions, 4282 flow [2025-03-08 22:13:56,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1842 places, 2133 transitions, 4282 flow [2025-03-08 22:13:56,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:13:56,155 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;@479952e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:13:56,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-03-08 22:13:56,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:13:56,157 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-03-08 22:13:56,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:13:56,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:56,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:56,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-03-08 22:13:56,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash 331113021, now seen corresponding path program 1 times [2025-03-08 22:13:56,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:56,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059086414] [2025-03-08 22:13:56,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:56,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:56,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 22:13:56,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 22:13:56,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:56,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:56,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059086414] [2025-03-08 22:13:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059086414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:56,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:56,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:13:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048967029] [2025-03-08 22:13:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:56,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:13:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:56,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:13:56,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:13:56,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1808 out of 2133 [2025-03-08 22:13:56,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1842 places, 2133 transitions, 4282 flow. Second operand has 2 states, 2 states have (on average 1808.5) internal successors, (3617), 2 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:56,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:56,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1808 of 2133 [2025-03-08 22:13:56,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:14:01,866 INFO L124 PetriNetUnfolderBase]: 1209/21524 cut-off events. [2025-03-08 22:14:01,866 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-08 22:14:02,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22856 conditions, 21524 events. 1209/21524 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 236839 event pairs, 343 based on Foata normal form. 8147/27839 useless extension candidates. Maximal degree in co-relation 4300. Up to 1212 conditions per place. [2025-03-08 22:14:02,081 INFO L140 encePairwiseOnDemand]: 1860/2133 looper letters, 52 selfloop transitions, 0 changer transitions 12/1799 dead transitions. [2025-03-08 22:14:02,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1744 places, 1799 transitions, 3718 flow [2025-03-08 22:14:02,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:14:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 22:14:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3941 transitions. [2025-03-08 22:14:02,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9238162212845757 [2025-03-08 22:14:02,085 INFO L175 Difference]: Start difference. First operand has 1842 places, 2133 transitions, 4282 flow. Second operand 2 states and 3941 transitions. [2025-03-08 22:14:02,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1744 places, 1799 transitions, 3718 flow [2025-03-08 22:14:02,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1744 places, 1799 transitions, 3718 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:14:02,101 INFO L231 Difference]: Finished difference. Result has 1744 places, 1787 transitions, 3590 flow [2025-03-08 22:14:02,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=2133, PETRI_DIFFERENCE_MINUEND_FLOW=3614, PETRI_DIFFERENCE_MINUEND_PLACES=1743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=3590, PETRI_PLACES=1744, PETRI_TRANSITIONS=1787} [2025-03-08 22:14:02,103 INFO L279 CegarLoopForPetriNet]: 1842 programPoint places, -98 predicate places. [2025-03-08 22:14:02,103 INFO L471 AbstractCegarLoop]: Abstraction has has 1744 places, 1787 transitions, 3590 flow [2025-03-08 22:14:02,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1808.5) internal successors, (3617), 2 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:14:02,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:14:02,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:14:02,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:14:02,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-03-08 22:14:02,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:14:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1231061794, now seen corresponding path program 1 times [2025-03-08 22:14:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:14:02,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519680184] [2025-03-08 22:14:02,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:14:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:14:02,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 22:14:02,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 22:14:02,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:14:02,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:14:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:14:02,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:14:02,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519680184] [2025-03-08 22:14:02,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519680184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:14:02,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:14:02,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:14:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713168005] [2025-03-08 22:14:02,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:14:02,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:14:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:14:02,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:14:02,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:14:02,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1802 out of 2133 [2025-03-08 22:14:02,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1744 places, 1787 transitions, 3590 flow. Second operand has 3 states, 3 states have (on average 1804.3333333333333) internal successors, (5413), 3 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:14:02,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:14:02,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1802 of 2133 [2025-03-08 22:14:02,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:14:07,574 INFO L124 PetriNetUnfolderBase]: 1209/21530 cut-off events. [2025-03-08 22:14:07,574 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-08 22:14:07,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22871 conditions, 21530 events. 1209/21530 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 236747 event pairs, 343 based on Foata normal form. 1/19704 useless extension candidates. Maximal degree in co-relation 22866. Up to 1215 conditions per place. [2025-03-08 22:14:07,832 INFO L140 encePairwiseOnDemand]: 2130/2133 looper letters, 58 selfloop transitions, 2 changer transitions 0/1789 dead transitions. [2025-03-08 22:14:07,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1734 places, 1789 transitions, 3714 flow [2025-03-08 22:14:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:14:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:14:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5467 transitions. [2025-03-08 22:14:07,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8543522425378965 [2025-03-08 22:14:07,836 INFO L175 Difference]: Start difference. First operand has 1744 places, 1787 transitions, 3590 flow. Second operand 3 states and 5467 transitions. [2025-03-08 22:14:07,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1734 places, 1789 transitions, 3714 flow [2025-03-08 22:14:07,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1734 places, 1789 transitions, 3714 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:14:07,857 INFO L231 Difference]: Finished difference. Result has 1735 places, 1788 transitions, 3602 flow [2025-03-08 22:14:07,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=2133, PETRI_DIFFERENCE_MINUEND_FLOW=3590, PETRI_DIFFERENCE_MINUEND_PLACES=1732, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3602, PETRI_PLACES=1735, PETRI_TRANSITIONS=1788} [2025-03-08 22:14:07,859 INFO L279 CegarLoopForPetriNet]: 1842 programPoint places, -107 predicate places. [2025-03-08 22:14:07,859 INFO L471 AbstractCegarLoop]: Abstraction has has 1735 places, 1788 transitions, 3602 flow [2025-03-08 22:14:07,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1804.3333333333333) internal successors, (5413), 3 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:14:07,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:14:07,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:14:07,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:14:07,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-03-08 22:14:07,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:14:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash 507937683, now seen corresponding path program 1 times [2025-03-08 22:14:07,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:14:07,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564228242] [2025-03-08 22:14:07,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:14:07,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:14:07,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:14:07,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:14:07,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:14:07,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:14:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:14:07,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:14:07,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564228242] [2025-03-08 22:14:07,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564228242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:14:07,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937637435] [2025-03-08 22:14:07,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:14:07,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:14:07,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:14:07,968 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:14:07,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:14:08,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:14:08,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:14:08,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:14:08,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:14:08,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:14:08,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:14:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:14:08,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:14:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:14:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937637435] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 22:14:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:14:08,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 7 [2025-03-08 22:14:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909433925] [2025-03-08 22:14:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:14:08,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:14:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:14:08,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:14:08,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:14:08,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1801 out of 2133 [2025-03-08 22:14:08,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1735 places, 1788 transitions, 3602 flow. Second operand has 3 states, 3 states have (on average 1803.6666666666667) internal successors, (5411), 3 states have internal predecessors, (5411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:14:08,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:14:08,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1801 of 2133 [2025-03-08 22:14:08,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:14:14,668 INFO L124 PetriNetUnfolderBase]: 1209/21531 cut-off events. [2025-03-08 22:14:14,668 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-03-08 22:14:14,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22880 conditions, 21531 events. 1209/21531 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 236331 event pairs, 343 based on Foata normal form. 0/19704 useless extension candidates. Maximal degree in co-relation 22873. Up to 1215 conditions per place. [2025-03-08 22:14:14,909 INFO L140 encePairwiseOnDemand]: 2129/2133 looper letters, 57 selfloop transitions, 3 changer transitions 0/1789 dead transitions. [2025-03-08 22:14:14,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1737 places, 1789 transitions, 3724 flow [2025-03-08 22:14:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:14:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:14:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5464 transitions. [2025-03-08 22:14:14,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8538834192842631 [2025-03-08 22:14:14,914 INFO L175 Difference]: Start difference. First operand has 1735 places, 1788 transitions, 3602 flow. Second operand 3 states and 5464 transitions. [2025-03-08 22:14:14,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1737 places, 1789 transitions, 3724 flow [2025-03-08 22:14:14,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1736 places, 1789 transitions, 3722 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:14:14,933 INFO L231 Difference]: Finished difference. Result has 1738 places, 1789 transitions, 3618 flow [2025-03-08 22:14:14,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=2133, PETRI_DIFFERENCE_MINUEND_FLOW=3600, PETRI_DIFFERENCE_MINUEND_PLACES=1734, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3618, PETRI_PLACES=1738, PETRI_TRANSITIONS=1789} [2025-03-08 22:14:14,935 INFO L279 CegarLoopForPetriNet]: 1842 programPoint places, -104 predicate places. [2025-03-08 22:14:14,935 INFO L471 AbstractCegarLoop]: Abstraction has has 1738 places, 1789 transitions, 3618 flow [2025-03-08 22:14:14,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1803.6666666666667) internal successors, (5411), 3 states have internal predecessors, (5411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:14:14,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:14:14,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:14:14,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:14:15,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 22:14:15,137 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 102 more)] === [2025-03-08 22:14:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:14:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 164233092, now seen corresponding path program 1 times [2025-03-08 22:14:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:14:15,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203537943] [2025-03-08 22:14:15,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:14:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:14:15,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:14:15,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:14:15,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:14:15,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:14:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:14:15,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:14:15,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203537943] [2025-03-08 22:14:15,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203537943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:14:15,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413977539] [2025-03-08 22:14:15,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:14:15,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:14:15,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:14:15,264 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:14:15,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:14:15,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:14:15,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:14:15,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:14:15,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:14:15,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 22:14:15,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:14:15,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:14:15,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-08 22:14:15,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:14:15,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-08 22:14:15,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:14:15,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-08 22:14:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:14:15,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:14:15,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413977539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:14:15,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:14:15,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-08 22:14:15,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168884108] [2025-03-08 22:14:15,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:14:15,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:14:15,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:14:15,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:14:15,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:14:15,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1709 out of 2133 [2025-03-08 22:14:15,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1738 places, 1789 transitions, 3618 flow. Second operand has 6 states, 6 states have (on average 1711.0) internal successors, (10266), 6 states have internal predecessors, (10266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:14:15,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:14:15,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1709 of 2133 [2025-03-08 22:14:15,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand