/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/weaver/chl-array-int-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:54:01,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:54:01,875 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:54:01,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:54:01,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:54:01,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:54:01,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:54:01,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:54:01,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:54:01,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:54:01,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:54:01,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:54:01,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:54:01,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:54:01,909 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:54:01,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:54:01,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:54:01,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:54:01,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:54:01,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:54:01,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:54:01,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:54:01,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:54:01,910 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:54:02,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:54:02,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:54:02,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:54:02,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:54:02,169 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:54:02,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2025-03-15 00:54:02,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aaf57e60/3b4781e5338943a2a997577f56a34a27/FLAG0deb33daf [2025-03-15 00:54:04,204 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:54:04,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2025-03-15 00:54:04,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aaf57e60/3b4781e5338943a2a997577f56a34a27/FLAG0deb33daf [2025-03-15 00:54:04,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aaf57e60/3b4781e5338943a2a997577f56a34a27 [2025-03-15 00:54:04,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:54:04,233 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:54:04,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:54:04,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:54:04,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:54:04,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee90021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04, skipping insertion in model container [2025-03-15 00:54:04,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:54:04,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:54:04,432 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:54:04,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:54:04,474 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:54:04,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04 WrapperNode [2025-03-15 00:54:04,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:54:04,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:54:04,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:54:04,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:54:04,479 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:54:04" (1/1) ... [2025-03-15 00:54:04,487 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:54:04" (1/1) ... [2025-03-15 00:54:04,513 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 343 [2025-03-15 00:54:04,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:54:04,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:54:04,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:54:04,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:54:04,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:54:04,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:54:04,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:54:04,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:54:04,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (1/1) ... [2025-03-15 00:54:04,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:54:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:54:04,576 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:54:04,581 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:54:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:54:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:54:04,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:54:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:54:04,600 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:54:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:54:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:54:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:54:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:54:04,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:54:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:54:04,601 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:54:04,692 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:54:04,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:54:05,144 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:54:05,144 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:54:05,163 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:54:05,164 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 00:54:05,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:54:05 BoogieIcfgContainer [2025-03-15 00:54:05,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:54:05,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:54:05,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:54:05,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:54:05,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:54:04" (1/3) ... [2025-03-15 00:54:05,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e6a28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:54:05, skipping insertion in model container [2025-03-15 00:54:05,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:54:04" (2/3) ... [2025-03-15 00:54:05,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e6a28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:54:05, skipping insertion in model container [2025-03-15 00:54:05,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:54:05" (3/3) ... [2025-03-15 00:54:05,173 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-15 00:54:05,185 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:54:05,215 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 434 locations, 1 initial locations, 4 loop locations, and 42 error locations. [2025-03-15 00:54:05,216 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:54:05,324 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:54:05,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:54:05,367 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;@15b5a4a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:54:05,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-15 00:54:05,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:54:05,395 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-03-15 00:54:05,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:54:05,402 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:05,402 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] [2025-03-15 00:54:05,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:05,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1838763036, now seen corresponding path program 1 times [2025-03-15 00:54:05,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730788368] [2025-03-15 00:54:05,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:05,544 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:54:05,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:05,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730788368] [2025-03-15 00:54:05,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730788368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:05,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:05,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925452526] [2025-03-15 00:54:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:05,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:05,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:05,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:05,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:05,575 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 457 [2025-03-15 00:54:05,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 457 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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:54:05,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:05,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 457 [2025-03-15 00:54:05,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:05,924 INFO L124 PetriNetUnfolderBase]: 97/1720 cut-off events. [2025-03-15 00:54:05,925 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-15 00:54:05,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 1720 events. 97/1720 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 11082 event pairs, 48 based on Foata normal form. 36/1463 useless extension candidates. Maximal degree in co-relation 1528. Up to 127 conditions per place. [2025-03-15 00:54:05,945 INFO L140 encePairwiseOnDemand]: 440/457 looper letters, 22 selfloop transitions, 2 changer transitions 18/434 dead transitions. [2025-03-15 00:54:05,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 434 transitions, 928 flow [2025-03-15 00:54:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2025-03-15 00:54:05,961 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9409190371991247 [2025-03-15 00:54:05,964 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -8 predicate places. [2025-03-15 00:54:05,965 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 434 transitions, 928 flow [2025-03-15 00:54:05,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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:54:05,965 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:05,966 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] [2025-03-15 00:54:05,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:54:05,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:05,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash 378945651, now seen corresponding path program 1 times [2025-03-15 00:54:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:05,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810116208] [2025-03-15 00:54:05,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:05,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:06,021 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:54:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810116208] [2025-03-15 00:54:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810116208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:06,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:06,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745988291] [2025-03-15 00:54:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:06,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:06,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:06,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:06,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:06,025 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 457 [2025-03-15 00:54:06,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 434 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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:54:06,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:06,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 457 [2025-03-15 00:54:06,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:06,459 INFO L124 PetriNetUnfolderBase]: 188/2764 cut-off events. [2025-03-15 00:54:06,459 INFO L125 PetriNetUnfolderBase]: For 163/172 co-relation queries the response was YES. [2025-03-15 00:54:06,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 2764 events. 188/2764 cut-off events. For 163/172 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 21949 event pairs, 101 based on Foata normal form. 0/2287 useless extension candidates. Maximal degree in co-relation 2752. Up to 177 conditions per place. [2025-03-15 00:54:06,477 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 22 selfloop transitions, 2 changer transitions 18/433 dead transitions. [2025-03-15 00:54:06,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 433 transitions, 974 flow [2025-03-15 00:54:06,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1276 transitions. [2025-03-15 00:54:06,480 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9307075127644056 [2025-03-15 00:54:06,481 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -7 predicate places. [2025-03-15 00:54:06,481 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 433 transitions, 974 flow [2025-03-15 00:54:06,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 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:54:06,482 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:06,482 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] [2025-03-15 00:54:06,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:54:06,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:06,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:06,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1765132953, now seen corresponding path program 1 times [2025-03-15 00:54:06,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:06,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034563465] [2025-03-15 00:54:06,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:06,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:06,524 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:54:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:06,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034563465] [2025-03-15 00:54:06,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034563465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:06,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:06,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851707405] [2025-03-15 00:54:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:06,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:06,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:06,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:06,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:06,527 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 457 [2025-03-15 00:54:06,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 433 transitions, 974 flow. Second operand has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 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:54:06,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:06,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 457 [2025-03-15 00:54:06,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:06,794 INFO L124 PetriNetUnfolderBase]: 152/2409 cut-off events. [2025-03-15 00:54:06,794 INFO L125 PetriNetUnfolderBase]: For 281/311 co-relation queries the response was YES. [2025-03-15 00:54:06,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 2409 events. 152/2409 cut-off events. For 281/311 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18149 event pairs, 77 based on Foata normal form. 0/2023 useless extension candidates. Maximal degree in co-relation 2420. Up to 163 conditions per place. [2025-03-15 00:54:06,806 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 15 selfloop transitions, 1 changer transitions 18/428 dead transitions. [2025-03-15 00:54:06,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 428 transitions, 986 flow [2025-03-15 00:54:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2025-03-15 00:54:06,813 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.936542669584245 [2025-03-15 00:54:06,814 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -10 predicate places. [2025-03-15 00:54:06,814 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 428 transitions, 986 flow [2025-03-15 00:54:06,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 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:54:06,826 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:06,827 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] [2025-03-15 00:54:06,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:54:06,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:06,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:06,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2087221380, now seen corresponding path program 1 times [2025-03-15 00:54:06,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:06,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482206803] [2025-03-15 00:54:06,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:06,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:06,924 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:54:06,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:06,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482206803] [2025-03-15 00:54:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482206803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:06,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:06,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000052602] [2025-03-15 00:54:06,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:06,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:06,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:06,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:06,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:06,929 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 457 [2025-03-15 00:54:06,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 428 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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:54:06,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:06,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 457 [2025-03-15 00:54:06,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:07,307 INFO L124 PetriNetUnfolderBase]: 229/3151 cut-off events. [2025-03-15 00:54:07,307 INFO L125 PetriNetUnfolderBase]: For 835/883 co-relation queries the response was YES. [2025-03-15 00:54:07,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 3151 events. 229/3151 cut-off events. For 835/883 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 25356 event pairs, 125 based on Foata normal form. 0/2658 useless extension candidates. Maximal degree in co-relation 3478. Up to 268 conditions per place. [2025-03-15 00:54:07,328 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 19 selfloop transitions, 2 changer transitions 18/427 dead transitions. [2025-03-15 00:54:07,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 427 transitions, 1026 flow [2025-03-15 00:54:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-03-15 00:54:07,331 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9350838803792852 [2025-03-15 00:54:07,332 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -9 predicate places. [2025-03-15 00:54:07,332 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 427 transitions, 1026 flow [2025-03-15 00:54:07,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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:54:07,333 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:07,333 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] [2025-03-15 00:54:07,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:54:07,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:07,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1846509249, now seen corresponding path program 1 times [2025-03-15 00:54:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10201634] [2025-03-15 00:54:07,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:07,849 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:54:07,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:07,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10201634] [2025-03-15 00:54:07,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10201634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:07,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:07,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:54:07,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145721090] [2025-03-15 00:54:07,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:07,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:54:07,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:07,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:54:07,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:54:07,854 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 457 [2025-03-15 00:54:07,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 427 transitions, 1026 flow. Second operand has 6 states, 6 states have (on average 354.8333333333333) internal successors, (2129), 6 states have internal predecessors, (2129), 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:54:07,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:07,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 457 [2025-03-15 00:54:07,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:08,752 INFO L124 PetriNetUnfolderBase]: 937/6318 cut-off events. [2025-03-15 00:54:08,753 INFO L125 PetriNetUnfolderBase]: For 3586/3706 co-relation queries the response was YES. [2025-03-15 00:54:08,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9744 conditions, 6318 events. 937/6318 cut-off events. For 3586/3706 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 57003 event pairs, 765 based on Foata normal form. 0/5412 useless extension candidates. Maximal degree in co-relation 8982. Up to 2001 conditions per place. [2025-03-15 00:54:08,787 INFO L140 encePairwiseOnDemand]: 445/457 looper letters, 78 selfloop transitions, 10 changer transitions 18/425 dead transitions. [2025-03-15 00:54:08,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 425 transitions, 1198 flow [2025-03-15 00:54:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:54:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:54:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2208 transitions. [2025-03-15 00:54:08,801 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8052516411378556 [2025-03-15 00:54:08,805 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -6 predicate places. [2025-03-15 00:54:08,806 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 425 transitions, 1198 flow [2025-03-15 00:54:08,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 354.8333333333333) internal successors, (2129), 6 states have internal predecessors, (2129), 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:54:08,807 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:08,807 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:54:08,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:54:08,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:08,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1458203118, now seen corresponding path program 1 times [2025-03-15 00:54:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102846107] [2025-03-15 00:54:08,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:08,860 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:54:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:08,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102846107] [2025-03-15 00:54:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102846107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:08,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438082067] [2025-03-15 00:54:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:08,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:08,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:08,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:08,862 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 457 [2025-03-15 00:54:08,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 425 transitions, 1198 flow. Second operand has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 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:54:08,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:08,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 457 [2025-03-15 00:54:08,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:09,439 INFO L124 PetriNetUnfolderBase]: 902/5974 cut-off events. [2025-03-15 00:54:09,440 INFO L125 PetriNetUnfolderBase]: For 4419/4723 co-relation queries the response was YES. [2025-03-15 00:54:09,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9418 conditions, 5974 events. 902/5974 cut-off events. For 4419/4723 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 52921 event pairs, 740 based on Foata normal form. 0/5155 useless extension candidates. Maximal degree in co-relation 8628. Up to 1923 conditions per place. [2025-03-15 00:54:09,469 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 15 selfloop transitions, 1 changer transitions 18/420 dead transitions. [2025-03-15 00:54:09,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 420 transitions, 1210 flow [2025-03-15 00:54:09,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2025-03-15 00:54:09,471 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.936542669584245 [2025-03-15 00:54:09,473 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -9 predicate places. [2025-03-15 00:54:09,473 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 420 transitions, 1210 flow [2025-03-15 00:54:09,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 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:54:09,474 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:09,474 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, 1, 1, 1, 1, 1, 1] [2025-03-15 00:54:09,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:54:09,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:09,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:09,475 INFO L85 PathProgramCache]: Analyzing trace with hash -620626633, now seen corresponding path program 1 times [2025-03-15 00:54:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748226166] [2025-03-15 00:54:09,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:09,576 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:54:09,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:09,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748226166] [2025-03-15 00:54:09,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748226166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:09,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:09,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:09,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642660527] [2025-03-15 00:54:09,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:09,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:09,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:09,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:09,578 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 457 [2025-03-15 00:54:09,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 420 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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:54:09,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:09,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 457 [2025-03-15 00:54:09,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:10,288 INFO L124 PetriNetUnfolderBase]: 968/6534 cut-off events. [2025-03-15 00:54:10,288 INFO L125 PetriNetUnfolderBase]: For 7086/7438 co-relation queries the response was YES. [2025-03-15 00:54:10,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10767 conditions, 6534 events. 968/6534 cut-off events. For 7086/7438 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 59946 event pairs, 791 based on Foata normal form. 0/5637 useless extension candidates. Maximal degree in co-relation 9865. Up to 2040 conditions per place. [2025-03-15 00:54:10,310 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 19 selfloop transitions, 2 changer transitions 18/419 dead transitions. [2025-03-15 00:54:10,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 419 transitions, 1250 flow [2025-03-15 00:54:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-03-15 00:54:10,313 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9350838803792852 [2025-03-15 00:54:10,313 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -8 predicate places. [2025-03-15 00:54:10,313 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 419 transitions, 1250 flow [2025-03-15 00:54:10,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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:54:10,314 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:10,314 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, 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:54:10,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:54:10,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:10,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1740823065, now seen corresponding path program 1 times [2025-03-15 00:54:10,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224184072] [2025-03-15 00:54:10,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:10,361 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:54:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:10,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224184072] [2025-03-15 00:54:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224184072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:10,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:10,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:10,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405769354] [2025-03-15 00:54:10,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:10,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:10,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:10,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:10,363 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 457 [2025-03-15 00:54:10,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 419 transitions, 1250 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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:54:10,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:10,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 457 [2025-03-15 00:54:10,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:11,037 INFO L124 PetriNetUnfolderBase]: 975/6537 cut-off events. [2025-03-15 00:54:11,037 INFO L125 PetriNetUnfolderBase]: For 9461/9813 co-relation queries the response was YES. [2025-03-15 00:54:11,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11145 conditions, 6537 events. 975/6537 cut-off events. For 9461/9813 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 59942 event pairs, 796 based on Foata normal form. 0/5644 useless extension candidates. Maximal degree in co-relation 10103. Up to 2047 conditions per place. [2025-03-15 00:54:11,066 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 19 selfloop transitions, 2 changer transitions 18/419 dead transitions. [2025-03-15 00:54:11,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 419 transitions, 1309 flow [2025-03-15 00:54:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1288 transitions. [2025-03-15 00:54:11,069 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9394602479941648 [2025-03-15 00:54:11,070 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -7 predicate places. [2025-03-15 00:54:11,070 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 419 transitions, 1309 flow [2025-03-15 00:54:11,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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:54:11,071 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:11,071 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, 1, 1, 1, 1, 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:54:11,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:54:11,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:11,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1457823975, now seen corresponding path program 1 times [2025-03-15 00:54:11,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:11,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80284907] [2025-03-15 00:54:11,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:11,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:11,107 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:54:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80284907] [2025-03-15 00:54:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80284907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:11,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:11,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44881199] [2025-03-15 00:54:11,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:11,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:11,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:11,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:11,110 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 457 [2025-03-15 00:54:11,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 419 transitions, 1309 flow. Second operand has 3 states, 3 states have (on average 423.6666666666667) internal successors, (1271), 3 states have internal predecessors, (1271), 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:54:11,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:11,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 457 [2025-03-15 00:54:11,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:11,891 INFO L124 PetriNetUnfolderBase]: 988/6549 cut-off events. [2025-03-15 00:54:11,891 INFO L125 PetriNetUnfolderBase]: For 12724/13115 co-relation queries the response was YES. [2025-03-15 00:54:11,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11619 conditions, 6549 events. 988/6549 cut-off events. For 12724/13115 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 60067 event pairs, 801 based on Foata normal form. 0/5654 useless extension candidates. Maximal degree in co-relation 10513. Up to 2060 conditions per place. [2025-03-15 00:54:11,917 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 19 selfloop transitions, 2 changer transitions 18/419 dead transitions. [2025-03-15 00:54:11,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 419 transitions, 1372 flow [2025-03-15 00:54:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1288 transitions. [2025-03-15 00:54:11,920 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9394602479941648 [2025-03-15 00:54:11,920 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -6 predicate places. [2025-03-15 00:54:11,920 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 419 transitions, 1372 flow [2025-03-15 00:54:11,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.6666666666667) internal successors, (1271), 3 states have internal predecessors, (1271), 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:54:11,921 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:11,921 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, 1, 1, 1, 1, 1, 1, 1, 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:54:11,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:54:11,921 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:11,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash 328983218, now seen corresponding path program 1 times [2025-03-15 00:54:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:11,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008849125] [2025-03-15 00:54:11,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:11,953 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:54:11,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:11,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008849125] [2025-03-15 00:54:11,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008849125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:11,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:11,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:54:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653203681] [2025-03-15 00:54:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:11,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:11,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:11,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:11,955 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 457 [2025-03-15 00:54:11,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 419 transitions, 1372 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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:54:11,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:11,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 457 [2025-03-15 00:54:11,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:12,626 INFO L124 PetriNetUnfolderBase]: 995/6540 cut-off events. [2025-03-15 00:54:12,627 INFO L125 PetriNetUnfolderBase]: For 33801/35942 co-relation queries the response was YES. [2025-03-15 00:54:12,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11944 conditions, 6540 events. 995/6540 cut-off events. For 33801/35942 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 59787 event pairs, 806 based on Foata normal form. 78/5722 useless extension candidates. Maximal degree in co-relation 10669. Up to 2061 conditions per place. [2025-03-15 00:54:12,650 INFO L140 encePairwiseOnDemand]: 453/457 looper letters, 13 selfloop transitions, 3 changer transitions 18/421 dead transitions. [2025-03-15 00:54:12,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 421 transitions, 1429 flow [2025-03-15 00:54:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-03-15 00:54:12,653 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9540481400437637 [2025-03-15 00:54:12,653 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -4 predicate places. [2025-03-15 00:54:12,653 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 421 transitions, 1429 flow [2025-03-15 00:54:12,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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:54:12,654 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:12,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:54:12,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:12,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1259574056, now seen corresponding path program 1 times [2025-03-15 00:54:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439899341] [2025-03-15 00:54:12,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:12,689 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:54:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439899341] [2025-03-15 00:54:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439899341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894918624] [2025-03-15 00:54:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:12,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:12,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:12,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:12,691 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 457 [2025-03-15 00:54:12,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 421 transitions, 1429 flow. Second operand has 3 states, 3 states have (on average 425.6666666666667) internal successors, (1277), 3 states have internal predecessors, (1277), 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:54:12,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:12,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 457 [2025-03-15 00:54:12,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:13,338 INFO L124 PetriNetUnfolderBase]: 1037/6619 cut-off events. [2025-03-15 00:54:13,339 INFO L125 PetriNetUnfolderBase]: For 38470/40218 co-relation queries the response was YES. [2025-03-15 00:54:13,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12793 conditions, 6619 events. 1037/6619 cut-off events. For 38470/40218 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 60634 event pairs, 738 based on Foata normal form. 0/5773 useless extension candidates. Maximal degree in co-relation 11192. Up to 2043 conditions per place. [2025-03-15 00:54:13,360 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 22 selfloop transitions, 2 changer transitions 18/424 dead transitions. [2025-03-15 00:54:13,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 424 transitions, 1594 flow [2025-03-15 00:54:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-15 00:54:13,363 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9445660102115244 [2025-03-15 00:54:13,363 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, -6 predicate places. [2025-03-15 00:54:13,363 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 424 transitions, 1594 flow [2025-03-15 00:54:13,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.6666666666667) internal successors, (1277), 3 states have internal predecessors, (1277), 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:54:13,364 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:13,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:13,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:54:13,364 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:13,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1408744716, now seen corresponding path program 1 times [2025-03-15 00:54:13,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976913981] [2025-03-15 00:54:13,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:13,507 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:54:13,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:13,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976913981] [2025-03-15 00:54:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976913981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:13,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:13,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:54:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450677891] [2025-03-15 00:54:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:13,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:54:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:13,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:54:13,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:54:13,509 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 457 [2025-03-15 00:54:13,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 424 transitions, 1594 flow. Second operand has 8 states, 8 states have (on average 357.75) internal successors, (2862), 8 states have internal predecessors, (2862), 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:54:13,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:13,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 457 [2025-03-15 00:54:13,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:14,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 13#L65true, 446#true]) [2025-03-15 00:54:14,263 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-15 00:54:14,263 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:54:14,263 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-03-15 00:54:14,263 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:54:14,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 166#L65-1true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,287 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2025-03-15 00:54:14,288 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-15 00:54:14,288 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:54:14,288 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:54:14,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 151#L65-3true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,326 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2025-03-15 00:54:14,326 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:54:14,326 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-15 00:54:14,326 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:54:14,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 11#L65-4true, 446#true]) [2025-03-15 00:54:14,341 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-03-15 00:54:14,341 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-15 00:54:14,341 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:54:14,341 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:54:14,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, 49#L65-5true, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,354 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2025-03-15 00:54:14,354 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:54:14,354 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-15 00:54:14,354 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-15 00:54:14,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 270#L65-6true, 446#true]) [2025-03-15 00:54:14,367 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2025-03-15 00:54:14,367 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-15 00:54:14,367 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:54:14,367 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 00:54:14,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 8#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,382 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2025-03-15 00:54:14,382 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-15 00:54:14,382 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 00:54:14,382 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:54:14,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 136#L65-7true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,383 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2025-03-15 00:54:14,383 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:54:14,383 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-15 00:54:14,383 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 00:54:14,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 20#L65-8true, 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,398 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2025-03-15 00:54:14,398 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-15 00:54:14,398 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-15 00:54:14,398 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-15 00:54:14,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1143] L64-13-->L64-1: Formula: (= |v_#race~n1~0_10| 0) InVars {} OutVars{#race~n1~0=|v_#race~n1~0_10|} AuxVars[] AssignedVars[#race~n1~0][215], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 316#L50-1true, 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 363#L85-4true, 473#true, 455#true, 140#L64-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,399 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-15 00:54:14,399 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 00:54:14,400 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:54:14,400 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:54:14,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 226#L65-9true, 446#true]) [2025-03-15 00:54:14,414 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-03-15 00:54:14,414 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:54:14,414 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-15 00:54:14,414 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 00:54:14,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, 421#thread2Err7ASSERT_VIOLATIONDATA_RACEtrue, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,415 INFO L294 olderBase$Statistics]: this new event has 205 ancestors and is cut-off event [2025-03-15 00:54:14,415 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-15 00:54:14,415 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:54:14,415 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 00:54:14,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1143] L64-13-->L64-1: Formula: (= |v_#race~n1~0_10| 0) InVars {} OutVars{#race~n1~0=|v_#race~n1~0_10|} AuxVars[] AssignedVars[#race~n1~0][215], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 363#L85-4true, 473#true, 455#true, 140#L64-1true, 15#L50-2true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,416 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-03-15 00:54:14,416 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-15 00:54:14,416 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-15 00:54:14,416 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 00:54:14,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 9#L65-11true, 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,445 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2025-03-15 00:54:14,445 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-15 00:54:14,445 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-15 00:54:14,445 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-03-15 00:54:14,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 176#L65-12true, 446#true]) [2025-03-15 00:54:14,460 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2025-03-15 00:54:14,460 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:54:14,460 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-15 00:54:14,460 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 00:54:14,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 202#L65-13true, 446#true]) [2025-03-15 00:54:14,472 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2025-03-15 00:54:14,472 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-15 00:54:14,472 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 00:54:14,472 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-15 00:54:14,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, 128#L65-14true, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,484 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2025-03-15 00:54:14,484 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-03-15 00:54:14,484 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 00:54:14,484 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-15 00:54:14,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 289#thread2Err8ASSERT_VIOLATIONDATA_RACEtrue, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,497 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-03-15 00:54:14,497 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-03-15 00:54:14,497 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-15 00:54:14,497 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:54:14,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 101#L65-15true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,497 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2025-03-15 00:54:14,497 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:54:14,497 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-03-15 00:54:14,497 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-15 00:54:14,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [406#L66-1true, 451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,550 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2025-03-15 00:54:14,550 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-15 00:54:14,550 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-03-15 00:54:14,550 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-15 00:54:14,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, 431#thread2Err9ASSERT_VIOLATIONDATA_RACEtrue, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,565 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-03-15 00:54:14,565 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-15 00:54:14,565 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-03-15 00:54:14,565 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 00:54:14,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [424#L66-2true, 452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,565 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-03-15 00:54:14,565 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-15 00:54:14,565 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-03-15 00:54:14,565 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-15 00:54:14,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, 317#L66-4true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,588 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2025-03-15 00:54:14,588 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-03-15 00:54:14,588 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-15 00:54:14,588 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-15 00:54:14,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 159#L66-5true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,599 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-15 00:54:14,599 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-03-15 00:54:14,599 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-15 00:54:14,599 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-15 00:54:14,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 310#L66-6true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,609 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2025-03-15 00:54:14,609 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-03-15 00:54:14,609 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-15 00:54:14,609 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-15 00:54:14,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 374#L66-7true, 446#true]) [2025-03-15 00:54:14,619 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2025-03-15 00:54:14,619 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-15 00:54:14,619 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-03-15 00:54:14,619 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-15 00:54:14,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 61#thread2Err10ASSERT_VIOLATIONDATA_RACEtrue, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,630 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2025-03-15 00:54:14,630 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-15 00:54:14,630 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-03-15 00:54:14,630 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-15 00:54:14,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, 420#L66-8true, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,630 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2025-03-15 00:54:14,630 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-15 00:54:14,630 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-03-15 00:54:14,630 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-15 00:54:14,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 121#L66-9true, 446#true]) [2025-03-15 00:54:14,641 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is cut-off event [2025-03-15 00:54:14,641 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-03-15 00:54:14,641 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-15 00:54:14,641 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-15 00:54:14,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 434#L66-10true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,642 INFO L294 olderBase$Statistics]: this new event has 224 ancestors and is cut-off event [2025-03-15 00:54:14,642 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-15 00:54:14,642 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-15 00:54:14,642 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-15 00:54:14,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 267#L66-15true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,665 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 299#thread2Err12ASSERT_VIOLATIONDATA_RACEtrue, 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,665 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 268#L66-13true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,665 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 154#L66-12true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,665 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 400#L66-16true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,665 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-15 00:54:14,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 74#L66-14true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,666 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2025-03-15 00:54:14,666 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-03-15 00:54:14,666 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-15 00:54:14,666 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-15 00:54:14,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 359#L66-25true, 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,735 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2025-03-15 00:54:14,735 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-15 00:54:14,735 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-15 00:54:14,735 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 00:54:14,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true, 261#thread2Err13ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-15 00:54:14,738 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2025-03-15 00:54:14,738 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-15 00:54:14,738 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 00:54:14,738 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 00:54:14,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [336#L66-26true, 451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,739 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2025-03-15 00:54:14,739 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-15 00:54:14,739 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 00:54:14,739 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 00:54:14,766 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 434#L66-10true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,766 INFO L294 olderBase$Statistics]: this new event has 261 ancestors and is cut-off event [2025-03-15 00:54:14,766 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-15 00:54:14,766 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-15 00:54:14,766 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-15 00:54:14,766 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-15 00:54:14,768 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 268#L66-13true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,768 INFO L294 olderBase$Statistics]: this new event has 264 ancestors and is cut-off event [2025-03-15 00:54:14,768 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-15 00:54:14,768 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-15 00:54:14,768 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-15 00:54:14,768 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 74#L66-14true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,769 INFO L294 olderBase$Statistics]: this new event has 265 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 267#L66-15true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,769 INFO L294 olderBase$Statistics]: this new event has 266 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-15 00:54:14,769 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 299#thread2Err12ASSERT_VIOLATIONDATA_RACEtrue, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,770 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 261#thread2Err13ASSERT_VIOLATIONDATA_RACEtrue, 446#true]) [2025-03-15 00:54:14,770 INFO L294 olderBase$Statistics]: this new event has 293 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 00:54:14,770 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 359#L66-25true, 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,771 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [451#(= |#race~n1~0| 0), 336#L66-26true, 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,771 INFO L294 olderBase$Statistics]: this new event has 293 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][341], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 473#true, 455#true, 400#L66-16true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:14,771 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-15 00:54:14,771 INFO L124 PetriNetUnfolderBase]: 1405/8251 cut-off events. [2025-03-15 00:54:14,771 INFO L125 PetriNetUnfolderBase]: For 78535/90446 co-relation queries the response was YES. [2025-03-15 00:54:14,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19504 conditions, 8251 events. 1405/8251 cut-off events. For 78535/90446 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 77469 event pairs, 905 based on Foata normal form. 92/7296 useless extension candidates. Maximal degree in co-relation 13826. Up to 2432 conditions per place. [2025-03-15 00:54:14,814 INFO L140 encePairwiseOnDemand]: 441/457 looper letters, 137 selfloop transitions, 18 changer transitions 18/482 dead transitions. [2025-03-15 00:54:14,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 482 transitions, 2355 flow [2025-03-15 00:54:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 00:54:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 00:54:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4380 transitions. [2025-03-15 00:54:14,819 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7986870897155361 [2025-03-15 00:54:14,820 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 5 predicate places. [2025-03-15 00:54:14,820 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 482 transitions, 2355 flow [2025-03-15 00:54:14,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 357.75) internal successors, (2862), 8 states have internal predecessors, (2862), 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:54:14,821 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:14,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:14,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:54:14,822 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1283407895, now seen corresponding path program 1 times [2025-03-15 00:54:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:14,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604077557] [2025-03-15 00:54:14,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:14,855 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:54:14,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:14,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604077557] [2025-03-15 00:54:14,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604077557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:14,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:14,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:54:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356575832] [2025-03-15 00:54:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:14,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:14,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:14,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:14,857 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 457 [2025-03-15 00:54:14,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 482 transitions, 2355 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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:54:14,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:14,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 457 [2025-03-15 00:54:14,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:15,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, 431#thread2Err9ASSERT_VIOLATIONDATA_RACEtrue, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,639 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2025-03-15 00:54:15,639 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-15 00:54:15,639 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-15 00:54:15,639 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-03-15 00:54:15,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [424#L66-2true, 451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,639 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2025-03-15 00:54:15,639 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-15 00:54:15,639 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-15 00:54:15,639 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-03-15 00:54:15,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 374#L66-7true, 446#true]) [2025-03-15 00:54:15,646 INFO L294 olderBase$Statistics]: this new event has 261 ancestors and is cut-off event [2025-03-15 00:54:15,646 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-15 00:54:15,646 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-15 00:54:15,646 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-15 00:54:15,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, 61#thread2Err10ASSERT_VIOLATIONDATA_RACEtrue, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,647 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2025-03-15 00:54:15,647 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-15 00:54:15,647 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-15 00:54:15,647 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-15 00:54:15,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, 420#L66-8true, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,647 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2025-03-15 00:54:15,647 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2025-03-15 00:54:15,647 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-15 00:54:15,647 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2025-03-15 00:54:15,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [452#true, 451#(= |#race~n1~0| 0), 154#L66-12true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,650 INFO L294 olderBase$Statistics]: this new event has 266 ancestors and is cut-off event [2025-03-15 00:54:15,650 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-15 00:54:15,650 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-15 00:54:15,650 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2025-03-15 00:54:15,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [452#true, 451#(= |#race~n1~0| 0), 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 499#true, 473#true, 455#true, 268#L66-13true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,651 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2025-03-15 00:54:15,651 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-15 00:54:15,651 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 00:54:15,651 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-15 00:54:15,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 467#true, 266#L86-1true, 499#true, 473#true, 455#true, 74#L66-14true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,651 INFO L294 olderBase$Statistics]: this new event has 268 ancestors and is cut-off event [2025-03-15 00:54:15,651 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 00:54:15,651 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-15 00:54:15,651 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-03-15 00:54:15,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 267#L66-15true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,652 INFO L294 olderBase$Statistics]: this new event has 269 ancestors and is cut-off event [2025-03-15 00:54:15,652 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-15 00:54:15,652 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-15 00:54:15,652 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-15 00:54:15,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 299#thread2Err12ASSERT_VIOLATIONDATA_RACEtrue, 470#true, 478#(= |#race~a1~0| 0), 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,652 INFO L294 olderBase$Statistics]: this new event has 270 ancestors and is cut-off event [2025-03-15 00:54:15,652 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true, 261#thread2Err13ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-15 00:54:15,653 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, 400#L66-16true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,653 INFO L294 olderBase$Statistics]: this new event has 270 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2025-03-15 00:54:15,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 463#(= |#race~n2~0| 0), 359#L66-25true, 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,654 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2025-03-15 00:54:15,654 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-15 00:54:15,654 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-15 00:54:15,654 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-15 00:54:15,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1247] thread1EXIT-->L86-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][340], [451#(= |#race~n1~0| 0), 452#true, 336#L66-26true, 463#(= |#race~n2~0| 0), 478#(= |#race~a1~0| 0), 470#true, 479#true, 443#true, 266#L86-1true, 467#true, 499#true, 473#true, 455#true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 464#true, 446#true]) [2025-03-15 00:54:15,654 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-03-15 00:54:15,654 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-15 00:54:15,654 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2025-03-15 00:54:15,654 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 00:54:15,654 INFO L124 PetriNetUnfolderBase]: 1383/7988 cut-off events. [2025-03-15 00:54:15,654 INFO L125 PetriNetUnfolderBase]: For 73758/78782 co-relation queries the response was YES. [2025-03-15 00:54:15,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19674 conditions, 7988 events. 1383/7988 cut-off events. For 73758/78782 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 73702 event pairs, 933 based on Foata normal form. 2/6959 useless extension candidates. Maximal degree in co-relation 13600. Up to 2365 conditions per place. [2025-03-15 00:54:15,689 INFO L140 encePairwiseOnDemand]: 453/457 looper letters, 37 selfloop transitions, 3 changer transitions 18/487 dead transitions. [2025-03-15 00:54:15,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 487 transitions, 2553 flow [2025-03-15 00:54:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-03-15 00:54:15,691 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9540481400437637 [2025-03-15 00:54:15,691 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 7 predicate places. [2025-03-15 00:54:15,691 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 487 transitions, 2553 flow [2025-03-15 00:54:15,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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:54:15,692 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:15,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:15,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:54:15,692 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:15,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash 858137452, now seen corresponding path program 1 times [2025-03-15 00:54:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:15,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040794701] [2025-03-15 00:54:15,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:15,840 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:54:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:15,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040794701] [2025-03-15 00:54:15,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040794701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:15,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:54:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856499099] [2025-03-15 00:54:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:15,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:54:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:15,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:54:15,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:54:15,842 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 457 [2025-03-15 00:54:15,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 487 transitions, 2553 flow. Second operand has 8 states, 8 states have (on average 357.875) internal successors, (2863), 8 states have internal predecessors, (2863), 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:54:15,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:15,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 457 [2025-03-15 00:54:15,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:16,842 INFO L124 PetriNetUnfolderBase]: 1339/7045 cut-off events. [2025-03-15 00:54:16,842 INFO L125 PetriNetUnfolderBase]: For 36450/37362 co-relation queries the response was YES. [2025-03-15 00:54:16,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17998 conditions, 7045 events. 1339/7045 cut-off events. For 36450/37362 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 61965 event pairs, 994 based on Foata normal form. 0/6143 useless extension candidates. Maximal degree in co-relation 14357. Up to 2038 conditions per place. [2025-03-15 00:54:16,874 INFO L140 encePairwiseOnDemand]: 443/457 looper letters, 145 selfloop transitions, 17 changer transitions 18/494 dead transitions. [2025-03-15 00:54:16,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 494 transitions, 2880 flow [2025-03-15 00:54:16,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 00:54:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 00:54:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4023 transitions. [2025-03-15 00:54:16,878 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8002784961209469 [2025-03-15 00:54:16,879 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 17 predicate places. [2025-03-15 00:54:16,879 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 494 transitions, 2880 flow [2025-03-15 00:54:16,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 357.875) internal successors, (2863), 8 states have internal predecessors, (2863), 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:54:16,880 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:16,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:16,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:54:16,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:16,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash 508110287, now seen corresponding path program 1 times [2025-03-15 00:54:16,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:16,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450338310] [2025-03-15 00:54:16,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:16,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 00:54:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450338310] [2025-03-15 00:54:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450338310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:17,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:17,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:54:17,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296618776] [2025-03-15 00:54:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:17,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:54:17,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:17,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:54:17,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:54:17,010 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 457 [2025-03-15 00:54:17,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 494 transitions, 2880 flow. Second operand has 8 states, 8 states have (on average 358.875) internal successors, (2871), 8 states have internal predecessors, (2871), 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:54:17,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:17,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 457 [2025-03-15 00:54:17,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:18,240 INFO L124 PetriNetUnfolderBase]: 1811/8855 cut-off events. [2025-03-15 00:54:18,241 INFO L125 PetriNetUnfolderBase]: For 93781/101907 co-relation queries the response was YES. [2025-03-15 00:54:18,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26858 conditions, 8855 events. 1811/8855 cut-off events. For 93781/101907 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 80168 event pairs, 1280 based on Foata normal form. 50/7771 useless extension candidates. Maximal degree in co-relation 15431. Up to 2380 conditions per place. [2025-03-15 00:54:18,284 INFO L140 encePairwiseOnDemand]: 442/457 looper letters, 210 selfloop transitions, 29 changer transitions 18/575 dead transitions. [2025-03-15 00:54:18,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 575 transitions, 4571 flow [2025-03-15 00:54:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 00:54:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 00:54:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4005 transitions. [2025-03-15 00:54:18,289 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7966978317087726 [2025-03-15 00:54:18,290 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 27 predicate places. [2025-03-15 00:54:18,290 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 575 transitions, 4571 flow [2025-03-15 00:54:18,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 358.875) internal successors, (2871), 8 states have internal predecessors, (2871), 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:54:18,291 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:18,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:18,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:54:18,291 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:18,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash 271101423, now seen corresponding path program 1 times [2025-03-15 00:54:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:18,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53550070] [2025-03-15 00:54:18,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:18,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 00:54:18,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53550070] [2025-03-15 00:54:18,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53550070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:18,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:18,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:54:18,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764794313] [2025-03-15 00:54:18,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:18,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:54:18,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:18,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:54:18,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:54:18,415 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 457 [2025-03-15 00:54:18,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 575 transitions, 4571 flow. Second operand has 8 states, 8 states have (on average 359.0) internal successors, (2872), 8 states have internal predecessors, (2872), 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:54:18,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:18,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 457 [2025-03-15 00:54:18,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:19,445 INFO L124 PetriNetUnfolderBase]: 1624/7537 cut-off events. [2025-03-15 00:54:19,445 INFO L125 PetriNetUnfolderBase]: For 64645/69657 co-relation queries the response was YES. [2025-03-15 00:54:19,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24500 conditions, 7537 events. 1624/7537 cut-off events. For 64645/69657 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 64896 event pairs, 1187 based on Foata normal form. 7/6584 useless extension candidates. Maximal degree in co-relation 16355. Up to 2001 conditions per place. [2025-03-15 00:54:19,482 INFO L140 encePairwiseOnDemand]: 442/457 looper letters, 214 selfloop transitions, 31 changer transitions 18/594 dead transitions. [2025-03-15 00:54:19,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 594 transitions, 5162 flow [2025-03-15 00:54:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 00:54:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 00:54:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4005 transitions. [2025-03-15 00:54:19,486 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7966978317087726 [2025-03-15 00:54:19,487 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 37 predicate places. [2025-03-15 00:54:19,487 INFO L471 AbstractCegarLoop]: Abstraction has has 477 places, 594 transitions, 5162 flow [2025-03-15 00:54:19,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 359.0) internal successors, (2872), 8 states have internal predecessors, (2872), 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:54:19,488 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:19,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:19,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:54:19,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:19,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash 513335264, now seen corresponding path program 1 times [2025-03-15 00:54:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707576703] [2025-03-15 00:54:19,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:19,522 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:54:19,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:19,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707576703] [2025-03-15 00:54:19,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707576703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:19,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:19,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:19,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791612328] [2025-03-15 00:54:19,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:19,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:19,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:19,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:19,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:19,524 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 457 [2025-03-15 00:54:19,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 594 transitions, 5162 flow. Second operand has 3 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 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:54:19,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:19,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 457 [2025-03-15 00:54:19,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:20,396 INFO L124 PetriNetUnfolderBase]: 1625/7486 cut-off events. [2025-03-15 00:54:20,396 INFO L125 PetriNetUnfolderBase]: For 73566/78586 co-relation queries the response was YES. [2025-03-15 00:54:20,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24840 conditions, 7486 events. 1625/7486 cut-off events. For 73566/78586 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 64301 event pairs, 1200 based on Foata normal form. 2/6540 useless extension candidates. Maximal degree in co-relation 16582. Up to 2001 conditions per place. [2025-03-15 00:54:20,444 INFO L140 encePairwiseOnDemand]: 453/457 looper letters, 60 selfloop transitions, 1 changer transitions 18/591 dead transitions. [2025-03-15 00:54:20,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 591 transitions, 5272 flow [2025-03-15 00:54:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2025-03-15 00:54:20,447 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9409190371991247 [2025-03-15 00:54:20,447 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 36 predicate places. [2025-03-15 00:54:20,447 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 591 transitions, 5272 flow [2025-03-15 00:54:20,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 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:54:20,448 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:20,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:54:20,448 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1977927100, now seen corresponding path program 1 times [2025-03-15 00:54:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556626590] [2025-03-15 00:54:20,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:20,484 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:54:20,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:20,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556626590] [2025-03-15 00:54:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556626590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:20,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:20,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:20,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377350589] [2025-03-15 00:54:20,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:20,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:20,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:20,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:20,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:20,486 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 457 [2025-03-15 00:54:20,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 591 transitions, 5272 flow. Second operand has 3 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 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:54:20,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:20,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 457 [2025-03-15 00:54:20,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:21,590 INFO L124 PetriNetUnfolderBase]: 1639/7630 cut-off events. [2025-03-15 00:54:21,590 INFO L125 PetriNetUnfolderBase]: For 83012/88116 co-relation queries the response was YES. [2025-03-15 00:54:21,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25555 conditions, 7630 events. 1639/7630 cut-off events. For 83012/88116 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 66260 event pairs, 1174 based on Foata normal form. 2/6673 useless extension candidates. Maximal degree in co-relation 16825. Up to 2001 conditions per place. [2025-03-15 00:54:21,643 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 15 selfloop transitions, 0 changer transitions 206/590 dead transitions. [2025-03-15 00:54:21,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 590 transitions, 5394 flow [2025-03-15 00:54:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1292 transitions. [2025-03-15 00:54:21,645 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9423778264040846 [2025-03-15 00:54:21,645 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 35 predicate places. [2025-03-15 00:54:21,646 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 590 transitions, 5394 flow [2025-03-15 00:54:21,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 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:54:21,646 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:21,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:21,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:54:21,646 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:21,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:21,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1145882581, now seen corresponding path program 1 times [2025-03-15 00:54:21,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:21,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998259511] [2025-03-15 00:54:21,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:21,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:54:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:22,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998259511] [2025-03-15 00:54:22,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998259511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:22,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:54:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062377501] [2025-03-15 00:54:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:22,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:54:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:22,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:54:22,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:54:22,009 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 457 [2025-03-15 00:54:22,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 590 transitions, 5394 flow. Second operand has 6 states, 6 states have (on average 369.6666666666667) internal successors, (2218), 6 states have internal predecessors, (2218), 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:54:22,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:22,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 457 [2025-03-15 00:54:22,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:23,364 INFO L124 PetriNetUnfolderBase]: 1821/7432 cut-off events. [2025-03-15 00:54:23,364 INFO L125 PetriNetUnfolderBase]: For 96407/101154 co-relation queries the response was YES. [2025-03-15 00:54:23,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28882 conditions, 7432 events. 1821/7432 cut-off events. For 96407/101154 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 62251 event pairs, 708 based on Foata normal form. 2/6536 useless extension candidates. Maximal degree in co-relation 19716. Up to 2057 conditions per place. [2025-03-15 00:54:23,419 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 194 selfloop transitions, 5 changer transitions 208/700 dead transitions. [2025-03-15 00:54:23,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 700 transitions, 7050 flow [2025-03-15 00:54:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:54:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:54:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2381 transitions. [2025-03-15 00:54:23,422 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8683442742523705 [2025-03-15 00:54:23,422 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 38 predicate places. [2025-03-15 00:54:23,422 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 700 transitions, 7050 flow [2025-03-15 00:54:23,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 369.6666666666667) internal successors, (2218), 6 states have internal predecessors, (2218), 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:54:23,423 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:23,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:23,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:54:23,423 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:23,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:23,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1681567255, now seen corresponding path program 1 times [2025-03-15 00:54:23,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:23,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106370184] [2025-03-15 00:54:23,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:23,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:54:23,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106370184] [2025-03-15 00:54:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106370184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:23,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:23,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246493200] [2025-03-15 00:54:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:23,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:23,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:23,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:23,472 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 457 [2025-03-15 00:54:23,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 700 transitions, 7050 flow. Second operand has 3 states, 3 states have (on average 425.6666666666667) internal successors, (1277), 3 states have internal predecessors, (1277), 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:54:23,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:23,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 457 [2025-03-15 00:54:23,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:24,656 INFO L124 PetriNetUnfolderBase]: 1989/8308 cut-off events. [2025-03-15 00:54:24,656 INFO L125 PetriNetUnfolderBase]: For 113233/119991 co-relation queries the response was YES. [2025-03-15 00:54:24,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32519 conditions, 8308 events. 1989/8308 cut-off events. For 113233/119991 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 72419 event pairs, 1144 based on Foata normal form. 2/7431 useless extension candidates. Maximal degree in co-relation 22858. Up to 2363 conditions per place. [2025-03-15 00:54:24,707 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 32 selfloop transitions, 2 changer transitions 208/704 dead transitions. [2025-03-15 00:54:24,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 704 transitions, 7452 flow [2025-03-15 00:54:24,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2025-03-15 00:54:24,709 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9445660102115244 [2025-03-15 00:54:24,710 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 36 predicate places. [2025-03-15 00:54:24,710 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 704 transitions, 7452 flow [2025-03-15 00:54:24,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.6666666666667) internal successors, (1277), 3 states have internal predecessors, (1277), 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:54:24,710 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:24,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:24,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:54:24,710 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:24,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1456485237, now seen corresponding path program 1 times [2025-03-15 00:54:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127016595] [2025-03-15 00:54:24,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:54:24,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:24,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127016595] [2025-03-15 00:54:24,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127016595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:24,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:24,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:54:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097262735] [2025-03-15 00:54:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:24,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:54:24,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:24,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:54:24,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:54:24,978 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 457 [2025-03-15 00:54:24,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 704 transitions, 7452 flow. Second operand has 6 states, 6 states have (on average 369.8333333333333) internal successors, (2219), 6 states have internal predecessors, (2219), 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:54:24,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:24,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 457 [2025-03-15 00:54:24,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:26,592 INFO L124 PetriNetUnfolderBase]: 2055/8622 cut-off events. [2025-03-15 00:54:26,593 INFO L125 PetriNetUnfolderBase]: For 121222/129411 co-relation queries the response was YES. [2025-03-15 00:54:26,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36240 conditions, 8622 events. 2055/8622 cut-off events. For 121222/129411 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 74654 event pairs, 780 based on Foata normal form. 2/7822 useless extension candidates. Maximal degree in co-relation 25953. Up to 2344 conditions per place. [2025-03-15 00:54:26,660 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 283 selfloop transitions, 21 changer transitions 210/804 dead transitions. [2025-03-15 00:54:26,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 804 transitions, 9670 flow [2025-03-15 00:54:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:54:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:54:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2370 transitions. [2025-03-15 00:54:26,663 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8643326039387309 [2025-03-15 00:54:26,664 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 39 predicate places. [2025-03-15 00:54:26,664 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 804 transitions, 9670 flow [2025-03-15 00:54:26,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 369.8333333333333) internal successors, (2219), 6 states have internal predecessors, (2219), 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:54:26,664 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:26,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:26,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 00:54:26,665 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:26,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:26,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1971929989, now seen corresponding path program 1 times [2025-03-15 00:54:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:26,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751451674] [2025-03-15 00:54:26,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:54:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:26,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751451674] [2025-03-15 00:54:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751451674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:26,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:26,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:54:26,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180086409] [2025-03-15 00:54:26,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:26,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:54:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:26,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:54:26,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:54:26,937 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 457 [2025-03-15 00:54:26,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 804 transitions, 9670 flow. Second operand has 6 states, 6 states have (on average 370.6666666666667) internal successors, (2224), 6 states have internal predecessors, (2224), 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:54:26,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:26,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 457 [2025-03-15 00:54:26,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:28,401 INFO L124 PetriNetUnfolderBase]: 1971/8380 cut-off events. [2025-03-15 00:54:28,402 INFO L125 PetriNetUnfolderBase]: For 130228/138842 co-relation queries the response was YES. [2025-03-15 00:54:28,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37915 conditions, 8380 events. 1971/8380 cut-off events. For 130228/138842 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 72310 event pairs, 776 based on Foata normal form. 2/7661 useless extension candidates. Maximal degree in co-relation 27471. Up to 2222 conditions per place. [2025-03-15 00:54:28,466 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 364 selfloop transitions, 21 changer transitions 210/894 dead transitions. [2025-03-15 00:54:28,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 894 transitions, 11762 flow [2025-03-15 00:54:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:54:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:54:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2369 transitions. [2025-03-15 00:54:28,468 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8639679066374909 [2025-03-15 00:54:28,468 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 42 predicate places. [2025-03-15 00:54:28,468 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 894 transitions, 11762 flow [2025-03-15 00:54:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 370.6666666666667) internal successors, (2224), 6 states have internal predecessors, (2224), 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:54:28,469 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:28,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:28,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:54:28,469 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:28,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash -411029093, now seen corresponding path program 1 times [2025-03-15 00:54:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:28,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173815420] [2025-03-15 00:54:28,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:54:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173815420] [2025-03-15 00:54:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173815420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:28,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:54:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166200699] [2025-03-15 00:54:28,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:28,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:54:28,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:28,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:54:28,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:54:28,720 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 457 [2025-03-15 00:54:28,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 894 transitions, 11762 flow. Second operand has 6 states, 6 states have (on average 370.8333333333333) internal successors, (2225), 6 states have internal predecessors, (2225), 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:54:28,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:28,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 457 [2025-03-15 00:54:28,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:30,263 INFO L124 PetriNetUnfolderBase]: 1916/8256 cut-off events. [2025-03-15 00:54:30,263 INFO L125 PetriNetUnfolderBase]: For 137933/148543 co-relation queries the response was YES. [2025-03-15 00:54:30,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39618 conditions, 8256 events. 1916/8256 cut-off events. For 137933/148543 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 71007 event pairs, 694 based on Foata normal form. 18/7644 useless extension candidates. Maximal degree in co-relation 28721. Up to 2127 conditions per place. [2025-03-15 00:54:30,325 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 427 selfloop transitions, 37 changer transitions 210/972 dead transitions. [2025-03-15 00:54:30,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 972 transitions, 14166 flow [2025-03-15 00:54:30,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:54:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:54:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2358 transitions. [2025-03-15 00:54:30,327 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8599562363238512 [2025-03-15 00:54:30,327 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 45 predicate places. [2025-03-15 00:54:30,327 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 972 transitions, 14166 flow [2025-03-15 00:54:30,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 370.8333333333333) internal successors, (2225), 6 states have internal predecessors, (2225), 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:54:30,328 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:30,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:30,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 00:54:30,328 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:30,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:30,329 INFO L85 PathProgramCache]: Analyzing trace with hash -744090005, now seen corresponding path program 1 times [2025-03-15 00:54:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:30,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002417792] [2025-03-15 00:54:30,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:30,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:54:30,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002417792] [2025-03-15 00:54:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002417792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:30,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:30,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339992447] [2025-03-15 00:54:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:30,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:30,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:30,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:30,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:30,370 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 457 [2025-03-15 00:54:30,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 972 transitions, 14166 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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:54:30,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:30,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 457 [2025-03-15 00:54:30,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:31,851 INFO L124 PetriNetUnfolderBase]: 1912/8221 cut-off events. [2025-03-15 00:54:31,851 INFO L125 PetriNetUnfolderBase]: For 154789/163961 co-relation queries the response was YES. [2025-03-15 00:54:31,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40011 conditions, 8221 events. 1912/8221 cut-off events. For 154789/163961 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 70757 event pairs, 707 based on Foata normal form. 6/7606 useless extension candidates. Maximal degree in co-relation 28898. Up to 2104 conditions per place. [2025-03-15 00:54:31,910 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 51 selfloop transitions, 2 changer transitions 210/972 dead transitions. [2025-03-15 00:54:31,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 972 transitions, 14417 flow [2025-03-15 00:54:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2025-03-15 00:54:31,912 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.936542669584245 [2025-03-15 00:54:31,912 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 46 predicate places. [2025-03-15 00:54:31,912 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 972 transitions, 14417 flow [2025-03-15 00:54:31,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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:54:31,912 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:54:31,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:31,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 00:54:31,913 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-15 00:54:31,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:54:31,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1428330114, now seen corresponding path program 1 times [2025-03-15 00:54:31,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:54:31,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586184181] [2025-03-15 00:54:31,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:54:31,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:54:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:54:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:54:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:54:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586184181] [2025-03-15 00:54:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586184181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:54:31,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:54:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:54:31,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279440649] [2025-03-15 00:54:31,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:54:31,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:54:31,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:54:31,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:54:31,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:54:31,958 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 457 [2025-03-15 00:54:31,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 972 transitions, 14417 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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:54:31,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:54:31,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 457 [2025-03-15 00:54:31,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:54:33,340 INFO L124 PetriNetUnfolderBase]: 1921/8194 cut-off events. [2025-03-15 00:54:33,340 INFO L125 PetriNetUnfolderBase]: For 171765/180983 co-relation queries the response was YES. [2025-03-15 00:54:33,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40664 conditions, 8194 events. 1921/8194 cut-off events. For 171765/180983 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 70401 event pairs, 694 based on Foata normal form. 2/7619 useless extension candidates. Maximal degree in co-relation 29162. Up to 2130 conditions per place. [2025-03-15 00:54:33,375 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 0 selfloop transitions, 0 changer transitions 973/973 dead transitions. [2025-03-15 00:54:33,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 973 transitions, 14731 flow [2025-03-15 00:54:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:54:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:54:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2025-03-15 00:54:33,376 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.936542669584245 [2025-03-15 00:54:33,377 INFO L298 CegarLoopForPetriNet]: 440 programPoint places, 47 predicate places. [2025-03-15 00:54:33,377 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 973 transitions, 14731 flow [2025-03-15 00:54:33,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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:54:33,388 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-array-int-symm.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 00:54:33,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2025-03-15 00:54:33,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 72 remaining) [2025-03-15 00:54:33,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2025-03-15 00:54:33,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2025-03-15 00:54:33,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2025-03-15 00:54:33,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2025-03-15 00:54:33,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 00:54:33,468 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-15 00:54:33,472 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:54:33,472 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:54:33,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:54:33 BasicIcfg [2025-03-15 00:54:33,476 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:54:33,476 INFO L158 Benchmark]: Toolchain (without parser) took 29243.17ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 44.2MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-03-15 00:54:33,478 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 33.8MB in the beginning and 33.7MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:54:33,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.92ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 30.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 00:54:33,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.83ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 27.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:54:33,479 INFO L158 Benchmark]: Boogie Preprocessor took 33.87ms. Allocated memory is still 71.3MB. Free memory was 27.5MB in the beginning and 25.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:54:33,480 INFO L158 Benchmark]: RCFGBuilder took 616.17ms. Allocated memory is still 71.3MB. Free memory was 25.0MB in the beginning and 17.4MB in the end (delta: 7.6MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2025-03-15 00:54:33,480 INFO L158 Benchmark]: TraceAbstraction took 28310.08ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 16.5MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-03-15 00:54:33,481 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.15ms. Allocated memory is still 71.3MB. Free memory was 33.8MB in the beginning and 33.7MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.92ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 30.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.83ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 27.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.87ms. Allocated memory is still 71.3MB. Free memory was 27.5MB in the beginning and 25.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 616.17ms. Allocated memory is still 71.3MB. Free memory was 25.0MB in the beginning and 17.4MB in the end (delta: 7.6MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * TraceAbstraction took 28310.08ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 16.5MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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, 656 locations, 72 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.1s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 613 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 613 mSDsluCounter, 1677 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 977 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2697 IncrementalHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 700 mSDtfsCounter, 2697 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14731occurred in iteration=25, InterpolantAutomatonStates: 123, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 3156 NumberOfCodeBlocks, 3156 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3131 ConstructedInterpolants, 0 QuantifiedInterpolants, 4560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 16/16 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 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:54:33,494 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...