/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:42:05,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:42:05,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:42:05,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:42:05,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:42:05,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:42:05,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:42:05,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:42:05,176 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:42:05,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:42:05,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:42:05,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:42:05,178 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:42:05,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:42:05,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:42:05,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:42:05,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:42:05,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:42:05,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:42:05,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:42:05,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:42:05,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:42:05,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:42:05,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:42:05,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:42:05,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:42:05,436 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:42:05,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-03-15 00:42:06,649 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3147e331/01e0d598f9634f6184bc52d02f10f0de/FLAG1b0d39668 [2025-03-15 00:42:06,836 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:42:06,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-03-15 00:42:06,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3147e331/01e0d598f9634f6184bc52d02f10f0de/FLAG1b0d39668 [2025-03-15 00:42:06,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3147e331/01e0d598f9634f6184bc52d02f10f0de [2025-03-15 00:42:06,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:42:06,875 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:42:06,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:42:06,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:42:06,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:42:06,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:42:06" (1/1) ... [2025-03-15 00:42:06,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d828278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:06, skipping insertion in model container [2025-03-15 00:42:06,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:42:06" (1/1) ... [2025-03-15 00:42:06,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:42:07,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:42:07,151 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:42:07,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:42:07,219 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:42:07,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07 WrapperNode [2025-03-15 00:42:07,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:42:07,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:42:07,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:42:07,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:42:07,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,258 INFO L138 Inliner]: procedures = 163, calls = 55, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 125 [2025-03-15 00:42:07,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:42:07,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:42:07,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:42:07,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:42:07,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:42:07,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:42:07,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:42:07,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:42:07,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (1/1) ... [2025-03-15 00:42:07,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:42:07,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:42:07,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:42:07,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:42:07,361 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-15 00:42:07,362 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-15 00:42:07,362 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:42:07,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:42:07,362 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:42:07,362 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:42:07,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:42:07,363 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:42:07,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:42:07,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:42:07,364 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:42:07,446 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:42:07,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:42:07,714 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:42:07,715 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:42:07,758 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:42:07,758 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:42:07,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:42:07 BoogieIcfgContainer [2025-03-15 00:42:07,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:42:07,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:42:07,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:42:07,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:42:07,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:42:06" (1/3) ... [2025-03-15 00:42:07,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcf0561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:42:07, skipping insertion in model container [2025-03-15 00:42:07,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:42:07" (2/3) ... [2025-03-15 00:42:07,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcf0561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:42:07, skipping insertion in model container [2025-03-15 00:42:07,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:42:07" (3/3) ... [2025-03-15 00:42:07,768 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2025-03-15 00:42:07,778 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:42:07,780 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_27-multiple-protecting2_true.i that has 3 procedures, 208 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-15 00:42:07,780 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:42:07,856 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:42:07,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:42:07,897 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=All, 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;@7f8b888b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:42:07,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-15 00:42:07,930 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:42:07,931 INFO L124 PetriNetUnfolderBase]: 0/51 cut-off events. [2025-03-15 00:42:07,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:42:07,932 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:07,934 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:42:07,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash -477178526, now seen corresponding path program 1 times [2025-03-15 00:42:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:07,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072253857] [2025-03-15 00:42:07,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:07,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:08,148 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-15 00:42:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:08,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072253857] [2025-03-15 00:42:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072253857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:08,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:08,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831409121] [2025-03-15 00:42:08,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:08,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:08,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:08,178 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 215 [2025-03-15 00:42:08,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 215 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-15 00:42:08,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:08,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 215 [2025-03-15 00:42:08,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:10,321 INFO L124 PetriNetUnfolderBase]: 6279/19321 cut-off events. [2025-03-15 00:42:10,321 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-15 00:42:10,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29322 conditions, 19321 events. 6279/19321 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 214820 event pairs, 2291 based on Foata normal form. 1336/18599 useless extension candidates. Maximal degree in co-relation 29198. Up to 5878 conditions per place. [2025-03-15 00:42:10,438 INFO L140 encePairwiseOnDemand]: 192/215 looper letters, 74 selfloop transitions, 10 changer transitions 6/234 dead transitions. [2025-03-15 00:42:10,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 234 transitions, 661 flow [2025-03-15 00:42:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2025-03-15 00:42:10,448 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8821705426356589 [2025-03-15 00:42:10,450 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -10 predicate places. [2025-03-15 00:42:10,450 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 234 transitions, 661 flow [2025-03-15 00:42:10,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-15 00:42:10,451 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:10,451 INFO L221 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] [2025-03-15 00:42:10,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:42:10,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:10,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1757956060, now seen corresponding path program 1 times [2025-03-15 00:42:10,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:10,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98518855] [2025-03-15 00:42:10,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:10,540 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-15 00:42:10,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:10,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98518855] [2025-03-15 00:42:10,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98518855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:10,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:10,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136037740] [2025-03-15 00:42:10,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:10,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:10,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:10,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:10,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:10,544 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 215 [2025-03-15 00:42:10,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 234 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-15 00:42:10,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:10,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 215 [2025-03-15 00:42:10,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:12,490 INFO L124 PetriNetUnfolderBase]: 7084/21397 cut-off events. [2025-03-15 00:42:12,490 INFO L125 PetriNetUnfolderBase]: For 3300/7087 co-relation queries the response was YES. [2025-03-15 00:42:12,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43341 conditions, 21397 events. 7084/21397 cut-off events. For 3300/7087 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 240625 event pairs, 2408 based on Foata normal form. 166/19581 useless extension candidates. Maximal degree in co-relation 43187. Up to 9855 conditions per place. [2025-03-15 00:42:12,593 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 128 selfloop transitions, 8 changer transitions 6/284 dead transitions. [2025-03-15 00:42:12,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 284 transitions, 1138 flow [2025-03-15 00:42:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2025-03-15 00:42:12,595 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8310077519379845 [2025-03-15 00:42:12,595 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -8 predicate places. [2025-03-15 00:42:12,595 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 284 transitions, 1138 flow [2025-03-15 00:42:12,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-15 00:42:12,596 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:12,596 INFO L221 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] [2025-03-15 00:42:12,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:42:12,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:12,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1039786127, now seen corresponding path program 1 times [2025-03-15 00:42:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:12,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513793664] [2025-03-15 00:42:12,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:12,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:12,654 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-15 00:42:12,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:12,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513793664] [2025-03-15 00:42:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513793664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:12,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713216097] [2025-03-15 00:42:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:12,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:12,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:12,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:12,655 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 215 [2025-03-15 00:42:12,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 284 transitions, 1138 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-15 00:42:12,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:12,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 215 [2025-03-15 00:42:12,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:16,976 INFO L124 PetriNetUnfolderBase]: 22344/60614 cut-off events. [2025-03-15 00:42:16,976 INFO L125 PetriNetUnfolderBase]: For 52836/66303 co-relation queries the response was YES. [2025-03-15 00:42:17,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145515 conditions, 60614 events. 22344/60614 cut-off events. For 52836/66303 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 741691 event pairs, 5530 based on Foata normal form. 591/53438 useless extension candidates. Maximal degree in co-relation 145247. Up to 25933 conditions per place. [2025-03-15 00:42:17,335 INFO L140 encePairwiseOnDemand]: 206/215 looper letters, 187 selfloop transitions, 6 changer transitions 8/376 dead transitions. [2025-03-15 00:42:17,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 376 transitions, 2072 flow [2025-03-15 00:42:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-03-15 00:42:17,336 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8651162790697674 [2025-03-15 00:42:17,337 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -8 predicate places. [2025-03-15 00:42:17,337 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 376 transitions, 2072 flow [2025-03-15 00:42:17,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-15 00:42:17,338 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:17,338 INFO L221 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] [2025-03-15 00:42:17,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:42:17,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:17,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1523394632, now seen corresponding path program 1 times [2025-03-15 00:42:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:17,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398368550] [2025-03-15 00:42:17,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:17,377 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-15 00:42:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:17,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398368550] [2025-03-15 00:42:17,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398368550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:17,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:17,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404372383] [2025-03-15 00:42:17,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:17,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:17,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:17,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:17,379 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 215 [2025-03-15 00:42:17,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 376 transitions, 2072 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-15 00:42:17,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:17,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 215 [2025-03-15 00:42:17,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:18,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L716-->L716-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21|))) (and (= (select .cse0 |v_~#mutex2~0.offset_21|) 0) (= 0 |v_ULTIMATE.start_main_#t~ret28#1_7|) (= (store |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21| (store .cse0 |v_~#mutex2~0.offset_21| 1)) |v_#pthreadsMutex_117|))) InVars {~#mutex2~0.base=|v_~#mutex2~0.base_21|, #pthreadsMutex=|v_#pthreadsMutex_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|} OutVars{ULTIMATE.start_main_#t~ret28#1=|v_ULTIMATE.start_main_#t~ret28#1_7|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|, ~#mutex2~0.base=|v_~#mutex2~0.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret28#1, #pthreadsMutex][288], [27#L691-6true, 220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 43#L699-6true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 223#true, 217#true, 121#L716-3true]) [2025-03-15 00:42:18,514 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,514 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,514 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,514 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L716-->L716-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21|))) (and (= (select .cse0 |v_~#mutex2~0.offset_21|) 0) (= 0 |v_ULTIMATE.start_main_#t~ret28#1_7|) (= (store |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21| (store .cse0 |v_~#mutex2~0.offset_21| 1)) |v_#pthreadsMutex_117|))) InVars {~#mutex2~0.base=|v_~#mutex2~0.base_21|, #pthreadsMutex=|v_#pthreadsMutex_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|} OutVars{ULTIMATE.start_main_#t~ret28#1=|v_ULTIMATE.start_main_#t~ret28#1_7|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|, ~#mutex2~0.base=|v_~#mutex2~0.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret28#1, #pthreadsMutex][258], [225#(= |#race~g2~0| 0), 27#L691-6true, 106#L699-5true, 220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 226#true, 217#true, 121#L716-3true]) [2025-03-15 00:42:18,514 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-03-15 00:42:18,514 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:42:18,514 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:42:18,514 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:42:18,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L716-->L716-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21|))) (and (= (select .cse0 |v_~#mutex2~0.offset_21|) 0) (= 0 |v_ULTIMATE.start_main_#t~ret28#1_7|) (= (store |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21| (store .cse0 |v_~#mutex2~0.offset_21| 1)) |v_#pthreadsMutex_117|))) InVars {~#mutex2~0.base=|v_~#mutex2~0.base_21|, #pthreadsMutex=|v_#pthreadsMutex_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|} OutVars{ULTIMATE.start_main_#t~ret28#1=|v_ULTIMATE.start_main_#t~ret28#1_7|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|, ~#mutex2~0.base=|v_~#mutex2~0.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret28#1, #pthreadsMutex][288], [220#true, 27#L691-6true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 22#L699-7true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 223#true, 121#L716-3true, 217#true]) [2025-03-15 00:42:18,560 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,560 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,560 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,560 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L716-->L716-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21|))) (and (= (select .cse0 |v_~#mutex2~0.offset_21|) 0) (= 0 |v_ULTIMATE.start_main_#t~ret28#1_7|) (= (store |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21| (store .cse0 |v_~#mutex2~0.offset_21| 1)) |v_#pthreadsMutex_117|))) InVars {~#mutex2~0.base=|v_~#mutex2~0.base_21|, #pthreadsMutex=|v_#pthreadsMutex_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|} OutVars{ULTIMATE.start_main_#t~ret28#1=|v_ULTIMATE.start_main_#t~ret28#1_7|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|, ~#mutex2~0.base=|v_~#mutex2~0.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret28#1, #pthreadsMutex][258], [225#(= |#race~g2~0| 0), 220#true, 106#L699-5true, t2_funThread1of1ForFork1InUse, 85#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of1ForFork0InUse, 226#true, 121#L716-3true, 217#true]) [2025-03-15 00:42:18,563 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,563 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,563 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,563 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L716-->L716-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21|))) (and (= (select .cse0 |v_~#mutex2~0.offset_21|) 0) (= 0 |v_ULTIMATE.start_main_#t~ret28#1_7|) (= (store |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21| (store .cse0 |v_~#mutex2~0.offset_21| 1)) |v_#pthreadsMutex_117|))) InVars {~#mutex2~0.base=|v_~#mutex2~0.base_21|, #pthreadsMutex=|v_#pthreadsMutex_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|} OutVars{ULTIMATE.start_main_#t~ret28#1=|v_ULTIMATE.start_main_#t~ret28#1_7|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|, ~#mutex2~0.base=|v_~#mutex2~0.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret28#1, #pthreadsMutex][258], [225#(= |#race~g2~0| 0), 106#L699-5true, 220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 226#true, 95#L691-7true, 217#true, 121#L716-3true]) [2025-03-15 00:42:18,564 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,564 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,564 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,564 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:42:18,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L716-->L716-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21|))) (and (= (select .cse0 |v_~#mutex2~0.offset_21|) 0) (= 0 |v_ULTIMATE.start_main_#t~ret28#1_7|) (= (store |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21| (store .cse0 |v_~#mutex2~0.offset_21| 1)) |v_#pthreadsMutex_117|))) InVars {~#mutex2~0.base=|v_~#mutex2~0.base_21|, #pthreadsMutex=|v_#pthreadsMutex_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|} OutVars{ULTIMATE.start_main_#t~ret28#1=|v_ULTIMATE.start_main_#t~ret28#1_7|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|, ~#mutex2~0.base=|v_~#mutex2~0.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret28#1, #pthreadsMutex][288], [220#true, t2_funThread1of1ForFork1InUse, 85#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of1ForFork0InUse, 43#L699-6true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 223#true, 217#true, 121#L716-3true]) [2025-03-15 00:42:18,607 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,607 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,607 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,607 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L716-->L716-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21|))) (and (= (select .cse0 |v_~#mutex2~0.offset_21|) 0) (= 0 |v_ULTIMATE.start_main_#t~ret28#1_7|) (= (store |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21| (store .cse0 |v_~#mutex2~0.offset_21| 1)) |v_#pthreadsMutex_117|))) InVars {~#mutex2~0.base=|v_~#mutex2~0.base_21|, #pthreadsMutex=|v_#pthreadsMutex_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|} OutVars{ULTIMATE.start_main_#t~ret28#1=|v_ULTIMATE.start_main_#t~ret28#1_7|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|, ~#mutex2~0.base=|v_~#mutex2~0.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret28#1, #pthreadsMutex][288], [220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 43#L699-6true, 95#L691-7true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 223#true, 217#true, 121#L716-3true]) [2025-03-15 00:42:18,607 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,607 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,607 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,607 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L692-->L692-3: Formula: (and (= 0 |v_t_funThread1of1ForFork0_#t~ret9_1|) (= (store |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73| (store (select |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73|) |v_~#__global_lock~0.offset_73| 0)) |v_#pthreadsMutex_197|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, t_funThread1of1ForFork0_#t~ret9=|v_t_funThread1of1ForFork0_#t~ret9_1|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~ret9][230], [225#(= |#race~g2~0| 0), 220#true, 106#L699-5true, t2_funThread1of1ForFork1InUse, 49#L715-3true, t_funThread1of1ForFork0InUse, 133#L692-3true, 226#true, 217#true]) [2025-03-15 00:42:18,610 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,610 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,610 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,610 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:42:18,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L716-->L716-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21|))) (and (= (select .cse0 |v_~#mutex2~0.offset_21|) 0) (= 0 |v_ULTIMATE.start_main_#t~ret28#1_7|) (= (store |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21| (store .cse0 |v_~#mutex2~0.offset_21| 1)) |v_#pthreadsMutex_117|))) InVars {~#mutex2~0.base=|v_~#mutex2~0.base_21|, #pthreadsMutex=|v_#pthreadsMutex_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|} OutVars{ULTIMATE.start_main_#t~ret28#1=|v_ULTIMATE.start_main_#t~ret28#1_7|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|, ~#mutex2~0.base=|v_~#mutex2~0.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret28#1, #pthreadsMutex][288], [220#true, t2_funThread1of1ForFork1InUse, 85#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of1ForFork0InUse, 22#L699-7true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 223#true, 121#L716-3true, 217#true]) [2025-03-15 00:42:18,655 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,655 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,655 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,655 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L716-->L716-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21|))) (and (= (select .cse0 |v_~#mutex2~0.offset_21|) 0) (= 0 |v_ULTIMATE.start_main_#t~ret28#1_7|) (= (store |v_#pthreadsMutex_118| |v_~#mutex2~0.base_21| (store .cse0 |v_~#mutex2~0.offset_21| 1)) |v_#pthreadsMutex_117|))) InVars {~#mutex2~0.base=|v_~#mutex2~0.base_21|, #pthreadsMutex=|v_#pthreadsMutex_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|} OutVars{ULTIMATE.start_main_#t~ret28#1=|v_ULTIMATE.start_main_#t~ret28#1_7|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_21|, ~#mutex2~0.base=|v_~#mutex2~0.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret28#1, #pthreadsMutex][288], [220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 22#L699-7true, 95#L691-7true, 223#true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 121#L716-3true, 217#true]) [2025-03-15 00:42:18,655 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,655 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,655 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,655 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L692-->L692-3: Formula: (and (= 0 |v_t_funThread1of1ForFork0_#t~ret9_1|) (= (store |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73| (store (select |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73|) |v_~#__global_lock~0.offset_73| 0)) |v_#pthreadsMutex_197|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, t_funThread1of1ForFork0_#t~ret9=|v_t_funThread1of1ForFork0_#t~ret9_1|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~ret9][229], [220#true, t2_funThread1of1ForFork1InUse, 49#L715-3true, t_funThread1of1ForFork0InUse, 133#L692-3true, 43#L699-6true, 223#true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 217#true]) [2025-03-15 00:42:18,658 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,658 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,658 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,658 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:42:18,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L692-->L692-3: Formula: (and (= 0 |v_t_funThread1of1ForFork0_#t~ret9_1|) (= (store |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73| (store (select |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73|) |v_~#__global_lock~0.offset_73| 0)) |v_#pthreadsMutex_197|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, t_funThread1of1ForFork0_#t~ret9=|v_t_funThread1of1ForFork0_#t~ret9_1|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~ret9][229], [220#true, t2_funThread1of1ForFork1InUse, 49#L715-3true, t_funThread1of1ForFork0InUse, 133#L692-3true, 22#L699-7true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 223#true, 217#true]) [2025-03-15 00:42:18,705 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-03-15 00:42:18,705 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:42:18,705 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:42:18,706 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:42:19,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L692-->L692-3: Formula: (and (= 0 |v_t_funThread1of1ForFork0_#t~ret9_1|) (= (store |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73| (store (select |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73|) |v_~#__global_lock~0.offset_73| 0)) |v_#pthreadsMutex_197|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, t_funThread1of1ForFork0_#t~ret9=|v_t_funThread1of1ForFork0_#t~ret9_1|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~ret9][230], [225#(= |#race~g2~0| 0), 115#L719-3true, 220#true, 106#L699-5true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 133#L692-3true, 226#true, 217#true]) [2025-03-15 00:42:19,507 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,507 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,507 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,507 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L720-->L720-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57|))) (and (= 0 |v_ULTIMATE.start_main_#t~ret31#1_7|) (= (select .cse0 |v_~#__global_lock~0.offset_57|) 0) (= (store |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57| (store .cse0 |v_~#__global_lock~0.offset_57| 1)) |v_#pthreadsMutex_141|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_142|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_141|, ULTIMATE.start_main_#t~ret31#1=|v_ULTIMATE.start_main_#t~ret31#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret31#1][355], [27#L691-6true, 220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 166#L720-3true, 43#L699-6true, 223#true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 217#true]) [2025-03-15 00:42:19,507 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,508 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,508 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,508 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L720-->L720-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57|))) (and (= 0 |v_ULTIMATE.start_main_#t~ret31#1_7|) (= (select .cse0 |v_~#__global_lock~0.offset_57|) 0) (= (store |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57| (store .cse0 |v_~#__global_lock~0.offset_57| 1)) |v_#pthreadsMutex_141|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_142|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_141|, ULTIMATE.start_main_#t~ret31#1=|v_ULTIMATE.start_main_#t~ret31#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret31#1][332], [225#(= |#race~g2~0| 0), 27#L691-6true, 220#true, 106#L699-5true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 166#L720-3true, 226#true, 217#true]) [2025-03-15 00:42:19,508 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-03-15 00:42:19,508 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-15 00:42:19,508 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-15 00:42:19,508 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-15 00:42:19,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L720-->L720-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57|))) (and (= 0 |v_ULTIMATE.start_main_#t~ret31#1_7|) (= (select .cse0 |v_~#__global_lock~0.offset_57|) 0) (= (store |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57| (store .cse0 |v_~#__global_lock~0.offset_57| 1)) |v_#pthreadsMutex_141|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_142|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_141|, ULTIMATE.start_main_#t~ret31#1=|v_ULTIMATE.start_main_#t~ret31#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret31#1][355], [27#L691-6true, 220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 166#L720-3true, 22#L699-7true, 223#true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 217#true]) [2025-03-15 00:42:19,593 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,593 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,593 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,593 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L692-->L692-3: Formula: (and (= 0 |v_t_funThread1of1ForFork0_#t~ret9_1|) (= (store |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73| (store (select |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73|) |v_~#__global_lock~0.offset_73| 0)) |v_#pthreadsMutex_197|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, t_funThread1of1ForFork0_#t~ret9=|v_t_funThread1of1ForFork0_#t~ret9_1|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~ret9][229], [115#L719-3true, 220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 133#L692-3true, 43#L699-6true, 223#true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 217#true]) [2025-03-15 00:42:19,599 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,599 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,599 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,599 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L720-->L720-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57|))) (and (= 0 |v_ULTIMATE.start_main_#t~ret31#1_7|) (= (select .cse0 |v_~#__global_lock~0.offset_57|) 0) (= (store |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57| (store .cse0 |v_~#__global_lock~0.offset_57| 1)) |v_#pthreadsMutex_141|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_142|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_141|, ULTIMATE.start_main_#t~ret31#1=|v_ULTIMATE.start_main_#t~ret31#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret31#1][332], [225#(= |#race~g2~0| 0), 220#true, 106#L699-5true, t2_funThread1of1ForFork1InUse, 85#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of1ForFork0InUse, 166#L720-3true, 226#true, 217#true]) [2025-03-15 00:42:19,602 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,602 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,603 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,603 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L720-->L720-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57|))) (and (= 0 |v_ULTIMATE.start_main_#t~ret31#1_7|) (= (select .cse0 |v_~#__global_lock~0.offset_57|) 0) (= (store |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57| (store .cse0 |v_~#__global_lock~0.offset_57| 1)) |v_#pthreadsMutex_141|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_142|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_141|, ULTIMATE.start_main_#t~ret31#1=|v_ULTIMATE.start_main_#t~ret31#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret31#1][332], [225#(= |#race~g2~0| 0), 220#true, 106#L699-5true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 166#L720-3true, 226#true, 95#L691-7true, 217#true]) [2025-03-15 00:42:19,603 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,603 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,603 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,603 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2025-03-15 00:42:19,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([628] L692-->L692-3: Formula: (and (= 0 |v_t_funThread1of1ForFork0_#t~ret9_1|) (= (store |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73| (store (select |v_#pthreadsMutex_198| |v_~#__global_lock~0.base_73|) |v_~#__global_lock~0.offset_73| 0)) |v_#pthreadsMutex_197|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_198|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_197|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_73|, t_funThread1of1ForFork0_#t~ret9=|v_t_funThread1of1ForFork0_#t~ret9_1|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_73|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~ret9][229], [115#L719-3true, 220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 22#L699-7true, 133#L692-3true, 223#true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 217#true]) [2025-03-15 00:42:19,689 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-03-15 00:42:19,689 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-15 00:42:19,689 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-15 00:42:19,689 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-15 00:42:19,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L720-->L720-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57|))) (and (= 0 |v_ULTIMATE.start_main_#t~ret31#1_7|) (= (select .cse0 |v_~#__global_lock~0.offset_57|) 0) (= (store |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57| (store .cse0 |v_~#__global_lock~0.offset_57| 1)) |v_#pthreadsMutex_141|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_142|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_141|, ULTIMATE.start_main_#t~ret31#1=|v_ULTIMATE.start_main_#t~ret31#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret31#1][355], [220#true, t2_funThread1of1ForFork1InUse, 85#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of1ForFork0InUse, 166#L720-3true, 43#L699-6true, 223#true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 217#true]) [2025-03-15 00:42:19,694 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,694 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,694 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,694 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L720-->L720-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57|))) (and (= 0 |v_ULTIMATE.start_main_#t~ret31#1_7|) (= (select .cse0 |v_~#__global_lock~0.offset_57|) 0) (= (store |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57| (store .cse0 |v_~#__global_lock~0.offset_57| 1)) |v_#pthreadsMutex_141|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_142|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_141|, ULTIMATE.start_main_#t~ret31#1=|v_ULTIMATE.start_main_#t~ret31#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret31#1][355], [220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 166#L720-3true, 43#L699-6true, 95#L691-7true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 223#true, 217#true]) [2025-03-15 00:42:19,694 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,694 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,694 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,694 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-15 00:42:19,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L720-->L720-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57|))) (and (= 0 |v_ULTIMATE.start_main_#t~ret31#1_7|) (= (select .cse0 |v_~#__global_lock~0.offset_57|) 0) (= (store |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57| (store .cse0 |v_~#__global_lock~0.offset_57| 1)) |v_#pthreadsMutex_141|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_142|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_141|, ULTIMATE.start_main_#t~ret31#1=|v_ULTIMATE.start_main_#t~ret31#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret31#1][355], [220#true, t2_funThread1of1ForFork1InUse, 85#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, t_funThread1of1ForFork0InUse, 166#L720-3true, 22#L699-7true, 223#true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 217#true]) [2025-03-15 00:42:19,784 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,784 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,784 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,784 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L720-->L720-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57|))) (and (= 0 |v_ULTIMATE.start_main_#t~ret31#1_7|) (= (select .cse0 |v_~#__global_lock~0.offset_57|) 0) (= (store |v_#pthreadsMutex_142| |v_~#__global_lock~0.base_57| (store .cse0 |v_~#__global_lock~0.offset_57| 1)) |v_#pthreadsMutex_141|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_142|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_141|, ULTIMATE.start_main_#t~ret31#1=|v_ULTIMATE.start_main_#t~ret31#1_7|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_57|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_57|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret31#1][355], [220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 22#L699-7true, 166#L720-3true, 223#true, 228#(= |t2_funThread1of1ForFork1_#t~nondet14| |#race~g2~0|), 95#L691-7true, 217#true]) [2025-03-15 00:42:19,784 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,784 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,784 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 00:42:19,784 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 00:42:20,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L689-->L689-3: Formula: (and (= (store |v_#pthreadsMutex_214| |v_~#__global_lock~0.base_77| (store (select |v_#pthreadsMutex_214| |v_~#__global_lock~0.base_77|) |v_~#__global_lock~0.offset_77| 0)) |v_#pthreadsMutex_213|) (= 0 |v_t_funThread1of1ForFork0_#t~ret5_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_214|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_77|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_77|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, t_funThread1of1ForFork0_#t~ret5=|v_t_funThread1of1ForFork0_#t~ret5_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_77|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_77|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~ret5][167], [220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 16#L725-2true, 28#L689-3true, 190#L700true, 226#true, 219#(= |#race~g1~0| 0), 223#true]) [2025-03-15 00:42:20,792 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-15 00:42:20,793 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-15 00:42:20,793 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-15 00:42:20,793 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-15 00:42:20,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L700-->L700-3: Formula: (and (= |v_t2_funThread1of1ForFork1_#t~ret15_1| 0) (= (store |v_#pthreadsMutex_62| |v_~#__global_lock~0.base_25| (store (select |v_#pthreadsMutex_62| |v_~#__global_lock~0.base_25|) |v_~#__global_lock~0.offset_25| 0)) |v_#pthreadsMutex_61|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_62|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_25|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_61|, t2_funThread1of1ForFork1_#t~ret15=|v_t2_funThread1of1ForFork1_#t~ret15_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_25|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork1_#t~ret15][157], [60#L700-3true, 220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 16#L725-2true, 180#L689true, 226#true, 219#(= |#race~g1~0| 0), 223#true]) [2025-03-15 00:42:20,793 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-15 00:42:20,793 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-15 00:42:20,793 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-15 00:42:20,793 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-15 00:42:21,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L726-->L726-3: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~ret35#1_7|) (= (store |v_#pthreadsMutex_174| |v_~#__global_lock~0.base_69| (store (select |v_#pthreadsMutex_174| |v_~#__global_lock~0.base_69|) |v_~#__global_lock~0.offset_69| 0)) |v_#pthreadsMutex_173|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_174|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_69|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_69|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_173|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_69|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_69|, ULTIMATE.start_main_#t~ret35#1=|v_ULTIMATE.start_main_#t~ret35#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret35#1][406], [220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 180#L689true, 190#L700true, 118#L726-3true, 226#true, 219#(= |#race~g1~0| 0), 223#true]) [2025-03-15 00:42:21,325 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-03-15 00:42:21,325 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-15 00:42:21,325 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-15 00:42:21,325 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-15 00:42:21,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L689-->L689-3: Formula: (and (= (store |v_#pthreadsMutex_214| |v_~#__global_lock~0.base_77| (store (select |v_#pthreadsMutex_214| |v_~#__global_lock~0.base_77|) |v_~#__global_lock~0.offset_77| 0)) |v_#pthreadsMutex_213|) (= 0 |v_t_funThread1of1ForFork0_#t~ret5_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_214|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_77|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_77|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, t_funThread1of1ForFork0_#t~ret5=|v_t_funThread1of1ForFork0_#t~ret5_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_77|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_77|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~ret5][84], [220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 28#L689-3true, 190#L700true, 226#true, 118#L726-3true, 223#true, 217#true]) [2025-03-15 00:42:21,704 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2025-03-15 00:42:21,704 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-15 00:42:21,704 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-15 00:42:21,704 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-15 00:42:21,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L700-->L700-3: Formula: (and (= |v_t2_funThread1of1ForFork1_#t~ret15_1| 0) (= (store |v_#pthreadsMutex_62| |v_~#__global_lock~0.base_25| (store (select |v_#pthreadsMutex_62| |v_~#__global_lock~0.base_25|) |v_~#__global_lock~0.offset_25| 0)) |v_#pthreadsMutex_61|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_62|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_25|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_61|, t2_funThread1of1ForFork1_#t~ret15=|v_t2_funThread1of1ForFork1_#t~ret15_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_25|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork1_#t~ret15][120], [60#L700-3true, 220#true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 180#L689true, 118#L726-3true, 226#true, 223#true, 217#true]) [2025-03-15 00:42:21,707 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2025-03-15 00:42:21,707 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-15 00:42:21,707 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-15 00:42:21,707 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-15 00:42:21,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L727-->L727-3: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~ret36#1_7|) (= (store |v_#pthreadsMutex_182| |v_~#mutex1~0.base_13| (store (select |v_#pthreadsMutex_182| |v_~#mutex1~0.base_13|) |v_~#mutex1~0.offset_13| 0)) |v_#pthreadsMutex_181|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_182|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_13|, ~#mutex1~0.base=|v_~#mutex1~0.base_13|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_181|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_13|, ULTIMATE.start_main_#t~ret36#1=|v_ULTIMATE.start_main_#t~ret36#1_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_13|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret36#1][454], [220#true, 194#L727-3true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 180#L689true, 190#L700true, 226#true, 223#true, 217#true]) [2025-03-15 00:42:21,708 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-15 00:42:21,708 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-15 00:42:21,708 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-15 00:42:21,708 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-15 00:42:22,807 INFO L124 PetriNetUnfolderBase]: 24376/65618 cut-off events. [2025-03-15 00:42:22,807 INFO L125 PetriNetUnfolderBase]: For 102794/129486 co-relation queries the response was YES. [2025-03-15 00:42:22,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185872 conditions, 65618 events. 24376/65618 cut-off events. For 102794/129486 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 810717 event pairs, 5341 based on Foata normal form. 1346/59397 useless extension candidates. Maximal degree in co-relation 185574. Up to 27830 conditions per place. [2025-03-15 00:42:23,195 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 288 selfloop transitions, 4 changer transitions 8/473 dead transitions. [2025-03-15 00:42:23,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 473 transitions, 3430 flow [2025-03-15 00:42:23,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2025-03-15 00:42:23,197 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8403100775193798 [2025-03-15 00:42:23,197 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -6 predicate places. [2025-03-15 00:42:23,198 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 473 transitions, 3430 flow [2025-03-15 00:42:23,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-15 00:42:23,198 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:23,198 INFO L221 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] [2025-03-15 00:42:23,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:42:23,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1299933085, now seen corresponding path program 1 times [2025-03-15 00:42:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:23,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497550136] [2025-03-15 00:42:23,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:23,409 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-15 00:42:23,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497550136] [2025-03-15 00:42:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497550136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:23,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:23,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:42:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999639673] [2025-03-15 00:42:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:23,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 00:42:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:23,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 00:42:23,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 00:42:23,410 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 215 [2025-03-15 00:42:23,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 473 transitions, 3430 flow. Second operand has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 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-15 00:42:23,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:23,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 215 [2025-03-15 00:42:23,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:25,793 INFO L124 PetriNetUnfolderBase]: 8870/28207 cut-off events. [2025-03-15 00:42:25,793 INFO L125 PetriNetUnfolderBase]: For 61010/65622 co-relation queries the response was YES. [2025-03-15 00:42:25,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83856 conditions, 28207 events. 8870/28207 cut-off events. For 61010/65622 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 334704 event pairs, 1712 based on Foata normal form. 680/26377 useless extension candidates. Maximal degree in co-relation 83516. Up to 12484 conditions per place. [2025-03-15 00:42:25,950 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 288 selfloop transitions, 55 changer transitions 17/549 dead transitions. [2025-03-15 00:42:25,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 549 transitions, 4905 flow [2025-03-15 00:42:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:42:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:42:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 880 transitions. [2025-03-15 00:42:25,953 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8186046511627907 [2025-03-15 00:42:25,953 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -2 predicate places. [2025-03-15 00:42:25,953 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 549 transitions, 4905 flow [2025-03-15 00:42:25,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 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-15 00:42:25,954 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:25,954 INFO L221 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] [2025-03-15 00:42:25,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:42:25,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:25,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:25,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1686946676, now seen corresponding path program 1 times [2025-03-15 00:42:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:25,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184436624] [2025-03-15 00:42:25,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:25,989 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-15 00:42:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:25,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184436624] [2025-03-15 00:42:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184436624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:25,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:25,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:25,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699139024] [2025-03-15 00:42:25,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:25,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:25,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:25,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:25,991 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 215 [2025-03-15 00:42:25,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 549 transitions, 4905 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-15 00:42:25,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:25,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 215 [2025-03-15 00:42:25,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:29,306 INFO L124 PetriNetUnfolderBase]: 9665/30362 cut-off events. [2025-03-15 00:42:29,306 INFO L125 PetriNetUnfolderBase]: For 88085/97185 co-relation queries the response was YES. [2025-03-15 00:42:29,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103598 conditions, 30362 events. 9665/30362 cut-off events. For 88085/97185 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 362705 event pairs, 1916 based on Foata normal form. 229/28205 useless extension candidates. Maximal degree in co-relation 102730. Up to 13040 conditions per place. [2025-03-15 00:42:29,456 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 439 selfloop transitions, 8 changer transitions 55/656 dead transitions. [2025-03-15 00:42:29,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 656 transitions, 7094 flow [2025-03-15 00:42:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2025-03-15 00:42:29,458 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8310077519379845 [2025-03-15 00:42:29,459 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, 0 predicate places. [2025-03-15 00:42:29,459 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 656 transitions, 7094 flow [2025-03-15 00:42:29,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-15 00:42:29,459 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:29,459 INFO L221 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] [2025-03-15 00:42:29,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:42:29,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2_funErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:29,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1464912069, now seen corresponding path program 1 times [2025-03-15 00:42:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:29,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852378990] [2025-03-15 00:42:29,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:29,498 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-15 00:42:29,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:29,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852378990] [2025-03-15 00:42:29,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852378990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:29,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:29,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:42:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188506972] [2025-03-15 00:42:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:29,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:42:29,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:29,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:42:29,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:42:29,499 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 215 [2025-03-15 00:42:29,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 656 transitions, 7094 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:42:29,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:29,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 215 [2025-03-15 00:42:29,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:32,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L727-->L727-3: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~ret36#1_7|) (= (store |v_#pthreadsMutex_182| |v_~#mutex1~0.base_13| (store (select |v_#pthreadsMutex_182| |v_~#mutex1~0.base_13|) |v_~#mutex1~0.offset_13| 0)) |v_#pthreadsMutex_181|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_182|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_13|, ~#mutex1~0.base=|v_~#mutex1~0.base_13|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_181|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_13|, ULTIMATE.start_main_#t~ret36#1=|v_ULTIMATE.start_main_#t~ret36#1_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_13|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret36#1][510], [225#(= |#race~g2~0| 0), 220#true, 235#(and (= |~#mutex1~0.base| 3) (not (= 3 |~#__global_lock~0.base|))), 194#L727-3true, 240#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~g1~0|), t2_funThread1of1ForFork1InUse, 241#true, t_funThread1of1ForFork0InUse, 226#true, 97#L702-5true, 95#L691-7true, 217#true]) [2025-03-15 00:42:32,698 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-03-15 00:42:32,698 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:42:32,698 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:42:32,698 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:42:32,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L727-->L727-3: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~ret36#1_7|) (= (store |v_#pthreadsMutex_182| |v_~#mutex1~0.base_13| (store (select |v_#pthreadsMutex_182| |v_~#mutex1~0.base_13|) |v_~#mutex1~0.offset_13| 0)) |v_#pthreadsMutex_181|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_182|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_13|, ~#mutex1~0.base=|v_~#mutex1~0.base_13|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_181|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_13|, ULTIMATE.start_main_#t~ret36#1=|v_ULTIMATE.start_main_#t~ret36#1_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_13|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret36#1][667], [182#L702-6true, 220#true, 235#(and (= |~#mutex1~0.base| 3) (not (= 3 |~#__global_lock~0.base|))), 194#L727-3true, 240#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~g1~0|), t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 243#(= |t2_funThread1of1ForFork1_#t~nondet18| |#race~g2~0|), 226#true, 223#true, 95#L691-7true, 217#true]) [2025-03-15 00:42:32,901 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-03-15 00:42:32,901 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:42:32,901 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:42:32,901 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:42:32,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L727-->L727-3: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~ret36#1_7|) (= (store |v_#pthreadsMutex_182| |v_~#mutex1~0.base_13| (store (select |v_#pthreadsMutex_182| |v_~#mutex1~0.base_13|) |v_~#mutex1~0.offset_13| 0)) |v_#pthreadsMutex_181|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_182|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_13|, ~#mutex1~0.base=|v_~#mutex1~0.base_13|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_181|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_13|, ULTIMATE.start_main_#t~ret36#1=|v_ULTIMATE.start_main_#t~ret36#1_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_13|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~ret36#1][667], [220#true, 235#(and (= |~#mutex1~0.base| 3) (not (= 3 |~#__global_lock~0.base|))), 240#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~g1~0|), 194#L727-3true, t2_funThread1of1ForFork1InUse, t_funThread1of1ForFork0InUse, 243#(= |t2_funThread1of1ForFork1_#t~nondet18| |#race~g2~0|), 86#L702-7true, 226#true, 223#true, 95#L691-7true, 217#true]) [2025-03-15 00:42:32,928 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-15 00:42:32,928 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:42:32,928 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:42:32,928 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:42:33,078 INFO L124 PetriNetUnfolderBase]: 10763/32653 cut-off events. [2025-03-15 00:42:33,078 INFO L125 PetriNetUnfolderBase]: For 147111/166524 co-relation queries the response was YES. [2025-03-15 00:42:33,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124677 conditions, 32653 events. 10763/32653 cut-off events. For 147111/166524 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 389647 event pairs, 1954 based on Foata normal form. 524/30585 useless extension candidates. Maximal degree in co-relation 124260. Up to 14195 conditions per place. [2025-03-15 00:42:33,232 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 383 selfloop transitions, 4 changer transitions 186/760 dead transitions. [2025-03-15 00:42:33,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 760 transitions, 9652 flow [2025-03-15 00:42:33,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:42:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:42:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2025-03-15 00:42:33,233 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8403100775193798 [2025-03-15 00:42:33,234 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, 2 predicate places. [2025-03-15 00:42:33,234 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 760 transitions, 9652 flow [2025-03-15 00:42:33,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:42:33,234 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:33,234 INFO L221 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] [2025-03-15 00:42:33,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:42:33,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:33,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1430103126, now seen corresponding path program 1 times [2025-03-15 00:42:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:33,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57727550] [2025-03-15 00:42:33,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:33,417 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-15 00:42:33,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57727550] [2025-03-15 00:42:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57727550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:33,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:33,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 00:42:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929424734] [2025-03-15 00:42:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:33,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:42:33,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:33,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:42:33,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:42:33,419 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 215 [2025-03-15 00:42:33,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 760 transitions, 9652 flow. Second operand has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 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-15 00:42:33,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:33,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 215 [2025-03-15 00:42:33,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:35,596 INFO L124 PetriNetUnfolderBase]: 4368/15933 cut-off events. [2025-03-15 00:42:35,597 INFO L125 PetriNetUnfolderBase]: For 110390/115214 co-relation queries the response was YES. [2025-03-15 00:42:35,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65834 conditions, 15933 events. 4368/15933 cut-off events. For 110390/115214 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 175080 event pairs, 887 based on Foata normal form. 1619/16879 useless extension candidates. Maximal degree in co-relation 64565. Up to 6863 conditions per place. [2025-03-15 00:42:35,650 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 115 selfloop transitions, 148 changer transitions 240/687 dead transitions. [2025-03-15 00:42:35,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 687 transitions, 9645 flow [2025-03-15 00:42:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 00:42:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 00:42:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 881 transitions. [2025-03-15 00:42:35,652 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8195348837209302 [2025-03-15 00:42:35,652 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, 3 predicate places. [2025-03-15 00:42:35,652 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 687 transitions, 9645 flow [2025-03-15 00:42:35,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 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-15 00:42:35,653 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:42:35,654 INFO L221 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-15 00:42:35,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:42:35,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-15 00:42:35,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:42:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1125899432, now seen corresponding path program 1 times [2025-03-15 00:42:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:42:35,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375902190] [2025-03-15 00:42:35,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:42:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:42:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:42:35,956 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-15 00:42:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:42:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375902190] [2025-03-15 00:42:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375902190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:42:35,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:42:35,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 00:42:35,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193844947] [2025-03-15 00:42:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:42:35,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 00:42:35,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:42:35,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 00:42:35,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 00:42:35,958 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 215 [2025-03-15 00:42:35,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 687 transitions, 9645 flow. Second operand has 7 states, 7 states have (on average 161.28571428571428) internal successors, (1129), 7 states have internal predecessors, (1129), 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-15 00:42:35,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:42:35,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 215 [2025-03-15 00:42:35,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:42:36,555 INFO L124 PetriNetUnfolderBase]: 756/4107 cut-off events. [2025-03-15 00:42:36,555 INFO L125 PetriNetUnfolderBase]: For 34154/34801 co-relation queries the response was YES. [2025-03-15 00:42:36,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17376 conditions, 4107 events. 756/4107 cut-off events. For 34154/34801 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 34052 event pairs, 170 based on Foata normal form. 233/4235 useless extension candidates. Maximal degree in co-relation 15987. Up to 1532 conditions per place. [2025-03-15 00:42:36,566 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 0 selfloop transitions, 0 changer transitions 377/377 dead transitions. [2025-03-15 00:42:36,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 377 transitions, 5003 flow [2025-03-15 00:42:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:42:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:42:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2025-03-15 00:42:36,568 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7728682170542636 [2025-03-15 00:42:36,569 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, 3 predicate places. [2025-03-15 00:42:36,569 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 377 transitions, 5003 flow [2025-03-15 00:42:36,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 161.28571428571428) internal successors, (1129), 7 states have internal predecessors, (1129), 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-15 00:42:36,577 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_27-multiple-protecting2_true.i_petrified1_AllErrorsAtOnce [2025-03-15 00:42:36,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2025-03-15 00:42:36,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-15 00:42:36,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-15 00:42:36,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-15 00:42:36,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-15 00:42:36,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-15 00:42:36,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-15 00:42:36,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-15 00:42:36,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-15 00:42:36,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-15 00:42:36,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:42:36,595 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:42:36,598 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:42:36,599 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:42:36,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:42:36 BasicIcfg [2025-03-15 00:42:36,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:42:36,602 INFO L158 Benchmark]: Toolchain (without parser) took 29729.52ms. Allocated memory was 71.3MB in the beginning and 3.9GB in the end (delta: 3.9GB). Free memory was 42.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2025-03-15 00:42:36,602 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 33.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:42:36,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.51ms. Allocated memory is still 71.3MB. Free memory was 42.5MB in the beginning and 22.0MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-03-15 00:42:36,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.76ms. Allocated memory is still 71.3MB. Free memory was 22.0MB in the beginning and 20.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:42:36,604 INFO L158 Benchmark]: Boogie Preprocessor took 25.48ms. Allocated memory is still 71.3MB. Free memory was 20.1MB in the beginning and 18.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:42:36,604 INFO L158 Benchmark]: RCFGBuilder took 474.59ms. Allocated memory is still 71.3MB. Free memory was 18.8MB in the beginning and 21.7MB in the end (delta: -3.0MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2025-03-15 00:42:36,604 INFO L158 Benchmark]: TraceAbstraction took 28840.29ms. Allocated memory was 71.3MB in the beginning and 3.9GB in the end (delta: 3.9GB). Free memory was 20.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2025-03-15 00:42:36,605 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 33.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 344.51ms. Allocated memory is still 71.3MB. Free memory was 42.5MB in the beginning and 22.0MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.76ms. Allocated memory is still 71.3MB. Free memory was 22.0MB in the beginning and 20.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.48ms. Allocated memory is still 71.3MB. Free memory was 20.1MB in the beginning and 18.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 474.59ms. Allocated memory is still 71.3MB. Free memory was 18.8MB in the beginning and 21.7MB in the end (delta: -3.0MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * TraceAbstraction took 28840.29ms. Allocated memory was 71.3MB in the beginning and 3.9GB in the end (delta: 3.9GB). Free memory was 20.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 714]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 721]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 725]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 688]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 688]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 286 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 879 IncrementalHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 109 mSDtfsCounter, 879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9652occurred in iteration=7, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 1623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:42:36,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...