./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:49:51,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:49:51,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:49:51,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:49:51,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:49:51,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:49:51,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:49:51,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:49:51,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:49:51,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:49:51,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:49:51,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:49:51,070 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:49:51,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:49:51,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:49:51,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:49:51,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:49:51,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:49:51,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:49:51,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:49:51,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:49:51,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:49:51,071 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:49:51,071 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:49:51,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:49:51,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:51,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:49:51,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2025-03-04 06:49:51,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:49:51,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:49:51,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:49:51,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:49:51,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:49:51,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-03-04 06:49:52,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80004223/a69f8f55c42948f79447d330f3b3aba4/FLAG78a3c08a0 [2025-03-04 06:49:52,934 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:49:52,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-03-04 06:49:52,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80004223/a69f8f55c42948f79447d330f3b3aba4/FLAG78a3c08a0 [2025-03-04 06:49:53,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80004223/a69f8f55c42948f79447d330f3b3aba4 [2025-03-04 06:49:53,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:49:53,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:49:53,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:53,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:49:53,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:49:53,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3a095d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53, skipping insertion in model container [2025-03-04 06:49:53,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:49:53,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:53,482 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:49:53,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:53,560 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:49:53,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53 WrapperNode [2025-03-04 06:49:53,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:53,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:53,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:49:53,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:49:53,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,598 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 209 [2025-03-04 06:49:53,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:53,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:49:53,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:49:53,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:49:53,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:49:53,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:49:53,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:49:53,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:49:53,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (1/1) ... [2025-03-04 06:49:53,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:53,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:49:53,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:49:53,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:49:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:49:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:49:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:49:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:49:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:49:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:49:53,666 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:49:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:49:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:49:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:49:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:49:53,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:49:53,668 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:49:53,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:49:53,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:49:54,040 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:49:54,041 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:49:54,070 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:49:54,070 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:49:54,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:49:54,093 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:49:54,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:54 BoogieIcfgContainer [2025-03-04 06:49:54,094 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:49:54,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:49:54,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:49:54,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:49:54,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:49:53" (1/3) ... [2025-03-04 06:49:54,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21979981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:54, skipping insertion in model container [2025-03-04 06:49:54,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:53" (2/3) ... [2025-03-04 06:49:54,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21979981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:54, skipping insertion in model container [2025-03-04 06:49:54,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:54" (3/3) ... [2025-03-04 06:49:54,101 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2025-03-04 06:49:54,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:49:54,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_20-callback_racefree.i that has 2 procedures, 214 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-03-04 06:49:54,114 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:49:54,165 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:49:54,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 227 transitions, 461 flow [2025-03-04 06:49:54,305 INFO L124 PetriNetUnfolderBase]: 21/333 cut-off events. [2025-03-04 06:49:54,307 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:49:54,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 333 events. 21/333 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 977 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 188. Up to 6 conditions per place. [2025-03-04 06:49:54,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 227 transitions, 461 flow [2025-03-04 06:49:54,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 227 transitions, 461 flow [2025-03-04 06:49:54,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:54,341 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;@24f30420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:54,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 06:49:54,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:54,366 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-03-04 06:49:54,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:54,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:54,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:54,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:49:54,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash -362527012, now seen corresponding path program 1 times [2025-03-04 06:49:54,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:54,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31631869] [2025-03-04 06:49:54,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:54,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 06:49:54,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 06:49:54,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:54,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31631869] [2025-03-04 06:49:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31631869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:55,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:55,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066207746] [2025-03-04 06:49:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:55,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:55,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:55,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:55,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:55,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 227 [2025-03-04 06:49:55,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 227 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 187.5) internal successors, (1125), 6 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:55,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:55,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 227 [2025-03-04 06:49:55,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:55,621 INFO L124 PetriNetUnfolderBase]: 93/835 cut-off events. [2025-03-04 06:49:55,621 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:49:55,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 835 events. 93/835 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4493 event pairs, 8 based on Foata normal form. 77/850 useless extension candidates. Maximal degree in co-relation 832. Up to 154 conditions per place. [2025-03-04 06:49:55,630 INFO L140 encePairwiseOnDemand]: 211/227 looper letters, 40 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2025-03-04 06:49:55,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 230 transitions, 557 flow [2025-03-04 06:49:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1188 transitions. [2025-03-04 06:49:55,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8722466960352423 [2025-03-04 06:49:55,651 INFO L175 Difference]: Start difference. First operand has 217 places, 227 transitions, 461 flow. Second operand 6 states and 1188 transitions. [2025-03-04 06:49:55,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 230 transitions, 557 flow [2025-03-04 06:49:55,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 230 transitions, 557 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:55,662 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 445 flow [2025-03-04 06:49:55,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2025-03-04 06:49:55,669 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 2 predicate places. [2025-03-04 06:49:55,670 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 445 flow [2025-03-04 06:49:55,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.5) internal successors, (1125), 6 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:55,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:55,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:55,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:49:55,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:49:55,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:55,673 INFO L85 PathProgramCache]: Analyzing trace with hash 887055362, now seen corresponding path program 1 times [2025-03-04 06:49:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101788550] [2025-03-04 06:49:55,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:55,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:49:55,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:49:55,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:55,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101788550] [2025-03-04 06:49:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101788550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:55,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958284784] [2025-03-04 06:49:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:55,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:55,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:55,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:55,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:55,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 227 [2025-03-04 06:49:55,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:55,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:55,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 227 [2025-03-04 06:49:55,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:55,928 INFO L124 PetriNetUnfolderBase]: 113/970 cut-off events. [2025-03-04 06:49:55,929 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2025-03-04 06:49:55,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 970 events. 113/970 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4815 event pairs, 34 based on Foata normal form. 1/895 useless extension candidates. Maximal degree in co-relation 1024. Up to 137 conditions per place. [2025-03-04 06:49:55,935 INFO L140 encePairwiseOnDemand]: 218/227 looper letters, 30 selfloop transitions, 6 changer transitions 0/227 dead transitions. [2025-03-04 06:49:55,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 227 transitions, 546 flow [2025-03-04 06:49:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-03-04 06:49:55,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074889867841409 [2025-03-04 06:49:55,937 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 445 flow. Second operand 3 states and 618 transitions. [2025-03-04 06:49:55,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 227 transitions, 546 flow [2025-03-04 06:49:55,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 227 transitions, 536 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:49:55,942 INFO L231 Difference]: Finished difference. Result has 216 places, 216 transitions, 473 flow [2025-03-04 06:49:55,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=216, PETRI_TRANSITIONS=216} [2025-03-04 06:49:55,943 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, -1 predicate places. [2025-03-04 06:49:55,943 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 216 transitions, 473 flow [2025-03-04 06:49:55,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:55,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:55,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:55,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:49:55,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:49:55,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash 836931995, now seen corresponding path program 1 times [2025-03-04 06:49:55,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:55,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081161708] [2025-03-04 06:49:55,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:55,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:55,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:49:55,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:49:55,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:55,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:56,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:56,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081161708] [2025-03-04 06:49:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081161708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:56,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:56,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:49:56,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063668488] [2025-03-04 06:49:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:56,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:56,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:56,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:56,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 227 [2025-03-04 06:49:56,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 216 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:56,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:56,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 227 [2025-03-04 06:49:56,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:56,183 INFO L124 PetriNetUnfolderBase]: 82/951 cut-off events. [2025-03-04 06:49:56,183 INFO L125 PetriNetUnfolderBase]: For 34/36 co-relation queries the response was YES. [2025-03-04 06:49:56,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 951 events. 82/951 cut-off events. For 34/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4754 event pairs, 38 based on Foata normal form. 1/886 useless extension candidates. Maximal degree in co-relation 1034. Up to 146 conditions per place. [2025-03-04 06:49:56,189 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 20 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-04 06:49:56,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 220 transitions, 525 flow [2025-03-04 06:49:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2025-03-04 06:49:56,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060205580029369 [2025-03-04 06:49:56,193 INFO L175 Difference]: Start difference. First operand has 216 places, 216 transitions, 473 flow. Second operand 3 states and 617 transitions. [2025-03-04 06:49:56,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 220 transitions, 525 flow [2025-03-04 06:49:56,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 220 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:56,199 INFO L231 Difference]: Finished difference. Result has 217 places, 216 transitions, 469 flow [2025-03-04 06:49:56,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=217, PETRI_TRANSITIONS=216} [2025-03-04 06:49:56,200 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 0 predicate places. [2025-03-04 06:49:56,200 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 216 transitions, 469 flow [2025-03-04 06:49:56,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:56,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:56,200 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:56,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:49:56,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:49:56,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1184748475, now seen corresponding path program 1 times [2025-03-04 06:49:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106096221] [2025-03-04 06:49:56,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:56,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:49:56,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:49:56,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:56,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:56,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:49:56,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:49:56,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:49:56,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:56,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:56,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:49:56,284 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:49:56,285 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-04 06:49:56,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-04 06:49:56,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-04 06:49:56,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-04 06:49:56,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-04 06:49:56,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-04 06:49:56,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-04 06:49:56,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-04 06:49:56,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-04 06:49:56,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:49:56,288 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 06:49:56,291 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:49:56,291 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:49:56,318 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:49:56,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 259 transitions, 534 flow [2025-03-04 06:49:56,381 INFO L124 PetriNetUnfolderBase]: 35/498 cut-off events. [2025-03-04 06:49:56,381 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:49:56,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 498 events. 35/498 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1810 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 335. Up to 9 conditions per place. [2025-03-04 06:49:56,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 259 transitions, 534 flow [2025-03-04 06:49:56,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 259 transitions, 534 flow [2025-03-04 06:49:56,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:56,392 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;@24f30420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:56,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 06:49:56,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:56,402 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-03-04 06:49:56,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:56,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:56,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:56,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:49:56,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2122944540, now seen corresponding path program 1 times [2025-03-04 06:49:56,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:56,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895359618] [2025-03-04 06:49:56,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:56,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 06:49:56,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 06:49:56,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:56,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:56,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:56,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895359618] [2025-03-04 06:49:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895359618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:56,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:56,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:56,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783828251] [2025-03-04 06:49:56,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:56,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:56,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:56,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:56,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 259 [2025-03-04 06:49:56,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 259 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:56,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:56,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 259 [2025-03-04 06:49:56,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:57,391 INFO L124 PetriNetUnfolderBase]: 1001/4637 cut-off events. [2025-03-04 06:49:57,391 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-04 06:49:57,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6296 conditions, 4637 events. 1001/4637 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 42752 event pairs, 262 based on Foata normal form. 765/5072 useless extension candidates. Maximal degree in co-relation 1828. Up to 1202 conditions per place. [2025-03-04 06:49:57,413 INFO L140 encePairwiseOnDemand]: 239/259 looper letters, 62 selfloop transitions, 5 changer transitions 0/272 dead transitions. [2025-03-04 06:49:57,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 272 transitions, 694 flow [2025-03-04 06:49:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-03-04 06:49:57,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8725868725868726 [2025-03-04 06:49:57,416 INFO L175 Difference]: Start difference. First operand has 246 places, 259 transitions, 534 flow. Second operand 6 states and 1356 transitions. [2025-03-04 06:49:57,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 272 transitions, 694 flow [2025-03-04 06:49:57,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 272 transitions, 694 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:57,419 INFO L231 Difference]: Finished difference. Result has 246 places, 240 transitions, 506 flow [2025-03-04 06:49:57,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=246, PETRI_TRANSITIONS=240} [2025-03-04 06:49:57,420 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 0 predicate places. [2025-03-04 06:49:57,420 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 240 transitions, 506 flow [2025-03-04 06:49:57,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:57,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:57,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:57,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:49:57,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:49:57,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:57,422 INFO L85 PathProgramCache]: Analyzing trace with hash -73686812, now seen corresponding path program 1 times [2025-03-04 06:49:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:57,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838485091] [2025-03-04 06:49:57,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:57,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:49:57,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:49:57,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:57,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838485091] [2025-03-04 06:49:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838485091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:57,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:57,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:57,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485307148] [2025-03-04 06:49:57,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:57,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:57,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:57,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:57,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 259 [2025-03-04 06:49:57,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 240 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:57,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:57,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 259 [2025-03-04 06:49:57,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:58,367 INFO L124 PetriNetUnfolderBase]: 2103/8713 cut-off events. [2025-03-04 06:49:58,367 INFO L125 PetriNetUnfolderBase]: For 158/285 co-relation queries the response was YES. [2025-03-04 06:49:58,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12237 conditions, 8713 events. 2103/8713 cut-off events. For 158/285 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 86168 event pairs, 747 based on Foata normal form. 8/7925 useless extension candidates. Maximal degree in co-relation 10950. Up to 2127 conditions per place. [2025-03-04 06:49:58,444 INFO L140 encePairwiseOnDemand]: 247/259 looper letters, 45 selfloop transitions, 8 changer transitions 0/261 dead transitions. [2025-03-04 06:49:58,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 261 transitions, 665 flow [2025-03-04 06:49:58,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2025-03-04 06:49:58,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888030888030888 [2025-03-04 06:49:58,447 INFO L175 Difference]: Start difference. First operand has 246 places, 240 transitions, 506 flow. Second operand 3 states and 690 transitions. [2025-03-04 06:49:58,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 261 transitions, 665 flow [2025-03-04 06:49:58,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 261 transitions, 655 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:49:58,454 INFO L231 Difference]: Finished difference. Result has 243 places, 244 transitions, 552 flow [2025-03-04 06:49:58,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=243, PETRI_TRANSITIONS=244} [2025-03-04 06:49:58,457 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -3 predicate places. [2025-03-04 06:49:58,457 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 244 transitions, 552 flow [2025-03-04 06:49:58,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:58,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:58,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:58,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:49:58,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:49:58,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash -868512677, now seen corresponding path program 1 times [2025-03-04 06:49:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:58,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478431604] [2025-03-04 06:49:58,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:58,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:49:58,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:49:58,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:58,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:58,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:58,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478431604] [2025-03-04 06:49:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478431604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:49:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3294568] [2025-03-04 06:49:58,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:58,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:58,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:58,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:58,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 259 [2025-03-04 06:49:58,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 244 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:58,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:58,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 259 [2025-03-04 06:49:58,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:59,230 INFO L124 PetriNetUnfolderBase]: 1362/7558 cut-off events. [2025-03-04 06:49:59,231 INFO L125 PetriNetUnfolderBase]: For 374/455 co-relation queries the response was YES. [2025-03-04 06:49:59,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10372 conditions, 7558 events. 1362/7558 cut-off events. For 374/455 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 76424 event pairs, 874 based on Foata normal form. 1/6915 useless extension candidates. Maximal degree in co-relation 6766. Up to 1911 conditions per place. [2025-03-04 06:49:59,270 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 27 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-03-04 06:49:59,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 249 transitions, 620 flow [2025-03-04 06:49:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions. [2025-03-04 06:49:59,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8841698841698842 [2025-03-04 06:49:59,272 INFO L175 Difference]: Start difference. First operand has 243 places, 244 transitions, 552 flow. Second operand 3 states and 687 transitions. [2025-03-04 06:49:59,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 249 transitions, 620 flow [2025-03-04 06:49:59,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 249 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:59,280 INFO L231 Difference]: Finished difference. Result has 244 places, 245 transitions, 548 flow [2025-03-04 06:49:59,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=244, PETRI_TRANSITIONS=245} [2025-03-04 06:49:59,282 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -2 predicate places. [2025-03-04 06:49:59,282 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 245 transitions, 548 flow [2025-03-04 06:49:59,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:59,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:59,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:59,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:49:59,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:49:59,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1748162252, now seen corresponding path program 1 times [2025-03-04 06:49:59,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:59,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-03-04 06:49:59,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:59,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:49:59,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:49:59,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:59,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:59,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702436604] [2025-03-04 06:49:59,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702436604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:59,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:59,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522805052] [2025-03-04 06:49:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:59,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:49:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:59,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:49:59,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:49:59,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 259 [2025-03-04 06:49:59,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 245 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:59,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:59,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 259 [2025-03-04 06:49:59,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:00,377 INFO L124 PetriNetUnfolderBase]: 1405/8987 cut-off events. [2025-03-04 06:50:00,378 INFO L125 PetriNetUnfolderBase]: For 151/155 co-relation queries the response was YES. [2025-03-04 06:50:00,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11575 conditions, 8987 events. 1405/8987 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 94717 event pairs, 240 based on Foata normal form. 5/8228 useless extension candidates. Maximal degree in co-relation 8524. Up to 1720 conditions per place. [2025-03-04 06:50:00,424 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 44 selfloop transitions, 5 changer transitions 0/267 dead transitions. [2025-03-04 06:50:00,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 267 transitions, 690 flow [2025-03-04 06:50:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1352 transitions. [2025-03-04 06:50:00,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.87001287001287 [2025-03-04 06:50:00,428 INFO L175 Difference]: Start difference. First operand has 244 places, 245 transitions, 548 flow. Second operand 6 states and 1352 transitions. [2025-03-04 06:50:00,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 267 transitions, 690 flow [2025-03-04 06:50:00,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 267 transitions, 688 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:00,433 INFO L231 Difference]: Finished difference. Result has 251 places, 247 transitions, 572 flow [2025-03-04 06:50:00,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=251, PETRI_TRANSITIONS=247} [2025-03-04 06:50:00,434 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 5 predicate places. [2025-03-04 06:50:00,434 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 247 transitions, 572 flow [2025-03-04 06:50:00,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:00,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:00,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:00,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:50:00,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:50:00,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1955182636, now seen corresponding path program 1 times [2025-03-04 06:50:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:00,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791077480] [2025-03-04 06:50:00,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:00,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 06:50:00,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 06:50:00,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:00,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:00,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:00,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 06:50:00,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 06:50:00,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:00,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:00,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:00,503 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:00,504 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 06:50:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-04 06:50:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-04 06:50:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-04 06:50:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-04 06:50:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-04 06:50:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-04 06:50:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-04 06:50:00,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-04 06:50:00,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-04 06:50:00,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:50:00,505 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 06:50:00,506 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:00,506 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:50:00,535 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:50:00,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 291 transitions, 609 flow [2025-03-04 06:50:00,607 INFO L124 PetriNetUnfolderBase]: 52/706 cut-off events. [2025-03-04 06:50:00,607 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 06:50:00,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 706 events. 52/706 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2901 event pairs, 1 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 506. Up to 12 conditions per place. [2025-03-04 06:50:00,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 291 transitions, 609 flow [2025-03-04 06:50:00,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 291 transitions, 609 flow [2025-03-04 06:50:00,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:00,618 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;@24f30420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:00,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 06:50:00,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:00,628 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-03-04 06:50:00,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:00,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:00,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:00,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:50:00,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1303080612, now seen corresponding path program 1 times [2025-03-04 06:50:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:00,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348539256] [2025-03-04 06:50:00,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:00,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 06:50:00,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 06:50:00,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:00,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:00,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:00,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348539256] [2025-03-04 06:50:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348539256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:00,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017502421] [2025-03-04 06:50:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:00,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:00,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:00,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:01,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 291 [2025-03-04 06:50:01,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 291 transitions, 609 flow. Second operand has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:01,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:01,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 291 [2025-03-04 06:50:01,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:03,345 INFO L124 PetriNetUnfolderBase]: 8093/25968 cut-off events. [2025-03-04 06:50:03,346 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-03-04 06:50:03,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37703 conditions, 25968 events. 8093/25968 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 306800 event pairs, 2597 based on Foata normal form. 6180/30502 useless extension candidates. Maximal degree in co-relation 6203. Up to 8631 conditions per place. [2025-03-04 06:50:03,497 INFO L140 encePairwiseOnDemand]: 267/291 looper letters, 84 selfloop transitions, 5 changer transitions 0/314 dead transitions. [2025-03-04 06:50:03,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 314 transitions, 833 flow [2025-03-04 06:50:03,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1524 transitions. [2025-03-04 06:50:03,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872852233676976 [2025-03-04 06:50:03,501 INFO L175 Difference]: Start difference. First operand has 275 places, 291 transitions, 609 flow. Second operand 6 states and 1524 transitions. [2025-03-04 06:50:03,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 314 transitions, 833 flow [2025-03-04 06:50:03,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 314 transitions, 833 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:03,506 INFO L231 Difference]: Finished difference. Result has 273 places, 266 transitions, 569 flow [2025-03-04 06:50:03,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=273, PETRI_TRANSITIONS=266} [2025-03-04 06:50:03,510 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -2 predicate places. [2025-03-04 06:50:03,510 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 266 transitions, 569 flow [2025-03-04 06:50:03,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:03,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:03,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:03,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:50:03,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:50:03,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1109262462, now seen corresponding path program 1 times [2025-03-04 06:50:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969988712] [2025-03-04 06:50:03,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:03,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:50:03,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:50:03,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:03,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:03,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969988712] [2025-03-04 06:50:03,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969988712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:03,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:03,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:03,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666727145] [2025-03-04 06:50:03,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:03,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:03,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:03,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:03,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:03,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 291 [2025-03-04 06:50:03,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 266 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:03,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:03,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 291 [2025-03-04 06:50:03,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:11,585 INFO L124 PetriNetUnfolderBase]: 27273/82453 cut-off events. [2025-03-04 06:50:11,585 INFO L125 PetriNetUnfolderBase]: For 2640/5160 co-relation queries the response was YES. [2025-03-04 06:50:11,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122116 conditions, 82453 events. 27273/82453 cut-off events. For 2640/5160 co-relation queries the response was YES. Maximal size of possible extension queue 1779. Compared 1094166 event pairs, 10995 based on Foata normal form. 29/74746 useless extension candidates. Maximal degree in co-relation 103493. Up to 25188 conditions per place. [2025-03-04 06:50:12,075 INFO L140 encePairwiseOnDemand]: 276/291 looper letters, 60 selfloop transitions, 10 changer transitions 0/295 dead transitions. [2025-03-04 06:50:12,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 295 transitions, 788 flow [2025-03-04 06:50:12,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2025-03-04 06:50:12,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872852233676976 [2025-03-04 06:50:12,077 INFO L175 Difference]: Start difference. First operand has 273 places, 266 transitions, 569 flow. Second operand 3 states and 762 transitions. [2025-03-04 06:50:12,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 295 transitions, 788 flow [2025-03-04 06:50:12,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 295 transitions, 778 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:50:12,081 INFO L231 Difference]: Finished difference. Result has 270 places, 272 transitions, 633 flow [2025-03-04 06:50:12,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=270, PETRI_TRANSITIONS=272} [2025-03-04 06:50:12,082 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -5 predicate places. [2025-03-04 06:50:12,082 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 272 transitions, 633 flow [2025-03-04 06:50:12,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:12,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:12,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:12,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:50:12,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:50:12,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1839444197, now seen corresponding path program 1 times [2025-03-04 06:50:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:12,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-03-04 06:50:12,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:12,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:12,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:50:12,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:50:12,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:12,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532172894] [2025-03-04 06:50:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532172894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:12,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:12,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:12,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645525518] [2025-03-04 06:50:12,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:12,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:12,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:12,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:12,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:12,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 291 [2025-03-04 06:50:12,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 272 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:12,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:12,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 291 [2025-03-04 06:50:12,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:18,956 INFO L124 PetriNetUnfolderBase]: 16710/68546 cut-off events. [2025-03-04 06:50:18,956 INFO L125 PetriNetUnfolderBase]: For 4234/5494 co-relation queries the response was YES. [2025-03-04 06:50:19,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97984 conditions, 68546 events. 16710/68546 cut-off events. For 4234/5494 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 983393 event pairs, 11681 based on Foata normal form. 1/62252 useless extension candidates. Maximal degree in co-relation 64733. Up to 20086 conditions per place. [2025-03-04 06:50:19,431 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 33 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-03-04 06:50:19,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 277 transitions, 713 flow [2025-03-04 06:50:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 756 transitions. [2025-03-04 06:50:19,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865979381443299 [2025-03-04 06:50:19,433 INFO L175 Difference]: Start difference. First operand has 270 places, 272 transitions, 633 flow. Second operand 3 states and 756 transitions. [2025-03-04 06:50:19,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 277 transitions, 713 flow [2025-03-04 06:50:19,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 277 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:19,454 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 625 flow [2025-03-04 06:50:19,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2025-03-04 06:50:19,454 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -4 predicate places. [2025-03-04 06:50:19,454 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 625 flow [2025-03-04 06:50:19,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:19,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:19,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:19,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:50:19,455 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:50:19,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1290326322, now seen corresponding path program 1 times [2025-03-04 06:50:19,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:19,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-03-04 06:50:19,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:19,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:50:19,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:50:19,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:19,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-03-04 06:50:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308736431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84283365] [2025-03-04 06:50:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:19,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:50:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:19,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:50:19,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:50:19,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 291 [2025-03-04 06:50:19,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 625 flow. Second operand has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:19,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:19,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 291 [2025-03-04 06:50:19,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:27,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][175], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 168#L715-2true, 263#L715-2true, 272#true, 293#true, 10#L708true]) [2025-03-04 06:50:27,384 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-04 06:50:27,384 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:50:27,384 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-04 06:50:27,384 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:50:27,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 168#L715-2true, 272#true, 293#true, 10#L708true, 119#L715-9true]) [2025-03-04 06:50:27,386 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-04 06:50:27,386 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-04 06:50:27,386 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-04 06:50:27,386 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-04 06:50:27,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 168#L715-2true, 191#L715-8true, 272#true, 293#true, 10#L708true]) [2025-03-04 06:50:27,387 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-04 06:50:27,387 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:50:27,387 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-04 06:50:27,387 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:50:27,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][175], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 168#L715-2true, 263#L715-2true, 272#true, 293#true]) [2025-03-04 06:50:27,450 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-04 06:50:27,450 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-04 06:50:27,450 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-04 06:50:27,450 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-04 06:50:27,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 168#L715-2true, 272#true, 293#true, 119#L715-9true]) [2025-03-04 06:50:27,450 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-04 06:50:27,450 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-04 06:50:27,450 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-04 06:50:27,450 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-04 06:50:27,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 168#L715-2true, 191#L715-8true, 272#true, 293#true]) [2025-03-04 06:50:27,452 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-04 06:50:27,453 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-04 06:50:27,453 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-04 06:50:27,453 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][175], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 11#L709-36true, 168#L715-2true, 263#L715-2true, 272#true, 293#true]) [2025-03-04 06:50:27,514 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 11#L709-36true, 168#L715-2true, 272#true, 293#true, 119#L715-9true]) [2025-03-04 06:50:27,514 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 11#L709-36true, 168#L715-2true, 191#L715-8true, 272#true, 293#true]) [2025-03-04 06:50:27,514 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-04 06:50:27,514 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][175], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 263#L715-2true, 272#true, 293#true, 10#L708true]) [2025-03-04 06:50:27,572 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 272#true, 293#true, 119#L715-9true, 10#L708true]) [2025-03-04 06:50:27,572 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 191#L715-8true, 272#true, 293#true, 10#L708true]) [2025-03-04 06:50:27,572 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-04 06:50:27,572 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][240], [Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 168#L715-2true, 191#L715-8true, 272#true, 293#true]) [2025-03-04 06:50:27,576 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][240], [Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 276#true, 274#true, 168#L715-2true, 191#L715-8true, 272#true, 293#true, 158#L715-9true]) [2025-03-04 06:50:27,576 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][240], [Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 168#L715-2true, 272#true, 293#true, 119#L715-9true]) [2025-03-04 06:50:27,576 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][240], [Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 276#true, 274#true, 168#L715-2true, 272#true, 293#true, 119#L715-9true, 158#L715-9true]) [2025-03-04 06:50:27,576 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-04 06:50:27,576 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][175], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 263#L715-2true, 272#true, 293#true]) [2025-03-04 06:50:27,627 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 272#true, 293#true, 119#L715-9true]) [2025-03-04 06:50:27,627 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 191#L715-8true, 272#true, 293#true]) [2025-03-04 06:50:27,627 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-04 06:50:27,627 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][175], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 11#L709-36true, 263#L715-2true, 272#true, 293#true]) [2025-03-04 06:50:27,671 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 11#L709-36true, 272#true, 293#true, 119#L715-9true]) [2025-03-04 06:50:27,671 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 11#L709-36true, 191#L715-8true, 272#true, 293#true]) [2025-03-04 06:50:27,671 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-04 06:50:27,671 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-04 06:50:27,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][240], [146#L716true, Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 191#L715-8true, 272#true, 293#true]) [2025-03-04 06:50:27,870 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-03-04 06:50:27,870 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-04 06:50:27,870 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-04 06:50:27,870 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][240], [146#L716true, Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 276#true, 274#true, 191#L715-8true, 272#true, 293#true, 158#L715-9true]) [2025-03-04 06:50:27,871 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][240], [146#L716true, Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 272#true, 293#true, 119#L715-9true]) [2025-03-04 06:50:27,871 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][240], [146#L716true, Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 276#true, 274#true, 272#true, 293#true, 119#L715-9true, 158#L715-9true]) [2025-03-04 06:50:27,871 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-04 06:50:27,871 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-04 06:50:27,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][175], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 12#L722-3true, 276#true, 274#true, 263#L715-2true, 293#true]) [2025-03-04 06:50:27,936 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-04 06:50:27,936 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-04 06:50:27,936 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-04 06:50:27,936 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-04 06:50:27,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 12#L722-3true, 276#true, 274#true, 293#true, 119#L715-9true]) [2025-03-04 06:50:27,936 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-04 06:50:27,939 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-04 06:50:27,939 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-04 06:50:27,939 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-04 06:50:27,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 12#L722-3true, 276#true, 274#true, 191#L715-8true, 293#true]) [2025-03-04 06:50:27,939 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-04 06:50:27,939 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-04 06:50:27,939 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-04 06:50:27,939 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][175], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 263#L715-2true, 293#true]) [2025-03-04 06:50:28,228 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 293#true, 119#L715-9true]) [2025-03-04 06:50:28,228 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][239], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 191#L715-8true, 293#true]) [2025-03-04 06:50:28,228 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-04 06:50:28,228 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-04 06:50:28,339 INFO L124 PetriNetUnfolderBase]: 17529/82841 cut-off events. [2025-03-04 06:50:28,339 INFO L125 PetriNetUnfolderBase]: For 2151/2225 co-relation queries the response was YES. [2025-03-04 06:50:28,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110660 conditions, 82841 events. 17529/82841 cut-off events. For 2151/2225 co-relation queries the response was YES. Maximal size of possible extension queue 1343. Compared 1248128 event pairs, 6187 based on Foata normal form. 5/74928 useless extension candidates. Maximal degree in co-relation 82599. Up to 20381 conditions per place. [2025-03-04 06:50:28,865 INFO L140 encePairwiseOnDemand]: 286/291 looper letters, 52 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2025-03-04 06:50:28,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 297 transitions, 789 flow [2025-03-04 06:50:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1486 transitions. [2025-03-04 06:50:28,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8510882016036655 [2025-03-04 06:50:28,868 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 625 flow. Second operand 6 states and 1486 transitions. [2025-03-04 06:50:28,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 297 transitions, 789 flow [2025-03-04 06:50:28,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 297 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:28,874 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 655 flow [2025-03-04 06:50:28,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=655, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2025-03-04 06:50:28,875 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 3 predicate places. [2025-03-04 06:50:28,875 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 655 flow [2025-03-04 06:50:28,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:28,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:28,877 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:28,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:50:28,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:50:28,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:28,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2100243488, now seen corresponding path program 1 times [2025-03-04 06:50:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:28,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195315044] [2025-03-04 06:50:28,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:28,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:28,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:50:28,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:50:28,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:28,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195315044] [2025-03-04 06:50:28,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195315044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:28,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:28,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400112509] [2025-03-04 06:50:28,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:28,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:28,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:28,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:28,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:28,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 291 [2025-03-04 06:50:28,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:28,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:28,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 291 [2025-03-04 06:50:28,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand