/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/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:59:28,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:59:28,214 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:59:28,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:59:28,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:59:28,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:59:28,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:59:28,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:59:28,273 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:59:28,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:59:28,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:59:28,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:59:28,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:59:28,275 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:59:28,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:59:28,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:28,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:59:28,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:59:28,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:59:28,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:59:28,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:59:28,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:59:28,275 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:59:28,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:59:28,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:59:28,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:59:28,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:59:28,510 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:59:28,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2025-03-15 00:59:29,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8eb6722c/a315eaa9a70845d39800d0f31caaeaaf/FLAG7a16f965e [2025-03-15 00:59:29,889 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:59:29,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2025-03-15 00:59:29,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8eb6722c/a315eaa9a70845d39800d0f31caaeaaf/FLAG7a16f965e [2025-03-15 00:59:29,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8eb6722c/a315eaa9a70845d39800d0f31caaeaaf [2025-03-15 00:59:29,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:59:29,918 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:59:29,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:29,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:59:29,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:59:29,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:29" (1/1) ... [2025-03-15 00:59:29,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0925e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:29, skipping insertion in model container [2025-03-15 00:59:29,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:29" (1/1) ... [2025-03-15 00:59:29,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:59:30,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:30,103 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:59:30,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:30,145 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:59:30,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30 WrapperNode [2025-03-15 00:59:30,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:30,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:30,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:59:30,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:59:30,150 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:59:30" (1/1) ... [2025-03-15 00:59:30,158 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:59:30" (1/1) ... [2025-03-15 00:59:30,183 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 137 [2025-03-15 00:59:30,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:30,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:59:30,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:59:30,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:59:30,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:59:30,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:59:30,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:59:30,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:59:30,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (1/1) ... [2025-03-15 00:59:30,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:30,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:59:30,253 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:59:30,255 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:59:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:59:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:59:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:59:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:59:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:59:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 00:59:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 00:59:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:59:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:59:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:59:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:59:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:59:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:59:30,276 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:59:30,367 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:59:30,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:59:30,782 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:59:30,782 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:59:30,792 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:59:30,792 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:59:30,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:30 BoogieIcfgContainer [2025-03-15 00:59:30,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:59:30,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:59:30,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:59:30,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:59:30,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:59:29" (1/3) ... [2025-03-15 00:59:30,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153a1d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:30, skipping insertion in model container [2025-03-15 00:59:30,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:30" (2/3) ... [2025-03-15 00:59:30,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153a1d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:30, skipping insertion in model container [2025-03-15 00:59:30,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:30" (3/3) ... [2025-03-15 00:59:30,803 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-03-15 00:59:30,815 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:59:30,816 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 257 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-15 00:59:30,816 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:59:30,895 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 00:59:30,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:59:30,952 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;@7884a818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:59:30,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-15 00:59:30,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:59:30,995 INFO L124 PetriNetUnfolderBase]: 3/92 cut-off events. [2025-03-15 00:59:30,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:59:30,997 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:30,998 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] [2025-03-15 00:59:30,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:31,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash -58529011, now seen corresponding path program 1 times [2025-03-15 00:59:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634464226] [2025-03-15 00:59:31,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:31,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:31,202 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:59:31,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:31,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634464226] [2025-03-15 00:59:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634464226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:31,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:31,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094679076] [2025-03-15 00:59:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:31,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:31,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:31,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:31,235 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 267 [2025-03-15 00:59:31,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 267 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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:59:31,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:31,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 267 [2025-03-15 00:59:31,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:31,606 INFO L124 PetriNetUnfolderBase]: 379/1788 cut-off events. [2025-03-15 00:59:31,606 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-15 00:59:31,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 1788 events. 379/1788 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12520 event pairs, 279 based on Foata normal form. 6/1450 useless extension candidates. Maximal degree in co-relation 2348. Up to 563 conditions per place. [2025-03-15 00:59:31,634 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 28 selfloop transitions, 2 changer transitions 14/251 dead transitions. [2025-03-15 00:59:31,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 251 transitions, 584 flow [2025-03-15 00:59:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2025-03-15 00:59:31,649 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.898876404494382 [2025-03-15 00:59:31,653 INFO L298 CegarLoopForPetriNet]: 266 programPoint places, -9 predicate places. [2025-03-15 00:59:31,654 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 584 flow [2025-03-15 00:59:31,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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:59:31,654 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:31,656 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] [2025-03-15 00:59:31,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:59:31,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:31,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:31,657 INFO L85 PathProgramCache]: Analyzing trace with hash -809515148, now seen corresponding path program 1 times [2025-03-15 00:59:31,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:31,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234323047] [2025-03-15 00:59:31,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:31,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:32,337 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:59:32,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:32,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234323047] [2025-03-15 00:59:32,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234323047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:32,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:32,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:32,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083577280] [2025-03-15 00:59:32,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:32,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:59:32,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:32,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:59:32,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:59:32,344 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 267 [2025-03-15 00:59:32,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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:59:32,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:32,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 267 [2025-03-15 00:59:32,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:33,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][168], [thread1Thread1of1ForFork0InUse, 3#L51-1true, thread2Thread1of1ForFork1InUse, 269#true, 19#$Ultimate##0true, thread3Thread1of1ForFork2InUse, 272#true, 222#thread2Err4ASSERT_VIOLATIONDATA_RACEtrue, 167#L95-4true]) [2025-03-15 00:59:33,138 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-03-15 00:59:33,138 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:59:33,138 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:59:33,138 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-03-15 00:59:33,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][168], [thread1Thread1of1ForFork0InUse, 3#L51-1true, 269#true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 216#L65-2true, 272#true, 167#L95-4true]) [2025-03-15 00:59:33,141 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-03-15 00:59:33,141 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:59:33,141 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:59:33,141 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-03-15 00:59:33,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][205], [thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 269#true, thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 272#true, 222#thread2Err4ASSERT_VIOLATIONDATA_RACEtrue, 197#L96-1true]) [2025-03-15 00:59:33,148 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:59:33,148 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-15 00:59:33,148 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:59:33,148 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-15 00:59:33,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][205], [thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 269#true, thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 216#L65-2true, 272#true, 197#L96-1true]) [2025-03-15 00:59:33,150 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:59:33,150 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-15 00:59:33,150 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:59:33,150 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-15 00:59:33,155 INFO L124 PetriNetUnfolderBase]: 1926/5104 cut-off events. [2025-03-15 00:59:33,156 INFO L125 PetriNetUnfolderBase]: For 2905/2954 co-relation queries the response was YES. [2025-03-15 00:59:33,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11120 conditions, 5104 events. 1926/5104 cut-off events. For 2905/2954 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 44140 event pairs, 1688 based on Foata normal form. 0/4290 useless extension candidates. Maximal degree in co-relation 10718. Up to 2767 conditions per place. [2025-03-15 00:59:33,207 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 59 selfloop transitions, 5 changer transitions 14/250 dead transitions. [2025-03-15 00:59:33,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 250 transitions, 714 flow [2025-03-15 00:59:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1231 transitions. [2025-03-15 00:59:33,212 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.768414481897628 [2025-03-15 00:59:33,213 INFO L298 CegarLoopForPetriNet]: 266 programPoint places, -5 predicate places. [2025-03-15 00:59:33,213 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 250 transitions, 714 flow [2025-03-15 00:59:33,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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:59:33,214 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:33,217 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] [2025-03-15 00:59:33,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:59:33,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:33,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash 94947827, now seen corresponding path program 1 times [2025-03-15 00:59:33,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:33,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430462116] [2025-03-15 00:59:33,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:33,275 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:59:33,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430462116] [2025-03-15 00:59:33,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430462116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:33,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:33,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955240934] [2025-03-15 00:59:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:33,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:33,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:33,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:33,278 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 267 [2025-03-15 00:59:33,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 250 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:59:33,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:33,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 267 [2025-03-15 00:59:33,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:33,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][170], [thread1Thread1of1ForFork0InUse, 3#L51-1true, thread2Thread1of1ForFork1InUse, 269#true, 19#$Ultimate##0true, thread3Thread1of1ForFork2InUse, 280#(= |#race~A~0| 0), 228#L59-2true, 272#true, 167#L95-4true]) [2025-03-15 00:59:33,585 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2025-03-15 00:59:33,586 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-15 00:59:33,587 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-15 00:59:33,587 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-15 00:59:33,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][208], [thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 269#true, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 228#L59-2true, 272#true, 197#L96-1true]) [2025-03-15 00:59:33,615 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2025-03-15 00:59:33,615 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-15 00:59:33,616 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-15 00:59:33,616 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-15 00:59:33,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][170], [thread1Thread1of1ForFork0InUse, 3#L51-1true, thread2Thread1of1ForFork1InUse, 269#true, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 272#true, 216#L65-2true, 167#L95-4true]) [2025-03-15 00:59:33,809 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-03-15 00:59:33,809 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:59:33,809 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-03-15 00:59:33,809 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:59:33,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][208], [thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 269#true, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 216#L65-2true, 272#true, 197#L96-1true]) [2025-03-15 00:59:33,813 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:59:33,813 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-15 00:59:33,813 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-15 00:59:33,813 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:59:33,816 INFO L124 PetriNetUnfolderBase]: 1646/4371 cut-off events. [2025-03-15 00:59:33,817 INFO L125 PetriNetUnfolderBase]: For 4461/4711 co-relation queries the response was YES. [2025-03-15 00:59:33,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10417 conditions, 4371 events. 1646/4371 cut-off events. For 4461/4711 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 35791 event pairs, 771 based on Foata normal form. 0/3822 useless extension candidates. Maximal degree in co-relation 9936. Up to 2473 conditions per place. [2025-03-15 00:59:33,849 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 22 selfloop transitions, 3 changer transitions 14/248 dead transitions. [2025-03-15 00:59:33,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 248 transitions, 775 flow [2025-03-15 00:59:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2025-03-15 00:59:33,851 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9076154806491885 [2025-03-15 00:59:33,851 INFO L298 CegarLoopForPetriNet]: 266 programPoint places, -10 predicate places. [2025-03-15 00:59:33,852 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 248 transitions, 775 flow [2025-03-15 00:59:33,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 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:59:33,852 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:33,852 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] [2025-03-15 00:59:33,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:59:33,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:33,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:33,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1808052931, now seen corresponding path program 1 times [2025-03-15 00:59:33,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:33,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65102940] [2025-03-15 00:59:33,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:33,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:34,281 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:59:34,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:34,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65102940] [2025-03-15 00:59:34,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65102940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:34,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:34,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317496207] [2025-03-15 00:59:34,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:34,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:59:34,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:34,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:59:34,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:59:34,285 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 267 [2025-03-15 00:59:34,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 248 transitions, 775 flow. Second operand has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 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:59:34,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:34,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 267 [2025-03-15 00:59:34,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:34,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([642] L64-->L64-1: Formula: (= |v_#race~A~0_10| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_10|} AuxVars[] AssignedVars[#race~A~0][222], [179#L64-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 272#true, 167#L95-4true, 209#L51-2true]) [2025-03-15 00:59:34,834 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2025-03-15 00:59:34,834 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-15 00:59:34,834 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-15 00:59:34,834 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-15 00:59:34,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [179#L64-1true, thread1Thread1of1ForFork0InUse, 3#L51-1true, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 272#true, 10#L94-4true]) [2025-03-15 00:59:34,858 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2025-03-15 00:59:34,858 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:59:34,858 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-15 00:59:34,858 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:59:34,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [thread1Thread1of1ForFork0InUse, 160#L64-2true, 3#L51-1true, 269#true, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 272#true, 10#L94-4true]) [2025-03-15 00:59:34,870 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-03-15 00:59:34,870 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-15 00:59:34,870 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:59:34,870 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-03-15 00:59:34,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [179#L64-1true, thread1Thread1of1ForFork0InUse, 3#L51-1true, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 272#true, 167#L95-4true]) [2025-03-15 00:59:34,912 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-03-15 00:59:34,912 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:59:34,912 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-15 00:59:34,912 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:59:34,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [thread1Thread1of1ForFork0InUse, 160#L64-2true, 3#L51-1true, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 272#true, 167#L95-4true]) [2025-03-15 00:59:34,921 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2025-03-15 00:59:34,921 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:59:34,921 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:59:34,921 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-15 00:59:34,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([642] L64-->L64-1: Formula: (= |v_#race~A~0_10| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_10|} AuxVars[] AssignedVars[#race~A~0][222], [179#L64-1true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 272#true, 95#L52-2true, 167#L95-4true]) [2025-03-15 00:59:34,933 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2025-03-15 00:59:34,933 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-03-15 00:59:34,934 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:59:34,934 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-03-15 00:59:34,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][250], [179#L64-1true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), 272#true, 197#L96-1true]) [2025-03-15 00:59:34,937 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-15 00:59:34,937 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:59:34,937 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:59:34,937 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:59:34,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][250], [thread1Thread1of1ForFork0NotInUse, 160#L64-2true, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), 272#true, 197#L96-1true]) [2025-03-15 00:59:34,943 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-03-15 00:59:34,943 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:59:34,943 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:59:34,943 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:59:34,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [thread1Thread1of1ForFork0InUse, 3#L51-1true, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 215#L65-1true, 272#true, 167#L95-4true]) [2025-03-15 00:59:34,974 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2025-03-15 00:59:34,974 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2025-03-15 00:59:34,974 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:59:34,974 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:59:34,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [thread1Thread1of1ForFork0InUse, 3#L51-1true, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 216#L65-2true, 272#true, 167#L95-4true]) [2025-03-15 00:59:34,974 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-03-15 00:59:34,974 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-03-15 00:59:34,974 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:59:34,974 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:59:34,977 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([594] L51-->L51-1: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][184], [thread1Thread1of1ForFork0InUse, 3#L51-1true, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, 280#(= |#race~A~0| 0), 19#$Ultimate##0true, thread3Thread1of1ForFork2InUse, 272#true, 216#L65-2true, 167#L95-4true]) [2025-03-15 00:59:34,977 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-03-15 00:59:34,977 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-03-15 00:59:34,977 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:59:34,977 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:59:34,977 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:59:34,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][250], [thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 19#$Ultimate##0true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 215#L65-1true, 272#true, 197#L96-1true]) [2025-03-15 00:59:34,980 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2025-03-15 00:59:34,980 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-15 00:59:34,980 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-03-15 00:59:34,980 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:59:34,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][250], [thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, 19#$Ultimate##0true, thread3Thread1of1ForFork2InUse, 280#(= |#race~A~0| 0), 216#L65-2true, 272#true, 197#L96-1true]) [2025-03-15 00:59:34,980 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:59:34,980 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:59:34,981 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-15 00:59:34,982 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-15 00:59:34,983 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([682] thread1EXIT-->L96-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[][250], [thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 272#true, 216#L65-2true, 197#L96-1true]) [2025-03-15 00:59:34,983 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:59:34,983 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:59:34,983 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-15 00:59:34,983 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-15 00:59:34,983 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-15 00:59:34,987 INFO L124 PetriNetUnfolderBase]: 2067/5088 cut-off events. [2025-03-15 00:59:34,988 INFO L125 PetriNetUnfolderBase]: For 6789/7494 co-relation queries the response was YES. [2025-03-15 00:59:35,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15371 conditions, 5088 events. 2067/5088 cut-off events. For 6789/7494 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 41522 event pairs, 690 based on Foata normal form. 2/4554 useless extension candidates. Maximal degree in co-relation 13912. Up to 2916 conditions per place. [2025-03-15 00:59:35,031 INFO L140 encePairwiseOnDemand]: 252/267 looper letters, 84 selfloop transitions, 12 changer transitions 14/281 dead transitions. [2025-03-15 00:59:35,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 281 transitions, 1143 flow [2025-03-15 00:59:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1287 transitions. [2025-03-15 00:59:35,034 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8033707865168539 [2025-03-15 00:59:35,035 INFO L298 CegarLoopForPetriNet]: 266 programPoint places, -8 predicate places. [2025-03-15 00:59:35,036 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 281 transitions, 1143 flow [2025-03-15 00:59:35,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.33333333333334) internal successors, (1196), 6 states have internal predecessors, (1196), 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:59:35,036 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:35,036 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] [2025-03-15 00:59:35,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:59:35,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:35,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:35,038 INFO L85 PathProgramCache]: Analyzing trace with hash 343938334, now seen corresponding path program 1 times [2025-03-15 00:59:35,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:35,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135050230] [2025-03-15 00:59:35,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:35,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:35,214 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:59:35,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:35,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135050230] [2025-03-15 00:59:35,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135050230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:35,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:35,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 00:59:35,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086856495] [2025-03-15 00:59:35,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:35,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 00:59:35,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:35,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 00:59:35,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 00:59:35,217 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 267 [2025-03-15 00:59:35,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 281 transitions, 1143 flow. Second operand has 7 states, 7 states have (on average 212.28571428571428) internal successors, (1486), 7 states have internal predecessors, (1486), 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:59:35,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:35,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 267 [2025-03-15 00:59:35,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:36,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][302], [201#L65-3true, thread1Thread1of1ForFork0NotInUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 280#(= |#race~A~0| 0), 19#$Ultimate##0true, 272#true, 197#L96-1true, 287#true]) [2025-03-15 00:59:36,094 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:59:36,094 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:59:36,094 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:59:36,094 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:59:36,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][302], [thread1Thread1of1ForFork0NotInUse, 269#true, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 13#L65-4true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 272#true, 197#L96-1true, 287#true]) [2025-03-15 00:59:36,106 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2025-03-15 00:59:36,106 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:59:36,106 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:59:36,106 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:59:36,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][302], [57#L65-5true, thread1Thread1of1ForFork0NotInUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread2Thread1of1ForFork1InUse, 269#true, thread3Thread1of1ForFork2InUse, 280#(= |#race~A~0| 0), 19#$Ultimate##0true, 272#true, 197#L96-1true, 287#true]) [2025-03-15 00:59:36,118 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-03-15 00:59:36,118 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:59:36,118 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:59:36,118 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-15 00:59:36,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][302], [thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread3Thread1of1ForFork2InUse, 71#L65-6true, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), 272#true, 197#L96-1true, 287#true]) [2025-03-15 00:59:36,130 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-03-15 00:59:36,130 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:59:36,130 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:59:36,130 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:59:36,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][302], [thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, thread3Thread1of1ForFork2InUse, 280#(= |#race~A~0| 0), 19#$Ultimate##0true, 173#L65-7true, 272#true, 197#L96-1true, 287#true]) [2025-03-15 00:59:36,139 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-15 00:59:36,139 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:59:36,139 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:59:36,139 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:59:36,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][302], [thread1Thread1of1ForFork0NotInUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 280#(= |#race~A~0| 0), 239#thread2Err5ASSERT_VIOLATIONDATA_RACEtrue, 272#true, 197#L96-1true, 287#true]) [2025-03-15 00:59:36,147 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,147 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,147 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,147 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] thread1EXIT-->L96-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[][302], [34#L65-8true, thread1Thread1of1ForFork0NotInUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread3Thread1of1ForFork2InUse, 280#(= |#race~A~0| 0), 19#$Ultimate##0true, 272#true, 197#L96-1true, 287#true]) [2025-03-15 00:59:36,147 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,147 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,147 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,147 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([639] L63-3-->L63-4: Formula: (<= v_~N~0_4 v_thread2Thread1of1ForFork1_~i~1_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][280], [thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, 53#L55true, 148#L63-4true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 272#true, 167#L95-4true, 287#true]) [2025-03-15 00:59:36,152 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,152 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:59:36,152 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:59:36,152 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:59:36,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L63-3-->L64: Formula: (< v_thread2Thread1of1ForFork1_~i~1_5 v_~N~0_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][281], [thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 269#true, 53#L55true, 280#(= |#race~A~0| 0), thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 118#L64true, 272#true, 167#L95-4true, 287#true]) [2025-03-15 00:59:36,152 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:59:36,152 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:59:36,152 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:59:36,152 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:59:36,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([639] L63-3-->L63-4: Formula: (<= v_~N~0_4 v_thread2Thread1of1ForFork1_~i~1_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][280], [thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 148#L63-4true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 184#L50-4true, 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:36,207 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-15 00:59:36,207 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:59:36,207 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:59:36,207 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:59:36,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L63-3-->L64: Formula: (< v_thread2Thread1of1ForFork1_~i~1_5 v_~N~0_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][281], [thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 184#L50-4true, 118#L64true, 272#true, 10#L94-4true, 287#true]) [2025-03-15 00:59:36,207 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-15 00:59:36,207 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:59:36,207 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:59:36,207 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:59:36,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([639] L63-3-->L63-4: Formula: (<= v_~N~0_4 v_thread2Thread1of1ForFork1_~i~1_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][280], [139#L51true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 148#L63-4true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 272#true, 10#L94-4true, 287#true]) [2025-03-15 00:59:36,207 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-15 00:59:36,207 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:59:36,208 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:59:36,208 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:59:36,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L63-3-->L64: Formula: (< v_thread2Thread1of1ForFork1_~i~1_5 v_~N~0_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][281], [139#L51true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 118#L64true, 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:36,208 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-15 00:59:36,208 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:59:36,208 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:59:36,208 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-15 00:59:36,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([639] L63-3-->L63-4: Formula: (<= v_~N~0_4 v_thread2Thread1of1ForFork1_~i~1_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][280], [thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 148#L63-4true, thread3Thread1of1ForFork2NotInUse, 53#L55true, 280#(= |#race~A~0| 0), 272#true, 10#L94-4true, 287#true]) [2025-03-15 00:59:36,209 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-03-15 00:59:36,209 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:59:36,209 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-15 00:59:36,209 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:59:36,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L63-3-->L64: Formula: (< v_thread2Thread1of1ForFork1_~i~1_5 v_~N~0_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][281], [thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 269#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread3Thread1of1ForFork2NotInUse, 53#L55true, 280#(= |#race~A~0| 0), 118#L64true, 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:36,209 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-03-15 00:59:36,209 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:59:36,209 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-15 00:59:36,209 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:59:36,210 INFO L124 PetriNetUnfolderBase]: 3443/7939 cut-off events. [2025-03-15 00:59:36,210 INFO L125 PetriNetUnfolderBase]: For 21149/22658 co-relation queries the response was YES. [2025-03-15 00:59:36,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28164 conditions, 7939 events. 3443/7939 cut-off events. For 21149/22658 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 68661 event pairs, 1114 based on Foata normal form. 11/6979 useless extension candidates. Maximal degree in co-relation 18915. Up to 4490 conditions per place. [2025-03-15 00:59:36,272 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 82 selfloop transitions, 14 changer transitions 17/320 dead transitions. [2025-03-15 00:59:36,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 320 transitions, 1666 flow [2025-03-15 00:59:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:59:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:59:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2170 transitions. [2025-03-15 00:59:36,276 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8127340823970037 [2025-03-15 00:59:36,277 INFO L298 CegarLoopForPetriNet]: 266 programPoint places, 1 predicate places. [2025-03-15 00:59:36,277 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 320 transitions, 1666 flow [2025-03-15 00:59:36,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.28571428571428) internal successors, (1486), 7 states have internal predecessors, (1486), 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:59:36,277 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:36,278 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] [2025-03-15 00:59:36,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:59:36,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:36,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash 622029483, now seen corresponding path program 1 times [2025-03-15 00:59:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:36,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050629904] [2025-03-15 00:59:36,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:36,388 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:59:36,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050629904] [2025-03-15 00:59:36,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050629904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:36,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:36,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 00:59:36,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212407962] [2025-03-15 00:59:36,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:36,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 00:59:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:36,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 00:59:36,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 00:59:36,390 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 267 [2025-03-15 00:59:36,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 320 transitions, 1666 flow. Second operand has 7 states, 7 states have (on average 212.42857142857142) internal successors, (1487), 7 states have internal predecessors, (1487), 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:59:36,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:36,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 267 [2025-03-15 00:59:36,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:37,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L50-3-->L50-4: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork0_~i~0_3) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][248], [8#L63-1true, thread1Thread1of1ForFork0InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 304#true, thread2Thread1of1ForFork1InUse, 269#true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 184#L50-4true, 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:37,369 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-15 00:59:37,369 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:59:37,369 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 00:59:37,369 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:59:37,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([592] L50-3-->L51: Formula: (< v_thread1Thread1of1ForFork0_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][249], [139#L51true, 8#L63-1true, thread1Thread1of1ForFork0InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 304#true, thread2Thread1of1ForFork1InUse, 269#true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:37,370 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-15 00:59:37,370 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:59:37,370 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:59:37,370 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 00:59:37,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L50-3-->L50-4: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork0_~i~0_3) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][248], [thread1Thread1of1ForFork0InUse, 41#L63-2true, 304#true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread2Thread1of1ForFork1InUse, 269#true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 184#L50-4true, 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:37,372 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-15 00:59:37,372 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 00:59:37,372 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:59:37,372 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:59:37,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([592] L50-3-->L51: Formula: (< v_thread1Thread1of1ForFork0_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][249], [139#L51true, thread1Thread1of1ForFork0InUse, 41#L63-2true, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread2Thread1of1ForFork1InUse, 304#true, 269#true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:37,372 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-15 00:59:37,372 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 00:59:37,372 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:59:37,372 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([639] L63-3-->L63-4: Formula: (<= v_~N~0_4 v_thread2Thread1of1ForFork1_~i~1_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][261], [20#L50-2true, thread1Thread1of1ForFork0InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread2Thread1of1ForFork1InUse, 304#true, 269#true, 148#L63-4true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:37,374 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L63-3-->L64: Formula: (< v_thread2Thread1of1ForFork1_~i~1_5 v_~N~0_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][262], [20#L50-2true, thread1Thread1of1ForFork0InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 304#true, thread2Thread1of1ForFork1InUse, 269#true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 118#L64true, 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:37,374 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([639] L63-3-->L63-4: Formula: (<= v_~N~0_4 v_thread2Thread1of1ForFork1_~i~1_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][261], [thread1Thread1of1ForFork0InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 304#true, thread2Thread1of1ForFork1InUse, 123#L50-1true, 269#true, 148#L63-4true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:37,374 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-15 00:59:37,374 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:59:37,375 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:59:37,375 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 00:59:37,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L63-3-->L64: Formula: (< v_thread2Thread1of1ForFork1_~i~1_5 v_~N~0_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][262], [thread1Thread1of1ForFork0InUse, 286#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), thread2Thread1of1ForFork1InUse, 123#L50-1true, 304#true, 269#true, thread3Thread1of1ForFork2NotInUse, 280#(= |#race~A~0| 0), 118#L64true, 272#true, 287#true, 10#L94-4true]) [2025-03-15 00:59:37,375 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-15 00:59:37,375 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:59:37,375 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:59:37,375 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 00:59:37,376 INFO L124 PetriNetUnfolderBase]: 3275/7268 cut-off events. [2025-03-15 00:59:37,376 INFO L125 PetriNetUnfolderBase]: For 26435/27816 co-relation queries the response was YES. [2025-03-15 00:59:37,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29041 conditions, 7268 events. 3275/7268 cut-off events. For 26435/27816 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 60530 event pairs, 1138 based on Foata normal form. 0/6296 useless extension candidates. Maximal degree in co-relation 22905. Up to 4019 conditions per place. [2025-03-15 00:59:37,437 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 61 selfloop transitions, 8 changer transitions 48/324 dead transitions. [2025-03-15 00:59:37,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 324 transitions, 1917 flow [2025-03-15 00:59:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 00:59:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 00:59:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2168 transitions. [2025-03-15 00:59:37,441 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8119850187265918 [2025-03-15 00:59:37,442 INFO L298 CegarLoopForPetriNet]: 266 programPoint places, 10 predicate places. [2025-03-15 00:59:37,442 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 324 transitions, 1917 flow [2025-03-15 00:59:37,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.42857142857142) internal successors, (1487), 7 states have internal predecessors, (1487), 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:59:37,443 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:37,443 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] [2025-03-15 00:59:37,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:59:37,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:37,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1781037987, now seen corresponding path program 1 times [2025-03-15 00:59:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620882891] [2025-03-15 00:59:37,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:37,811 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:59:37,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620882891] [2025-03-15 00:59:37,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620882891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:37,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783876243] [2025-03-15 00:59:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:37,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:59:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:37,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:59:37,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:59:37,812 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-03-15 00:59:37,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 324 transitions, 1917 flow. Second operand has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 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:59:37,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:37,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-03-15 00:59:37,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:38,883 INFO L124 PetriNetUnfolderBase]: 3017/6859 cut-off events. [2025-03-15 00:59:38,883 INFO L125 PetriNetUnfolderBase]: For 27242/29106 co-relation queries the response was YES. [2025-03-15 00:59:38,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31359 conditions, 6859 events. 3017/6859 cut-off events. For 27242/29106 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 58060 event pairs, 701 based on Foata normal form. 0/6293 useless extension candidates. Maximal degree in co-relation 24342. Up to 3814 conditions per place. [2025-03-15 00:59:38,943 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 188 selfloop transitions, 5 changer transitions 48/410 dead transitions. [2025-03-15 00:59:38,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 410 transitions, 3047 flow [2025-03-15 00:59:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1305 transitions. [2025-03-15 00:59:38,947 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8146067415730337 [2025-03-15 00:59:38,948 INFO L298 CegarLoopForPetriNet]: 266 programPoint places, 13 predicate places. [2025-03-15 00:59:38,948 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 410 transitions, 3047 flow [2025-03-15 00:59:38,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 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:59:38,949 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:38,949 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] [2025-03-15 00:59:38,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:59:38,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:38,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash -738977424, now seen corresponding path program 1 times [2025-03-15 00:59:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:38,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919682384] [2025-03-15 00:59:38,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:38,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:39,345 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:59:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919682384] [2025-03-15 00:59:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919682384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:39,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:39,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990521063] [2025-03-15 00:59:39,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:39,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:59:39,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:39,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:59:39,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:59:39,349 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2025-03-15 00:59:39,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 410 transitions, 3047 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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:59:39,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:39,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2025-03-15 00:59:39,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:40,298 INFO L124 PetriNetUnfolderBase]: 3059/6736 cut-off events. [2025-03-15 00:59:40,298 INFO L125 PetriNetUnfolderBase]: For 31526/33719 co-relation queries the response was YES. [2025-03-15 00:59:40,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34969 conditions, 6736 events. 3059/6736 cut-off events. For 31526/33719 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 55099 event pairs, 643 based on Foata normal form. 0/6347 useless extension candidates. Maximal degree in co-relation 26808. Up to 3716 conditions per place. [2025-03-15 00:59:40,327 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 0 selfloop transitions, 0 changer transitions 496/496 dead transitions. [2025-03-15 00:59:40,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 496 transitions, 4665 flow [2025-03-15 00:59:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2025-03-15 00:59:40,331 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8083645443196005 [2025-03-15 00:59:40,331 INFO L298 CegarLoopForPetriNet]: 266 programPoint places, 16 predicate places. [2025-03-15 00:59:40,331 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 496 transitions, 4665 flow [2025-03-15 00:59:40,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 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:59:40,344 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-min-max-1.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 00:59:40,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (30 of 31 remaining) [2025-03-15 00:59:40,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-03-15 00:59:40,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-03-15 00:59:40,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-03-15 00:59:40,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-03-15 00:59:40,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-03-15 00:59:40,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-03-15 00:59:40,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-03-15 00:59:40,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:59:40,380 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:40,384 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:59:40,385 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:59:40,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:59:40 BasicIcfg [2025-03-15 00:59:40,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:59:40,389 INFO L158 Benchmark]: Toolchain (without parser) took 10470.46ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 43.4MB in the beginning and 788.5MB in the end (delta: -745.1MB). Peak memory consumption was 946.6MB. Max. memory is 8.0GB. [2025-03-15 00:59:40,389 INFO L158 Benchmark]: CDTParser took 1.36ms. Allocated memory is still 71.3MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:59:40,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.86ms. Allocated memory is still 71.3MB. Free memory was 43.3MB in the beginning and 30.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 00:59:40,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.96ms. Allocated memory is still 71.3MB. Free memory was 30.5MB in the beginning and 28.7MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:59:40,389 INFO L158 Benchmark]: Boogie Preprocessor took 36.52ms. Allocated memory is still 71.3MB. Free memory was 28.7MB in the beginning and 26.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:59:40,389 INFO L158 Benchmark]: RCFGBuilder took 569.44ms. Allocated memory is still 71.3MB. Free memory was 26.8MB in the beginning and 29.7MB in the end (delta: -2.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2025-03-15 00:59:40,390 INFO L158 Benchmark]: TraceAbstraction took 9591.82ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 28.7MB in the beginning and 788.5MB in the end (delta: -759.8MB). Peak memory consumption was 931.0MB. Max. memory is 8.0GB. [2025-03-15 00:59:40,392 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36ms. Allocated memory is still 71.3MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.86ms. Allocated memory is still 71.3MB. Free memory was 43.3MB in the beginning and 30.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.96ms. Allocated memory is still 71.3MB. Free memory was 30.5MB in the beginning and 28.7MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.52ms. Allocated memory is still 71.3MB. Free memory was 28.7MB in the beginning and 26.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 569.44ms. Allocated memory is still 71.3MB. Free memory was 26.8MB in the beginning and 29.7MB in the end (delta: -2.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9591.82ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 28.7MB in the beginning and 788.5MB in the end (delta: -759.8MB). Peak memory consumption was 931.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: 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 7 procedures, 359 locations, 31 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: 9.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 423 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1204 IncrementalHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 254 mSDtfsCounter, 1204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4665occurred in iteration=8, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 836 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 828 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 2/2 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:59:40,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...