./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:27:55,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:27:55,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:27:55,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:27:55,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:27:55,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:27:55,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:27:55,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:27:55,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:27:55,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:27:55,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:27:55,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:27:55,137 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:27:55,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:27:55,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:27:55,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:27:55,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:27:55,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:27:55,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:27:55,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:27:55,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:55,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:55,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:27:55,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:55,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:55,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:55,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:27:55,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:27:55,139 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:27:55,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:27:55,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:27:55,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:27:55,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:27:55,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:27:55,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:27:55,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:27:55,140 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2025-01-09 21:27:55,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:27:55,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:27:55,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:27:55,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:27:55,358 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:27:55,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-01-09 21:27:56,505 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1892dd685/15cfacf77e2043aab36a15914c0e0941/FLAGcbb00f5a7 [2025-01-09 21:27:56,778 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:27:56,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-01-09 21:27:56,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1892dd685/15cfacf77e2043aab36a15914c0e0941/FLAGcbb00f5a7 [2025-01-09 21:27:57,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1892dd685/15cfacf77e2043aab36a15914c0e0941 [2025-01-09 21:27:57,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:27:57,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:27:57,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:57,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:27:57,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:27:57,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3096ba43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57, skipping insertion in model container [2025-01-09 21:27:57,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:27:57,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:57,323 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:27:57,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:57,399 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:27:57,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57 WrapperNode [2025-01-09 21:27:57,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:57,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:57,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:27:57,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:27:57,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,438 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 196 [2025-01-09 21:27:57,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:57,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:27:57,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:27:57,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:27:57,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:27:57,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:27:57,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:27:57,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:27:57,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (1/1) ... [2025-01-09 21:27:57,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:57,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:27:57,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:27:57,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:27:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:27:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:27:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:27:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:27:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:27:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:27:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:27:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:27:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:27:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:27:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:27:57,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:27:57,548 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:27:57,653 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:27:57,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:27:57,927 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:27:57,928 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:27:57,973 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:27:57,974 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-01-09 21:27:57,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:57 BoogieIcfgContainer [2025-01-09 21:27:57,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:27:57,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:27:57,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:27:57,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:27:57,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:27:57" (1/3) ... [2025-01-09 21:27:57,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e5b040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:57, skipping insertion in model container [2025-01-09 21:27:57,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:57" (2/3) ... [2025-01-09 21:27:57,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e5b040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:57, skipping insertion in model container [2025-01-09 21:27:57,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:57" (3/3) ... [2025-01-09 21:27:57,980 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2025-01-09 21:27:57,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:27:57,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_60-invariant_racefree.i that has 2 procedures, 186 locations, 1 initial locations, 10 loop locations, and 13 error locations. [2025-01-09 21:27:57,991 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:27:58,052 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:27:58,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 208 transitions, 423 flow [2025-01-09 21:27:58,184 INFO L124 PetriNetUnfolderBase]: 32/305 cut-off events. [2025-01-09 21:27:58,186 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:27:58,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 305 events. 32/305 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1291 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 177. Up to 6 conditions per place. [2025-01-09 21:27:58,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 208 transitions, 423 flow [2025-01-09 21:27:58,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 208 transitions, 423 flow [2025-01-09 21:27:58,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:58,214 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;@5f18cfa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:58,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 21:27:58,225 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:58,228 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2025-01-09 21:27:58,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:58,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:58,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:58,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:27:58,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:58,235 INFO L85 PathProgramCache]: Analyzing trace with hash 153490306, now seen corresponding path program 1 times [2025-01-09 21:27:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553357172] [2025-01-09 21:27:58,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:58,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:27:58,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:27:58,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:58,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:58,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553357172] [2025-01-09 21:27:58,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553357172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:58,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:58,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:58,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492871319] [2025-01-09 21:27:58,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:58,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:27:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:58,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:27:58,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:27:58,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 208 [2025-01-09 21:27:58,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 208 transitions, 423 flow. Second operand has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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-01-09 21:27:58,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:58,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 208 [2025-01-09 21:27:58,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:58,543 INFO L124 PetriNetUnfolderBase]: 82/853 cut-off events. [2025-01-09 21:27:58,543 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:27:58,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 853 events. 82/853 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5110 event pairs, 72 based on Foata normal form. 133/880 useless extension candidates. Maximal degree in co-relation 898. Up to 172 conditions per place. [2025-01-09 21:27:58,552 INFO L140 encePairwiseOnDemand]: 188/208 looper letters, 19 selfloop transitions, 0 changer transitions 0/184 dead transitions. [2025-01-09 21:27:58,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 184 transitions, 413 flow [2025-01-09 21:27:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:27:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:27:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 373 transitions. [2025-01-09 21:27:58,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8966346153846154 [2025-01-09 21:27:58,566 INFO L175 Difference]: Start difference. First operand has 189 places, 208 transitions, 423 flow. Second operand 2 states and 373 transitions. [2025-01-09 21:27:58,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 184 transitions, 413 flow [2025-01-09 21:27:58,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 184 transitions, 413 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:58,574 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 375 flow [2025-01-09 21:27:58,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=375, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2025-01-09 21:27:58,580 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, -3 predicate places. [2025-01-09 21:27:58,581 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 375 flow [2025-01-09 21:27:58,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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-01-09 21:27:58,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:58,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:58,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:27:58,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:27:58,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 156163885, now seen corresponding path program 1 times [2025-01-09 21:27:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789584674] [2025-01-09 21:27:58,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:58,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:58,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:27:58,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:27:58,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:58,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:58,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789584674] [2025-01-09 21:27:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789584674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:58,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:58,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:58,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153017622] [2025-01-09 21:27:58,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:58,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:58,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:58,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:58,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:58,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 208 [2025-01-09 21:27:58,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-01-09 21:27:58,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:58,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 208 [2025-01-09 21:27:58,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:58,899 INFO L124 PetriNetUnfolderBase]: 110/1056 cut-off events. [2025-01-09 21:27:58,899 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:27:58,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 1056 events. 110/1056 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6706 event pairs, 88 based on Foata normal form. 1/941 useless extension candidates. Maximal degree in co-relation 1301. Up to 232 conditions per place. [2025-01-09 21:27:58,905 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 32 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-01-09 21:27:58,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 193 transitions, 461 flow [2025-01-09 21:27:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2025-01-09 21:27:58,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8301282051282052 [2025-01-09 21:27:58,910 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 375 flow. Second operand 3 states and 518 transitions. [2025-01-09 21:27:58,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 193 transitions, 461 flow [2025-01-09 21:27:58,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 193 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:58,916 INFO L231 Difference]: Finished difference. Result has 189 places, 184 transitions, 383 flow [2025-01-09 21:27:58,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=189, PETRI_TRANSITIONS=184} [2025-01-09 21:27:58,917 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, 0 predicate places. [2025-01-09 21:27:58,917 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 184 transitions, 383 flow [2025-01-09 21:27:58,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-01-09 21:27:58,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:58,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:58,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:27:58,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:27:58,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:58,919 INFO L85 PathProgramCache]: Analyzing trace with hash -320663510, now seen corresponding path program 1 times [2025-01-09 21:27:58,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:58,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165971692] [2025-01-09 21:27:58,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:58,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:27:58,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:27:58,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:58,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:59,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:59,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165971692] [2025-01-09 21:27:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165971692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:59,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:59,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:59,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385891449] [2025-01-09 21:27:59,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:59,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:59,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:59,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:59,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:59,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 208 [2025-01-09 21:27:59,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 184 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 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-01-09 21:27:59,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:59,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 208 [2025-01-09 21:27:59,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:59,656 INFO L124 PetriNetUnfolderBase]: 202/1301 cut-off events. [2025-01-09 21:27:59,657 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:27:59,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 1301 events. 202/1301 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 9050 event pairs, 136 based on Foata normal form. 0/1180 useless extension candidates. Maximal degree in co-relation 1771. Up to 335 conditions per place. [2025-01-09 21:27:59,662 INFO L140 encePairwiseOnDemand]: 202/208 looper letters, 67 selfloop transitions, 5 changer transitions 0/219 dead transitions. [2025-01-09 21:27:59,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 219 transitions, 597 flow [2025-01-09 21:27:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 967 transitions. [2025-01-09 21:27:59,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7748397435897436 [2025-01-09 21:27:59,665 INFO L175 Difference]: Start difference. First operand has 189 places, 184 transitions, 383 flow. Second operand 6 states and 967 transitions. [2025-01-09 21:27:59,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 219 transitions, 597 flow [2025-01-09 21:27:59,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 219 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:59,669 INFO L231 Difference]: Finished difference. Result has 191 places, 183 transitions, 387 flow [2025-01-09 21:27:59,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=183} [2025-01-09 21:27:59,670 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, 2 predicate places. [2025-01-09 21:27:59,670 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 183 transitions, 387 flow [2025-01-09 21:27:59,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 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-01-09 21:27:59,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:59,675 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] [2025-01-09 21:27:59,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:27:59,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:27:59,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1087765023, now seen corresponding path program 1 times [2025-01-09 21:27:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:59,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565749330] [2025-01-09 21:27:59,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:59,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:27:59,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:27:59,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:59,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:59,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:59,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565749330] [2025-01-09 21:27:59,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565749330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:59,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:59,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043694604] [2025-01-09 21:27:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:59,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:59,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:59,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:59,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:59,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 208 [2025-01-09 21:27:59,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 183 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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-01-09 21:27:59,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:59,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 208 [2025-01-09 21:27:59,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:59,974 INFO L124 PetriNetUnfolderBase]: 442/2623 cut-off events. [2025-01-09 21:27:59,975 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:27:59,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3616 conditions, 2623 events. 442/2623 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21221 event pairs, 177 based on Foata normal form. 0/2379 useless extension candidates. Maximal degree in co-relation 3610. Up to 608 conditions per place. [2025-01-09 21:27:59,982 INFO L140 encePairwiseOnDemand]: 183/208 looper letters, 62 selfloop transitions, 18 changer transitions 0/219 dead transitions. [2025-01-09 21:27:59,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 219 transitions, 622 flow [2025-01-09 21:27:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2025-01-09 21:27:59,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8221153846153846 [2025-01-09 21:27:59,984 INFO L175 Difference]: Start difference. First operand has 191 places, 183 transitions, 387 flow. Second operand 3 states and 513 transitions. [2025-01-09 21:27:59,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 219 transitions, 622 flow [2025-01-09 21:27:59,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 219 transitions, 612 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:59,990 INFO L231 Difference]: Finished difference. Result has 190 places, 201 transitions, 535 flow [2025-01-09 21:27:59,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=190, PETRI_TRANSITIONS=201} [2025-01-09 21:27:59,990 INFO L279 CegarLoopForPetriNet]: 189 programPoint places, 1 predicate places. [2025-01-09 21:27:59,990 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 201 transitions, 535 flow [2025-01-09 21:27:59,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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-01-09 21:27:59,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:59,991 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] [2025-01-09 21:27:59,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:27:59,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:27:59,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash 454140754, now seen corresponding path program 1 times [2025-01-09 21:27:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:59,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893521675] [2025-01-09 21:27:59,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:00,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:28:00,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:28:00,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:00,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:00,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:28:00,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:28:00,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:28:00,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:00,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:00,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:28:00,047 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:28:00,048 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-01-09 21:28:00,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-01-09 21:28:00,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-01-09 21:28:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:28:00,051 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:28:00,053 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:28:00,053 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:28:00,083 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:28:00,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 287 transitions, 590 flow [2025-01-09 21:28:00,121 INFO L124 PetriNetUnfolderBase]: 55/508 cut-off events. [2025-01-09 21:28:00,121 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:28:00,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 508 events. 55/508 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2355 event pairs, 0 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 307. Up to 9 conditions per place. [2025-01-09 21:28:00,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 287 transitions, 590 flow [2025-01-09 21:28:00,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 287 transitions, 590 flow [2025-01-09 21:28:00,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:00,128 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;@5f18cfa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:00,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:28:00,132 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:00,132 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2025-01-09 21:28:00,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:00,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:00,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:00,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:28:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1521437342, now seen corresponding path program 1 times [2025-01-09 21:28:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:00,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036806650] [2025-01-09 21:28:00,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:00,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:00,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:28:00,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:28:00,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:00,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036806650] [2025-01-09 21:28:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036806650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117155480] [2025-01-09 21:28:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:28:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:00,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:28:00,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:28:00,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 287 [2025-01-09 21:28:00,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 287 transitions, 590 flow. Second operand has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 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-01-09 21:28:00,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:00,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 287 [2025-01-09 21:28:00,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:00,891 INFO L124 PetriNetUnfolderBase]: 1733/9097 cut-off events. [2025-01-09 21:28:00,891 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-09 21:28:00,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11797 conditions, 9097 events. 1733/9097 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 100988 event pairs, 1620 based on Foata normal form. 2024/10010 useless extension candidates. Maximal degree in co-relation 10589. Up to 2642 conditions per place. [2025-01-09 21:28:00,931 INFO L140 encePairwiseOnDemand]: 257/287 looper letters, 30 selfloop transitions, 0 changer transitions 0/251 dead transitions. [2025-01-09 21:28:00,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 251 transitions, 578 flow [2025-01-09 21:28:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:28:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:28:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 508 transitions. [2025-01-09 21:28:00,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8850174216027874 [2025-01-09 21:28:00,933 INFO L175 Difference]: Start difference. First operand has 258 places, 287 transitions, 590 flow. Second operand 2 states and 508 transitions. [2025-01-09 21:28:00,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 251 transitions, 578 flow [2025-01-09 21:28:00,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 251 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:00,936 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 518 flow [2025-01-09 21:28:00,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=518, PETRI_PLACES=253, PETRI_TRANSITIONS=251} [2025-01-09 21:28:00,937 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -5 predicate places. [2025-01-09 21:28:00,937 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 518 flow [2025-01-09 21:28:00,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 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-01-09 21:28:00,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:00,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:00,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:28:00,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:28:00,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1518763763, now seen corresponding path program 1 times [2025-01-09 21:28:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552341277] [2025-01-09 21:28:00,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:00,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:00,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:28:00,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:28:00,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:00,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:00,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552341277] [2025-01-09 21:28:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552341277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:00,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:00,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:00,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724867397] [2025-01-09 21:28:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:00,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:00,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:00,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:00,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:00,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 287 [2025-01-09 21:28:00,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-01-09 21:28:00,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:00,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 287 [2025-01-09 21:28:00,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:02,010 INFO L124 PetriNetUnfolderBase]: 2529/12797 cut-off events. [2025-01-09 21:28:02,010 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-01-09 21:28:02,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16706 conditions, 12797 events. 2529/12797 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 150091 event pairs, 1098 based on Foata normal form. 1/11369 useless extension candidates. Maximal degree in co-relation 16701. Up to 3840 conditions per place. [2025-01-09 21:28:02,066 INFO L140 encePairwiseOnDemand]: 284/287 looper letters, 44 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2025-01-09 21:28:02,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 261 transitions, 630 flow [2025-01-09 21:28:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-01-09 21:28:02,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8141695702671312 [2025-01-09 21:28:02,068 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 518 flow. Second operand 3 states and 701 transitions. [2025-01-09 21:28:02,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 261 transitions, 630 flow [2025-01-09 21:28:02,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 261 transitions, 630 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:02,073 INFO L231 Difference]: Finished difference. Result has 256 places, 252 transitions, 530 flow [2025-01-09 21:28:02,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=256, PETRI_TRANSITIONS=252} [2025-01-09 21:28:02,075 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -2 predicate places. [2025-01-09 21:28:02,075 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 252 transitions, 530 flow [2025-01-09 21:28:02,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-01-09 21:28:02,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:02,075 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] [2025-01-09 21:28:02,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:28:02,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:28:02,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash -703812759, now seen corresponding path program 1 times [2025-01-09 21:28:02,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:02,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491096717] [2025-01-09 21:28:02,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:02,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:02,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:28:02,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:28:02,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:02,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:02,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:02,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491096717] [2025-01-09 21:28:02,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491096717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:02,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:02,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:02,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210496098] [2025-01-09 21:28:02,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:02,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:02,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:02,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:02,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 287 [2025-01-09 21:28:02,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 252 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 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-01-09 21:28:02,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:02,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 287 [2025-01-09 21:28:02,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:03,816 INFO L124 PetriNetUnfolderBase]: 4384/17297 cut-off events. [2025-01-09 21:28:03,816 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2025-01-09 21:28:03,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24464 conditions, 17297 events. 4384/17297 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 205166 event pairs, 2104 based on Foata normal form. 0/15597 useless extension candidates. Maximal degree in co-relation 24457. Up to 5258 conditions per place. [2025-01-09 21:28:03,912 INFO L140 encePairwiseOnDemand]: 281/287 looper letters, 114 selfloop transitions, 6 changer transitions 0/323 dead transitions. [2025-01-09 21:28:03,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 323 transitions, 912 flow [2025-01-09 21:28:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-01-09 21:28:03,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7874564459930313 [2025-01-09 21:28:03,916 INFO L175 Difference]: Start difference. First operand has 256 places, 252 transitions, 530 flow. Second operand 6 states and 1356 transitions. [2025-01-09 21:28:03,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 323 transitions, 912 flow [2025-01-09 21:28:03,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 323 transitions, 910 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:03,920 INFO L231 Difference]: Finished difference. Result has 259 places, 251 transitions, 538 flow [2025-01-09 21:28:03,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=259, PETRI_TRANSITIONS=251} [2025-01-09 21:28:03,921 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, 1 predicate places. [2025-01-09 21:28:03,921 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 251 transitions, 538 flow [2025-01-09 21:28:03,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 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-01-09 21:28:03,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:03,922 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] [2025-01-09 21:28:03,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:28:03,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:28:03,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash -817949295, now seen corresponding path program 1 times [2025-01-09 21:28:03,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:03,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283735881] [2025-01-09 21:28:03,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:03,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:03,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:28:03,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:28:03,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:03,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283735881] [2025-01-09 21:28:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283735881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:03,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:03,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935822995] [2025-01-09 21:28:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:03,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:03,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:03,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:04,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 287 [2025-01-09 21:28:04,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 251 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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-01-09 21:28:04,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:04,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 287 [2025-01-09 21:28:04,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:09,569 INFO L124 PetriNetUnfolderBase]: 26162/85747 cut-off events. [2025-01-09 21:28:09,570 INFO L125 PetriNetUnfolderBase]: For 552/552 co-relation queries the response was YES. [2025-01-09 21:28:09,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128050 conditions, 85747 events. 26162/85747 cut-off events. For 552/552 co-relation queries the response was YES. Maximal size of possible extension queue 1629. Compared 1194607 event pairs, 10477 based on Foata normal form. 0/76867 useless extension candidates. Maximal degree in co-relation 128043. Up to 26496 conditions per place. [2025-01-09 21:28:10,090 INFO L140 encePairwiseOnDemand]: 248/287 looper letters, 98 selfloop transitions, 28 changer transitions 0/308 dead transitions. [2025-01-09 21:28:10,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 308 transitions, 915 flow [2025-01-09 21:28:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2025-01-09 21:28:10,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8037166085946573 [2025-01-09 21:28:10,092 INFO L175 Difference]: Start difference. First operand has 259 places, 251 transitions, 538 flow. Second operand 3 states and 692 transitions. [2025-01-09 21:28:10,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 308 transitions, 915 flow [2025-01-09 21:28:10,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 308 transitions, 903 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:28:10,097 INFO L231 Difference]: Finished difference. Result has 258 places, 279 transitions, 772 flow [2025-01-09 21:28:10,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=258, PETRI_TRANSITIONS=279} [2025-01-09 21:28:10,097 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, 0 predicate places. [2025-01-09 21:28:10,098 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 279 transitions, 772 flow [2025-01-09 21:28:10,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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-01-09 21:28:10,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:10,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:10,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:28:10,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:28:10,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1941602494, now seen corresponding path program 1 times [2025-01-09 21:28:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:10,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388926397] [2025-01-09 21:28:10,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:10,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:28:10,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:28:10,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:10,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:10,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-01-09 21:28:10,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:10,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388926397] [2025-01-09 21:28:10,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388926397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:10,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:10,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:10,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958825569] [2025-01-09 21:28:10,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:10,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:28:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:10,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:28:10,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:28:10,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 287 [2025-01-09 21:28:10,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 279 transitions, 772 flow. Second operand has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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-01-09 21:28:10,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:10,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 287 [2025-01-09 21:28:10,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:11,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 75#L706-25true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 245#L702-5true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:11,334 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-01-09 21:28:11,334 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:28:11,334 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:28:11,334 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-01-09 21:28:11,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 248#L713-5true, 156#L706-26true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 245#L702-5true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:11,415 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,415 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,415 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,415 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 75#L706-25true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 95#L702-6true, 261#true]) [2025-01-09 21:28:11,489 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,489 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,490 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,490 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [69#L711-16true, 278#true, Black: 275#(= |#race~x~0| 0), 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 245#L702-5true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,494 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,494 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,494 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,494 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-01-09 21:28:11,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 248#L713-5true, 156#L706-26true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 95#L702-6true, 261#true]) [2025-01-09 21:28:11,572 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,572 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,572 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,572 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [69#L711-16true, 278#true, Black: 275#(= |#race~x~0| 0), 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 95#L702-6true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,582 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,582 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,582 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,582 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 245#L702-5true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,583 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,583 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,583 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,583 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-01-09 21:28:11,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [75#L706-25true, 278#true, 248#L713-5true, Black: 273#true, 110#L706-5true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:11,629 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,629 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,630 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,630 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 273#true, 95#L702-6true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,675 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,675 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,675 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,675 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 245#L702-5true, 273#true, 197#L712true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,676 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,676 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,676 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,676 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-01-09 21:28:11,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 248#L713-5true, 156#L706-26true, Black: 273#true, 110#L706-5true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:11,722 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,722 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,722 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,722 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 95#L702-6true, 273#true, 202#L706-36true, 197#L712true, 261#true]) [2025-01-09 21:28:11,765 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,765 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,765 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,765 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 15#L712-3true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 245#L702-5true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,767 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,767 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,767 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,767 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,805 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [75#L706-25true, 278#true, 248#L713-5true, Black: 273#true, 137#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:11,805 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,805 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,805 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,805 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [69#L711-16true, 278#true, 75#L706-25true, 147#L706-16true, Black: 275#(= |#race~x~0| 0), 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2025-01-09 21:28:11,809 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,809 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,809 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,809 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [69#L711-16true, 278#true, Black: 275#(= |#race~x~0| 0), 110#L706-5true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,811 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,811 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,811 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,811 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-01-09 21:28:11,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 15#L712-3true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 273#true, 95#L702-6true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,853 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,853 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,853 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,853 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([920] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [69#L711-16true, 278#true, 139#L706-30true, Black: 273#true, 257#true, 259#true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:11,854 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,854 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,854 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,854 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 139#L706-30true, 248#L713-5true, Black: 273#true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 275#(= |#race~x~0| 0), 95#L702-6true, 261#true]) [2025-01-09 21:28:11,855 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,855 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,855 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,855 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 248#L713-5true, 156#L706-26true, Black: 273#true, 137#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:11,892 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,892 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,892 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,892 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [75#L706-25true, 278#true, 147#L706-16true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2025-01-09 21:28:11,899 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,899 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,899 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,899 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 69#L711-16true, 147#L706-16true, Black: 275#(= |#race~x~0| 0), 156#L706-26true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2025-01-09 21:28:11,900 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,900 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,900 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,900 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [69#L711-16true, 278#true, Black: 275#(= |#race~x~0| 0), 137#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,901 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,901 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,901 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,901 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 110#L706-5true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,902 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,902 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,902 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,902 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-01-09 21:28:11,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 139#L706-30true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 245#L702-5true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:11,945 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is not cut-off event [2025-01-09 21:28:11,945 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2025-01-09 21:28:11,945 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2025-01-09 21:28:11,945 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is not cut-off event [2025-01-09 21:28:11,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([920] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [278#true, 139#L706-30true, Black: 273#true, 90#L711-17true, 257#true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 168#L702-12true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:11,949 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,949 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,949 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,949 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [75#L706-25true, 278#true, 147#L706-16true, Black: 275#(= |#race~x~0| 0), 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 197#L712true, 261#true]) [2025-01-09 21:28:11,991 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,991 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,991 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,991 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 147#L706-16true, Black: 275#(= |#race~x~0| 0), 156#L706-26true, 90#L711-17true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2025-01-09 21:28:11,991 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,991 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,991 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,991 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 90#L711-17true, 137#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:11,992 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,992 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,993 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,993 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 110#L706-5true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 197#L712true, 261#true]) [2025-01-09 21:28:11,993 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,993 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,993 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:11,993 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-01-09 21:28:12,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 139#L706-30true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 95#L702-6true, 261#true]) [2025-01-09 21:28:12,029 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is not cut-off event [2025-01-09 21:28:12,029 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2025-01-09 21:28:12,029 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2025-01-09 21:28:12,029 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2025-01-09 21:28:12,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 139#L706-30true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 109#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:12,036 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is not cut-off event [2025-01-09 21:28:12,036 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2025-01-09 21:28:12,036 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2025-01-09 21:28:12,037 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2025-01-09 21:28:12,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([920] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [278#true, 139#L706-30true, Black: 273#true, 257#true, 259#true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 275#(= |#race~x~0| 0), 197#L712true, 261#true]) [2025-01-09 21:28:12,041 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,041 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,041 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,041 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 257#true, 86#L713-3true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 245#L702-5true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:12,042 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,042 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,042 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,042 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 75#L706-25true, 147#L706-16true, Black: 275#(= |#race~x~0| 0), 15#L712-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2025-01-09 21:28:12,086 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,086 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,086 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,086 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 147#L706-16true, 156#L706-26true, Black: 275#(= |#race~x~0| 0), 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 197#L712true, 261#true]) [2025-01-09 21:28:12,087 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,087 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,087 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,087 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [75#L706-25true, 57#L706-10true, 278#true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:12,087 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,087 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,088 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,088 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 137#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 197#L712true, 261#true]) [2025-01-09 21:28:12,089 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,089 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,089 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,089 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 15#L712-3true, 110#L706-5true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:12,090 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,090 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,090 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,090 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-01-09 21:28:12,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 257#true, 86#L713-3true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 273#true, 95#L702-6true, 202#L706-36true, 261#true]) [2025-01-09 21:28:12,135 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,135 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,135 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,135 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([920] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [278#true, 139#L706-30true, 15#L712-3true, Black: 273#true, 257#true, 168#L702-12true, 259#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:12,135 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,135 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,135 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,135 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 147#L706-16true, 156#L706-26true, Black: 275#(= |#race~x~0| 0), 15#L712-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2025-01-09 21:28:12,180 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,180 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,180 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,180 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [57#L706-10true, 278#true, 248#L713-5true, 156#L706-26true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:12,181 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,181 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,181 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,181 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, 15#L712-3true, Black: 275#(= |#race~x~0| 0), 137#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:12,182 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,182 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,182 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,182 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-01-09 21:28:12,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][152], [278#true, 139#L706-30true, 248#L713-5true, Black: 273#true, 137#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:12,183 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,183 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,183 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,183 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-01-09 21:28:12,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 139#L706-30true, 248#L713-5true, Black: 273#true, 110#L706-5true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:12,274 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is not cut-off event [2025-01-09 21:28:12,274 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2025-01-09 21:28:12,274 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2025-01-09 21:28:12,274 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2025-01-09 21:28:12,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [57#L706-10true, 278#true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 216#t_funErr4ASSERT_VIOLATIONDATA_RACEtrue, 261#true]) [2025-01-09 21:28:12,352 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,352 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,352 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,352 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 139#L706-30true, 248#L713-5true, Black: 273#true, 137#L706-6true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:12,363 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,363 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,363 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,363 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [278#true, 139#L706-30true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 142#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 261#true]) [2025-01-09 21:28:12,369 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,369 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,369 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,369 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2025-01-09 21:28:12,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [75#L706-25true, 278#true, 147#L706-16true, Black: 275#(= |#race~x~0| 0), 86#L713-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2025-01-09 21:28:12,373 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,373 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,373 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,373 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 110#L706-5true, 86#L713-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:12,379 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,379 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,379 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,379 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-01-09 21:28:12,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([920] L702-9-->L702-12: Formula: (and (= (store |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65| (store (select |v_#pthreadsMutex_160| |v_~#__global_lock~0.base_65|) |v_~#__global_lock~0.offset_65| 0)) |v_#pthreadsMutex_159|) (= |v_t_funThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_160|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_159|, t_funThread1of2ForFork0_#t~ret5#1=|v_t_funThread1of2ForFork0_#t~ret5#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_65|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_65|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret5#1][174], [278#true, 139#L706-30true, Black: 273#true, 257#true, 86#L713-3true, 259#true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:12,428 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,428 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,428 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,428 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] L706-13-->L706-16: Formula: (and (= (store |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49| (store (select |v_#pthreadsMutex_120| |v_~#__global_lock~0.base_49|) |v_~#__global_lock~0.offset_49| 0)) |v_#pthreadsMutex_119|) (= |v_t_funThread1of2ForFork0_#t~ret11#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, t_funThread1of2ForFork0_#t~ret11#1=|v_t_funThread1of2ForFork0_#t~ret11#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_49|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~ret11#1][196], [278#true, 147#L706-16true, Black: 275#(= |#race~x~0| 0), 156#L706-26true, 86#L713-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 261#true]) [2025-01-09 21:28:12,479 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,479 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,479 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,479 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L706-33-->L706-36: Formula: (and (= |v_t_funThread2of2ForFork0_#t~ret15#1_1| 0) (= (store |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57| (store (select |v_#pthreadsMutex_136| |v_~#__global_lock~0.base_57|) |v_~#__global_lock~0.offset_57| 0)) |v_#pthreadsMutex_135|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_136|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{t_funThread2of2ForFork0_#t~ret15#1=|v_t_funThread2of2ForFork0_#t~ret15#1_1|, #pthreadsMutex=|v_#pthreadsMutex_135|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~ret15#1, #pthreadsMutex][270], [278#true, Black: 275#(= |#race~x~0| 0), 137#L706-6true, 86#L713-3true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 273#true, 202#L706-36true, 261#true]) [2025-01-09 21:28:12,480 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,480 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,480 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,480 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-01-09 21:28:12,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([690] L713-4-->L713-5: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][141], [57#L706-10true, 278#true, 139#L706-30true, 248#L713-5true, Black: 273#true, 257#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 259#true, 275#(= |#race~x~0| 0), 261#true]) [2025-01-09 21:28:12,729 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2025-01-09 21:28:12,729 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-01-09 21:28:12,729 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-01-09 21:28:12,729 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-01-09 21:28:15,593 INFO L124 PetriNetUnfolderBase]: 16128/73456 cut-off events. [2025-01-09 21:28:15,593 INFO L125 PetriNetUnfolderBase]: For 5385/5767 co-relation queries the response was YES. [2025-01-09 21:28:15,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110864 conditions, 73456 events. 16128/73456 cut-off events. For 5385/5767 co-relation queries the response was YES. Maximal size of possible extension queue 1381. Compared 1105005 event pairs, 7429 based on Foata normal form. 10/65914 useless extension candidates. Maximal degree in co-relation 110856. Up to 15386 conditions per place. [2025-01-09 21:28:15,966 INFO L140 encePairwiseOnDemand]: 282/287 looper letters, 81 selfloop transitions, 5 changer transitions 0/326 dead transitions. [2025-01-09 21:28:15,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 326 transitions, 1038 flow [2025-01-09 21:28:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1383 transitions. [2025-01-09 21:28:15,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8031358885017421 [2025-01-09 21:28:15,972 INFO L175 Difference]: Start difference. First operand has 258 places, 279 transitions, 772 flow. Second operand 6 states and 1383 transitions. [2025-01-09 21:28:15,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 326 transitions, 1038 flow [2025-01-09 21:28:16,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 326 transitions, 982 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:16,045 INFO L231 Difference]: Finished difference. Result has 264 places, 281 transitions, 742 flow [2025-01-09 21:28:16,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=264, PETRI_TRANSITIONS=281} [2025-01-09 21:28:16,046 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, 6 predicate places. [2025-01-09 21:28:16,046 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 281 transitions, 742 flow [2025-01-09 21:28:16,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 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-01-09 21:28:16,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:16,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:16,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:28:16,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:28:16,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash -622654989, now seen corresponding path program 1 times [2025-01-09 21:28:16,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:16,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129245852] [2025-01-09 21:28:16,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:16,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:28:16,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:28:16,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:16,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129245852] [2025-01-09 21:28:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129245852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:16,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:16,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:16,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50526857] [2025-01-09 21:28:16,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:16,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:16,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:16,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:16,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 287 [2025-01-09 21:28:16,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 281 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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-01-09 21:28:16,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:16,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 287 [2025-01-09 21:28:16,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:23,154 INFO L124 PetriNetUnfolderBase]: 21447/92236 cut-off events. [2025-01-09 21:28:23,154 INFO L125 PetriNetUnfolderBase]: For 825/872 co-relation queries the response was YES. [2025-01-09 21:28:23,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134511 conditions, 92236 events. 21447/92236 cut-off events. For 825/872 co-relation queries the response was YES. Maximal size of possible extension queue 2115. Compared 1432651 event pairs, 10112 based on Foata normal form. 0/82156 useless extension candidates. Maximal degree in co-relation 134500. Up to 17313 conditions per place. [2025-01-09 21:28:23,618 INFO L140 encePairwiseOnDemand]: 276/287 looper letters, 65 selfloop transitions, 9 changer transitions 0/312 dead transitions. [2025-01-09 21:28:23,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 312 transitions, 954 flow [2025-01-09 21:28:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-01-09 21:28:23,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8304297328687572 [2025-01-09 21:28:23,620 INFO L175 Difference]: Start difference. First operand has 264 places, 281 transitions, 742 flow. Second operand 3 states and 715 transitions. [2025-01-09 21:28:23,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 312 transitions, 954 flow [2025-01-09 21:28:23,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 312 transitions, 948 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:23,629 INFO L231 Difference]: Finished difference. Result has 265 places, 286 transitions, 796 flow [2025-01-09 21:28:23,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=265, PETRI_TRANSITIONS=286} [2025-01-09 21:28:23,629 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, 7 predicate places. [2025-01-09 21:28:23,629 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 286 transitions, 796 flow [2025-01-09 21:28:23,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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-01-09 21:28:23,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:23,630 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 21:28:23,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:28:23,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:28:23,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1793671366, now seen corresponding path program 1 times [2025-01-09 21:28:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:23,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549374866] [2025-01-09 21:28:23,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:23,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:28:23,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:28:23,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:23,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:23,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:28:23,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:28:23,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:28:23,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:23,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:23,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:28:23,659 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-01-09 21:28:23,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-01-09 21:28:23,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-01-09 21:28:23,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:28:23,660 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:23,661 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:28:23,661 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:28:23,682 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:28:23,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 366 transitions, 759 flow [2025-01-09 21:28:23,845 INFO L124 PetriNetUnfolderBase]: 81/754 cut-off events. [2025-01-09 21:28:23,845 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:28:23,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 754 events. 81/754 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3662 event pairs, 1 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 516. Up to 12 conditions per place. [2025-01-09 21:28:23,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 366 transitions, 759 flow [2025-01-09 21:28:23,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 327 places, 366 transitions, 759 flow [2025-01-09 21:28:23,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:23,855 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;@5f18cfa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:23,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-01-09 21:28:23,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:23,856 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2025-01-09 21:28:23,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:23,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:23,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:23,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:28:23,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:23,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1490566946, now seen corresponding path program 1 times [2025-01-09 21:28:23,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:23,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703335474] [2025-01-09 21:28:23,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:23,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:23,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:28:23,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:28:23,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:23,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:23,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:23,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703335474] [2025-01-09 21:28:23,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703335474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:23,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:23,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:23,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978882389] [2025-01-09 21:28:23,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:23,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:28:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:23,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:28:23,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:28:23,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 366 [2025-01-09 21:28:23,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 366 transitions, 759 flow. Second operand has 2 states, 2 states have (on average 282.5) internal successors, (565), 2 states have internal predecessors, (565), 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-01-09 21:28:23,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:23,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 366 [2025-01-09 21:28:23,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:32,916 INFO L124 PetriNetUnfolderBase]: 26755/100755 cut-off events. [2025-01-09 21:28:32,917 INFO L125 PetriNetUnfolderBase]: For 1786/1786 co-relation queries the response was YES. [2025-01-09 21:28:33,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137527 conditions, 100755 events. 26755/100755 cut-off events. For 1786/1786 co-relation queries the response was YES. Maximal size of possible extension queue 2181. Compared 1527036 event pairs, 25579 based on Foata normal form. 27526/117038 useless extension candidates. Maximal degree in co-relation 123632. Up to 35952 conditions per place. [2025-01-09 21:28:33,590 INFO L140 encePairwiseOnDemand]: 326/366 looper letters, 41 selfloop transitions, 0 changer transitions 0/318 dead transitions. [2025-01-09 21:28:33,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 318 transitions, 745 flow [2025-01-09 21:28:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:28:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:28:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 643 transitions. [2025-01-09 21:28:33,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8784153005464481 [2025-01-09 21:28:33,592 INFO L175 Difference]: Start difference. First operand has 327 places, 366 transitions, 759 flow. Second operand 2 states and 643 transitions. [2025-01-09 21:28:33,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 318 transitions, 745 flow [2025-01-09 21:28:33,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 318 transitions, 745 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:33,601 INFO L231 Difference]: Finished difference. Result has 320 places, 318 transitions, 663 flow [2025-01-09 21:28:33,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=663, PETRI_PLACES=320, PETRI_TRANSITIONS=318} [2025-01-09 21:28:33,602 INFO L279 CegarLoopForPetriNet]: 327 programPoint places, -7 predicate places. [2025-01-09 21:28:33,602 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 318 transitions, 663 flow [2025-01-09 21:28:33,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 282.5) internal successors, (565), 2 states have internal predecessors, (565), 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-01-09 21:28:33,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:33,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:33,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:28:33,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:28:33,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1493240525, now seen corresponding path program 1 times [2025-01-09 21:28:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:33,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765603690] [2025-01-09 21:28:33,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:33,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:28:33,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:28:33,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:33,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765603690] [2025-01-09 21:28:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765603690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:33,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874655096] [2025-01-09 21:28:33,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:33,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:33,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:33,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:33,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 366 [2025-01-09 21:28:33,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 318 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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-01-09 21:28:33,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:33,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 366 [2025-01-09 21:28:33,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand