./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:00:27,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:00:27,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:00:27,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:00:27,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:00:27,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:00:27,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:00:27,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:00:27,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:00:27,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:00:27,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:00:27,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:00:27,375 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:00:27,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:00:27,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:00:27,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:00:27,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:00:27,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:00:27,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:00:27,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:00:27,379 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-02-06 09:00:27,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:00:27,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:00:27,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:00:27,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:00:27,618 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:00:27,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-06 09:00:28,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf577fbbd/32f8d0ce43b54800aaf21a4406abc912/FLAGd13078a0a [2025-02-06 09:00:29,108 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:00:29,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-02-06 09:00:29,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf577fbbd/32f8d0ce43b54800aaf21a4406abc912/FLAGd13078a0a [2025-02-06 09:00:29,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf577fbbd/32f8d0ce43b54800aaf21a4406abc912 [2025-02-06 09:00:29,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:00:29,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:00:29,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:00:29,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:00:29,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:00:29,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d00634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29, skipping insertion in model container [2025-02-06 09:00:29,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:00:29,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:00:29,684 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:00:29,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:00:29,733 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:00:29,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29 WrapperNode [2025-02-06 09:00:29,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:00:29,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:00:29,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:00:29,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:00:29,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,759 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2025-02-06 09:00:29,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:00:29,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:00:29,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:00:29,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:00:29,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:00:29,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:00:29,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:00:29,773 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:00:29,774 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (1/1) ... [2025-02-06 09:00:29,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:00:29,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:00:29,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:00:29,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:00:29,833 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-02-06 09:00:29,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-02-06 09:00:29,833 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 09:00:29,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 09:00:29,833 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:00:29,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:00:29,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:00:29,834 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:00:29,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:00:29,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:00:29,835 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:00:29,909 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:00:29,911 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:00:30,072 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:00:30,073 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:00:30,086 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:00:30,086 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:00:30,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:00:30 BoogieIcfgContainer [2025-02-06 09:00:30,087 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:00:30,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:00:30,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:00:30,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:00:30,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:00:29" (1/3) ... [2025-02-06 09:00:30,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42772ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:00:30, skipping insertion in model container [2025-02-06 09:00:30,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:00:29" (2/3) ... [2025-02-06 09:00:30,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42772ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:00:30, skipping insertion in model container [2025-02-06 09:00:30,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:00:30" (3/3) ... [2025-02-06 09:00:30,093 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-02-06 09:00:30,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:00:30,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 102 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-02-06 09:00:30,102 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:00:30,148 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:00:30,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 220 flow [2025-02-06 09:00:30,242 INFO L124 PetriNetUnfolderBase]: 4/112 cut-off events. [2025-02-06 09:00:30,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:00:30,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 112 events. 4/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 185 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-02-06 09:00:30,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 106 transitions, 220 flow [2025-02-06 09:00:30,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 105 transitions, 217 flow [2025-02-06 09:00:30,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:00:30,273 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61299040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:00:30,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-06 09:00:30,292 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:00:30,295 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-02-06 09:00:30,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:00:30,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:30,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:30,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 09:00:30,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1912671103, now seen corresponding path program 1 times [2025-02-06 09:00:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627216607] [2025-02-06 09:00:30,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:30,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 09:00:30,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 09:00:30,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:30,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:30,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627216607] [2025-02-06 09:00:30,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627216607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:30,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:30,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651557865] [2025-02-06 09:00:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:30,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:30,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:30,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:30,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2025-02-06 09:00:30,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-02-06 09:00:30,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:30,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2025-02-06 09:00:30,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:30,743 INFO L124 PetriNetUnfolderBase]: 52/361 cut-off events. [2025-02-06 09:00:30,743 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:00:30,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 361 events. 52/361 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1440 event pairs, 13 based on Foata normal form. 99/406 useless extension candidates. Maximal degree in co-relation 453. Up to 70 conditions per place. [2025-02-06 09:00:30,751 INFO L140 encePairwiseOnDemand]: 95/106 looper letters, 16 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2025-02-06 09:00:30,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 98 transitions, 246 flow [2025-02-06 09:00:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2025-02-06 09:00:30,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9213836477987422 [2025-02-06 09:00:30,777 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 217 flow. Second operand 3 states and 293 transitions. [2025-02-06 09:00:30,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 98 transitions, 246 flow [2025-02-06 09:00:30,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 98 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:00:30,784 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 216 flow [2025-02-06 09:00:30,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2025-02-06 09:00:30,790 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -10 predicate places. [2025-02-06 09:00:30,790 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 216 flow [2025-02-06 09:00:30,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-02-06 09:00:30,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:30,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:30,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:00:30,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 09:00:30,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash -169064736, now seen corresponding path program 1 times [2025-02-06 09:00:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:30,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386208920] [2025-02-06 09:00:30,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:30,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 09:00:30,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 09:00:30,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:30,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:30,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386208920] [2025-02-06 09:00:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386208920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:30,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:30,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:30,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452473255] [2025-02-06 09:00:30,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:30,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:30,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:30,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:30,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2025-02-06 09:00:30,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-02-06 09:00:30,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:30,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2025-02-06 09:00:30,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:30,964 INFO L124 PetriNetUnfolderBase]: 87/617 cut-off events. [2025-02-06 09:00:30,964 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 09:00:30,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 617 events. 87/617 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3305 event pairs, 17 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 853. Up to 101 conditions per place. [2025-02-06 09:00:30,969 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 16 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-02-06 09:00:30,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 100 transitions, 273 flow [2025-02-06 09:00:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-02-06 09:00:30,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.889937106918239 [2025-02-06 09:00:30,971 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 216 flow. Second operand 3 states and 283 transitions. [2025-02-06 09:00:30,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 100 transitions, 273 flow [2025-02-06 09:00:30,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 100 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:00:30,974 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 236 flow [2025-02-06 09:00:30,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-02-06 09:00:30,974 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, -9 predicate places. [2025-02-06 09:00:30,974 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 236 flow [2025-02-06 09:00:30,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-02-06 09:00:30,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:30,975 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:30,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:00:30,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 09:00:30,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash 34200205, now seen corresponding path program 1 times [2025-02-06 09:00:30,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:30,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796291433] [2025-02-06 09:00:30,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:30,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:30,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:00:30,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:00:30,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:30,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:30,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:00:31,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:00:31,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:00:31,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:31,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:31,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:00:31,030 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:00:31,030 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-06 09:00:31,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-06 09:00:31,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-06 09:00:31,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-06 09:00:31,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-06 09:00:31,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-06 09:00:31,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-06 09:00:31,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-06 09:00:31,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-06 09:00:31,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:00:31,035 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 09:00:31,036 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:00:31,037 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:00:31,080 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:00:31,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 176 transitions, 372 flow [2025-02-06 09:00:31,098 INFO L124 PetriNetUnfolderBase]: 5/167 cut-off events. [2025-02-06 09:00:31,098 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:00:31,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 167 events. 5/167 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 357 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 174. Up to 3 conditions per place. [2025-02-06 09:00:31,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 176 transitions, 372 flow [2025-02-06 09:00:31,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 151 transitions, 315 flow [2025-02-06 09:00:31,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:00:31,103 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61299040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:00:31,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-06 09:00:31,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:00:31,109 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-02-06 09:00:31,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:00:31,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:31,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:31,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:00:31,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:31,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1256204004, now seen corresponding path program 1 times [2025-02-06 09:00:31,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:31,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186154027] [2025-02-06 09:00:31,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:31,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:31,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 09:00:31,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 09:00:31,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:31,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:31,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:31,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186154027] [2025-02-06 09:00:31,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186154027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:31,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:31,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:31,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403149580] [2025-02-06 09:00:31,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:31,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:31,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:31,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:31,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:31,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 176 [2025-02-06 09:00:31,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-02-06 09:00:31,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:31,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 176 [2025-02-06 09:00:31,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:31,572 INFO L124 PetriNetUnfolderBase]: 883/3637 cut-off events. [2025-02-06 09:00:31,572 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-02-06 09:00:31,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5163 conditions, 3637 events. 883/3637 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 31959 event pairs, 275 based on Foata normal form. 1003/4008 useless extension candidates. Maximal degree in co-relation 5131. Up to 815 conditions per place. [2025-02-06 09:00:31,603 INFO L140 encePairwiseOnDemand]: 159/176 looper letters, 28 selfloop transitions, 8 changer transitions 0/150 dead transitions. [2025-02-06 09:00:31,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 150 transitions, 393 flow [2025-02-06 09:00:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2025-02-06 09:00:31,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2025-02-06 09:00:31,606 INFO L175 Difference]: Start difference. First operand has 154 places, 151 transitions, 315 flow. Second operand 3 states and 468 transitions. [2025-02-06 09:00:31,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 150 transitions, 393 flow [2025-02-06 09:00:31,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 150 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:00:31,610 INFO L231 Difference]: Finished difference. Result has 142 places, 142 transitions, 350 flow [2025-02-06 09:00:31,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=142, PETRI_TRANSITIONS=142} [2025-02-06 09:00:31,611 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, -12 predicate places. [2025-02-06 09:00:31,611 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 142 transitions, 350 flow [2025-02-06 09:00:31,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-02-06 09:00:31,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:31,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:31,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:00:31,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:00:31,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash 326252709, now seen corresponding path program 1 times [2025-02-06 09:00:31,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:31,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710449378] [2025-02-06 09:00:31,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:31,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 09:00:31,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 09:00:31,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:31,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:31,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710449378] [2025-02-06 09:00:31,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710449378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:31,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680838504] [2025-02-06 09:00:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:31,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:31,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:31,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:31,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:31,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 176 [2025-02-06 09:00:31,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 142 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-02-06 09:00:31,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:31,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 176 [2025-02-06 09:00:31,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:32,714 INFO L124 PetriNetUnfolderBase]: 2733/11277 cut-off events. [2025-02-06 09:00:32,714 INFO L125 PetriNetUnfolderBase]: For 718/721 co-relation queries the response was YES. [2025-02-06 09:00:32,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17130 conditions, 11277 events. 2733/11277 cut-off events. For 718/721 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 129349 event pairs, 711 based on Foata normal form. 0/9386 useless extension candidates. Maximal degree in co-relation 17097. Up to 2139 conditions per place. [2025-02-06 09:00:32,799 INFO L140 encePairwiseOnDemand]: 165/176 looper letters, 28 selfloop transitions, 8 changer transitions 0/158 dead transitions. [2025-02-06 09:00:32,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 158 transitions, 462 flow [2025-02-06 09:00:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-02-06 09:00:32,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2025-02-06 09:00:32,803 INFO L175 Difference]: Start difference. First operand has 142 places, 142 transitions, 350 flow. Second operand 3 states and 456 transitions. [2025-02-06 09:00:32,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 158 transitions, 462 flow [2025-02-06 09:00:32,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 158 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:00:32,816 INFO L231 Difference]: Finished difference. Result has 144 places, 150 transitions, 404 flow [2025-02-06 09:00:32,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=144, PETRI_TRANSITIONS=150} [2025-02-06 09:00:32,817 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, -10 predicate places. [2025-02-06 09:00:32,817 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 150 transitions, 404 flow [2025-02-06 09:00:32,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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-02-06 09:00:32,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:32,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:32,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:00:32,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:00:32,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash -627856245, now seen corresponding path program 1 times [2025-02-06 09:00:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:32,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283482625] [2025-02-06 09:00:32,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:32,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:00:32,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:00:32,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:32,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:32,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:32,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283482625] [2025-02-06 09:00:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283482625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652583671] [2025-02-06 09:00:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:32,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:32,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:32,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:32,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 176 [2025-02-06 09:00:32,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 150 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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-02-06 09:00:32,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:32,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 176 [2025-02-06 09:00:32,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:33,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][48], [69#L717-1true, 177#true, 24#L708true, 175#true, 41#L695true, Black: 181#true, 191#true, 93#L694-4true, 173#true, Black: 186#true, 188#(= |#race~b~0| 0)]) [2025-02-06 09:00:33,877 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-02-06 09:00:33,878 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-06 09:00:33,878 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-02-06 09:00:33,878 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-06 09:00:34,116 INFO L124 PetriNetUnfolderBase]: 3513/14760 cut-off events. [2025-02-06 09:00:34,117 INFO L125 PetriNetUnfolderBase]: For 911/914 co-relation queries the response was YES. [2025-02-06 09:00:34,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23102 conditions, 14760 events. 3513/14760 cut-off events. For 911/914 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 178025 event pairs, 1504 based on Foata normal form. 0/12476 useless extension candidates. Maximal degree in co-relation 23068. Up to 3347 conditions per place. [2025-02-06 09:00:34,236 INFO L140 encePairwiseOnDemand]: 170/176 looper letters, 21 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2025-02-06 09:00:34,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 159 transitions, 479 flow [2025-02-06 09:00:34,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2025-02-06 09:00:34,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875 [2025-02-06 09:00:34,239 INFO L175 Difference]: Start difference. First operand has 144 places, 150 transitions, 404 flow. Second operand 3 states and 462 transitions. [2025-02-06 09:00:34,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 159 transitions, 479 flow [2025-02-06 09:00:34,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 159 transitions, 463 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:00:34,247 INFO L231 Difference]: Finished difference. Result has 146 places, 154 transitions, 426 flow [2025-02-06 09:00:34,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=146, PETRI_TRANSITIONS=154} [2025-02-06 09:00:34,249 INFO L279 CegarLoopForPetriNet]: 154 programPoint places, -8 predicate places. [2025-02-06 09:00:34,250 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 154 transitions, 426 flow [2025-02-06 09:00:34,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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-02-06 09:00:34,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:34,250 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:34,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:00:34,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:00:34,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash -661907182, now seen corresponding path program 1 times [2025-02-06 09:00:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412599060] [2025-02-06 09:00:34,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:34,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:00:34,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:00:34,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:34,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:34,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:00:34,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:00:34,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:00:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:34,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:00:34,294 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2025-02-06 09:00:34,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2025-02-06 09:00:34,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2025-02-06 09:00:34,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2025-02-06 09:00:34,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2025-02-06 09:00:34,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2025-02-06 09:00:34,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2025-02-06 09:00:34,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2025-02-06 09:00:34,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2025-02-06 09:00:34,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2025-02-06 09:00:34,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2025-02-06 09:00:34,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2025-02-06 09:00:34,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:00:34,297 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:00:34,298 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:00:34,298 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:00:34,342 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:00:34,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 246 transitions, 528 flow [2025-02-06 09:00:34,370 INFO L124 PetriNetUnfolderBase]: 6/222 cut-off events. [2025-02-06 09:00:34,372 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:00:34,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 222 events. 6/222 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 609 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 233. Up to 4 conditions per place. [2025-02-06 09:00:34,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 246 transitions, 528 flow [2025-02-06 09:00:34,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 197 transitions, 415 flow [2025-02-06 09:00:34,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:00:34,379 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61299040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:00:34,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-06 09:00:34,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:00:34,385 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-02-06 09:00:34,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:00:34,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:34,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:34,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-02-06 09:00:34,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:34,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2098689577, now seen corresponding path program 1 times [2025-02-06 09:00:34,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:34,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484293943] [2025-02-06 09:00:34,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:34,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:34,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 09:00:34,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 09:00:34,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:34,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:34,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:34,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484293943] [2025-02-06 09:00:34,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484293943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:34,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:34,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517892133] [2025-02-06 09:00:34,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:34,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:34,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:34,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:34,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:34,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 246 [2025-02-06 09:00:34,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 197 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-02-06 09:00:34,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:34,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 246 [2025-02-06 09:00:34,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:37,106 INFO L124 PetriNetUnfolderBase]: 10771/33528 cut-off events. [2025-02-06 09:00:37,107 INFO L125 PetriNetUnfolderBase]: For 2974/2974 co-relation queries the response was YES. [2025-02-06 09:00:37,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50127 conditions, 33528 events. 10771/33528 cut-off events. For 2974/2974 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 412772 event pairs, 3401 based on Foata normal form. 9326/36869 useless extension candidates. Maximal degree in co-relation 50094. Up to 8416 conditions per place. [2025-02-06 09:00:37,436 INFO L140 encePairwiseOnDemand]: 224/246 looper letters, 38 selfloop transitions, 11 changer transitions 0/199 dead transitions. [2025-02-06 09:00:37,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 199 transitions, 532 flow [2025-02-06 09:00:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2025-02-06 09:00:37,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672086720867209 [2025-02-06 09:00:37,443 INFO L175 Difference]: Start difference. First operand has 201 places, 197 transitions, 415 flow. Second operand 3 states and 640 transitions. [2025-02-06 09:00:37,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 199 transitions, 532 flow [2025-02-06 09:00:37,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 199 transitions, 527 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:00:37,449 INFO L231 Difference]: Finished difference. Result has 186 places, 188 transitions, 468 flow [2025-02-06 09:00:37,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=186, PETRI_TRANSITIONS=188} [2025-02-06 09:00:37,451 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -15 predicate places. [2025-02-06 09:00:37,451 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 188 transitions, 468 flow [2025-02-06 09:00:37,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-02-06 09:00:37,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:37,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:37,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:00:37,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-02-06 09:00:37,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1793920534, now seen corresponding path program 1 times [2025-02-06 09:00:37,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:37,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946540353] [2025-02-06 09:00:37,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:37,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:37,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 09:00:37,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 09:00:37,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:37,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:37,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946540353] [2025-02-06 09:00:37,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946540353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:37,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:37,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:37,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317172463] [2025-02-06 09:00:37,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:37,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:37,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:37,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:37,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:37,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 246 [2025-02-06 09:00:37,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 188 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-02-06 09:00:37,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:37,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 246 [2025-02-06 09:00:37,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:47,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][89], [130#L707-2true, 42#L717-1true, 124#L694-5true, 247#true, 251#true, 53#L695true, 66#L694-5true, 249#true, 245#true, 239#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0)]) [2025-02-06 09:00:47,649 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-02-06 09:00:47,650 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-02-06 09:00:47,650 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:00:47,650 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-06 09:00:47,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][89], [42#L717-1true, 124#L694-5true, 247#true, 251#true, 53#L695true, 66#L694-5true, 249#true, 245#true, 234#L707-1true, 239#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0)]) [2025-02-06 09:00:47,828 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-02-06 09:00:47,828 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-06 09:00:47,828 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-02-06 09:00:47,828 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-06 09:00:48,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][148], [253#(= |#race~a~0| 0), 146#L706true, 42#L717-1true, 247#true, 6#L695-4true, 207#L695-4true, 66#L694-5true, 249#true, 245#true, 239#true, 258#(= |#race~b~0| 0), Black: 251#true]) [2025-02-06 09:00:48,479 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-02-06 09:00:48,479 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-06 09:00:48,479 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-02-06 09:00:48,479 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-02-06 09:00:48,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][89], [171#L708true, 42#L717-1true, 124#L694-5true, 247#true, 251#true, 53#L695true, 66#L694-5true, 249#true, 245#true, 239#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0)]) [2025-02-06 09:00:48,519 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-02-06 09:00:48,519 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-06 09:00:48,519 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-02-06 09:00:48,519 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-06 09:00:48,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([811] L707-5-->L707-3: Formula: (= |v_#race~a~0_9| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_9|} AuxVars[] AssignedVars[#race~a~0][59], [253#(= |#race~a~0| 0), 42#L717-1true, 147#L707-3true, 124#L694-5true, 247#true, 207#L695-4true, 66#L694-5true, 249#true, 245#true, 239#true, Black: 251#true, 258#(= |#race~b~0| 0)]) [2025-02-06 09:00:48,703 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2025-02-06 09:00:48,703 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-02-06 09:00:48,703 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-02-06 09:00:48,703 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-02-06 09:00:48,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][89], [146#L706true, 42#L717-1true, 124#L694-5true, 247#true, 251#true, 249#true, 53#L695true, 245#true, 239#true, 92#L694-4true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0)]) [2025-02-06 09:00:48,704 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-02-06 09:00:48,704 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-02-06 09:00:48,704 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-06 09:00:48,704 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-02-06 09:00:48,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][148], [253#(= |#race~a~0| 0), 146#L706true, 42#L717-1true, 247#true, 6#L695-4true, 66#L694-5true, 103#L695-5true, 249#true, 245#true, 239#true, 258#(= |#race~b~0| 0), Black: 251#true]) [2025-02-06 09:00:48,706 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-02-06 09:00:48,706 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-02-06 09:00:48,706 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-06 09:00:48,706 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-02-06 09:00:48,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][89], [146#L706true, 42#L717-1true, 124#L694-5true, 247#true, 251#true, 53#L695true, 249#true, 66#L694-5true, 245#true, 239#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0)]) [2025-02-06 09:00:48,898 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-02-06 09:00:48,898 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-06 09:00:48,899 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-06 09:00:48,899 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-02-06 09:00:49,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][89], [146#L706true, 42#L717-1true, 101#L694-4true, 247#true, 251#true, 66#L694-5true, 249#true, 53#L695true, 245#true, 239#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0)]) [2025-02-06 09:00:49,250 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-02-06 09:00:49,250 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-02-06 09:00:49,250 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-02-06 09:00:49,250 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-02-06 09:00:49,251 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([667] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][89], [146#L706true, 42#L717-1true, 124#L694-5true, 247#true, 251#true, 53#L695true, 66#L694-5true, 249#true, 245#true, 239#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0)]) [2025-02-06 09:00:49,251 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-02-06 09:00:49,251 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-06 09:00:49,251 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-02-06 09:00:49,251 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-06 09:00:49,251 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-02-06 09:00:49,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([752] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][148], [253#(= |#race~a~0| 0), 146#L706true, 42#L717-1true, 247#true, 143#L695-5true, 6#L695-4true, 53#L695true, 249#true, 245#true, 239#true, 258#(= |#race~b~0| 0), Black: 251#true]) [2025-02-06 09:00:49,868 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-02-06 09:00:49,868 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-02-06 09:00:49,868 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-02-06 09:00:49,868 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-06 09:00:51,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([814] L707-4-->L707-2: Formula: (= |v_#race~b~0_7| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_7|} AuxVars[] AssignedVars[#race~b~0][36], [130#L707-2true, 136#L693true, 253#(= |#race~a~0| 0), 60#thr2Err7ASSERT_VIOLATIONDATA_RACEtrue, 42#L717-1true, 247#true, 249#true, 245#true, 239#true, 237#L695true, 258#(= |#race~b~0| 0), Black: 251#true]) [2025-02-06 09:00:51,738 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2025-02-06 09:00:51,738 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-02-06 09:00:51,738 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-02-06 09:00:51,738 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-02-06 09:00:51,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([698] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][82], [253#(= |#race~a~0| 0), 60#thr2Err7ASSERT_VIOLATIONDATA_RACEtrue, 42#L717-1true, 147#L707-3true, 247#true, 249#true, 245#true, 239#true, 92#L694-4true, 237#L695true, 256#true, Black: 251#true]) [2025-02-06 09:00:51,755 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2025-02-06 09:00:51,755 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-02-06 09:00:51,755 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-02-06 09:00:51,755 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-02-06 09:00:51,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([698] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][82], [253#(= |#race~a~0| 0), 60#thr2Err7ASSERT_VIOLATIONDATA_RACEtrue, 42#L717-1true, 247#true, 249#true, 245#true, 239#true, 92#L694-4true, 142#L707-4true, 237#L695true, 256#true, Black: 251#true]) [2025-02-06 09:00:51,755 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2025-02-06 09:00:51,755 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-02-06 09:00:51,755 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-02-06 09:00:51,755 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-02-06 09:00:51,897 INFO L124 PetriNetUnfolderBase]: 52969/163980 cut-off events. [2025-02-06 09:00:51,898 INFO L125 PetriNetUnfolderBase]: For 11569/11743 co-relation queries the response was YES. [2025-02-06 09:00:52,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260658 conditions, 163980 events. 52969/163980 cut-off events. For 11569/11743 co-relation queries the response was YES. Maximal size of possible extension queue 4786. Compared 2533796 event pairs, 15087 based on Foata normal form. 0/135905 useless extension candidates. Maximal degree in co-relation 260624. Up to 35464 conditions per place. [2025-02-06 09:00:54,107 INFO L140 encePairwiseOnDemand]: 231/246 looper letters, 38 selfloop transitions, 11 changer transitions 0/210 dead transitions. [2025-02-06 09:00:54,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 210 transitions, 623 flow [2025-02-06 09:00:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2025-02-06 09:00:54,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8482384823848238 [2025-02-06 09:00:54,109 INFO L175 Difference]: Start difference. First operand has 186 places, 188 transitions, 468 flow. Second operand 3 states and 626 transitions. [2025-02-06 09:00:54,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 210 transitions, 623 flow [2025-02-06 09:00:54,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 210 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:00:54,177 INFO L231 Difference]: Finished difference. Result has 188 places, 199 transitions, 542 flow [2025-02-06 09:00:54,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=188, PETRI_TRANSITIONS=199} [2025-02-06 09:00:54,178 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -13 predicate places. [2025-02-06 09:00:54,178 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 199 transitions, 542 flow [2025-02-06 09:00:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-02-06 09:00:54,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:54,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:54,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:00:54,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-02-06 09:00:54,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash 760002804, now seen corresponding path program 1 times [2025-02-06 09:00:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605046934] [2025-02-06 09:00:54,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:54,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:00:54,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:00:54,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:54,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605046934] [2025-02-06 09:00:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605046934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:54,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658240267] [2025-02-06 09:00:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:54,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:54,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:54,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:54,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 246 [2025-02-06 09:00:54,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 199 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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-02-06 09:00:54,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:54,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 246 [2025-02-06 09:00:54,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:58,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([707] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][120], [130#L707-2true, 42#L717-1true, Black: 256#true, 247#true, 53#L695true, 239#true, 52#L695-5true, 169#L695-4true, 249#true, 245#true, 258#(= |#race~b~0| 0), 261#true, Black: 251#true]) [2025-02-06 09:00:58,848 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2025-02-06 09:00:58,848 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-02-06 09:00:58,848 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-02-06 09:00:58,848 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-02-06 09:00:59,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([707] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][120], [42#L717-1true, Black: 256#true, 247#true, 53#L695true, 234#L707-1true, 239#true, 52#L695-5true, 169#L695-4true, 249#true, 245#true, 258#(= |#race~b~0| 0), Black: 251#true, 261#true]) [2025-02-06 09:00:59,357 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-02-06 09:00:59,357 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-02-06 09:00:59,357 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-02-06 09:00:59,357 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-02-06 09:01:02,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([653] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][50], [171#L708true, 248#true, 42#L717-1true, Black: 256#true, 247#true, 245#true, 239#true, 155#L695true, 209#L694-4true, 261#true, Black: 251#true, 258#(= |#race~b~0| 0)]) [2025-02-06 09:01:02,823 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-02-06 09:01:02,823 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-06 09:01:02,823 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-02-06 09:01:02,823 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2025-02-06 09:01:04,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L694-2-->L694: Formula: (= |v_#race~temp~0_6| |v_thr2Thread3of3ForFork0_#t~nondet2_3|) InVars {thr2Thread3of3ForFork0_#t~nondet2=|v_thr2Thread3of3ForFork0_#t~nondet2_3|} OutVars{#race~temp~0=|v_#race~temp~0_6|, thr2Thread3of3ForFork0_#t~nondet2=|v_thr2Thread3of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[#race~temp~0][105], [42#L717-1true, Black: 256#true, 247#true, 43#L694true, 239#true, 152#L697-4true, 155#L695true, 171#L708true, 249#true, 245#true, Black: 251#true, 258#(= |#race~b~0| 0), 261#true]) [2025-02-06 09:01:04,787 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-02-06 09:01:04,787 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-06 09:01:04,787 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-06 09:01:04,787 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-06 09:01:05,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L708-3-->L708: Formula: (and (= |v_thr1Thread1of3ForFork1_#t~ret8#1_1| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#mutex~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#mutex~0.base_25|) |v_~#mutex~0.offset_25| 0)))) InVars {~#mutex~0.base=|v_~#mutex~0.base_25|, ~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_38|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread1of3ForFork1_#t~ret8#1=|v_thr1Thread1of3ForFork1_#t~ret8#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork1_#t~ret8#1][46], [42#L717-1true, Black: 256#true, 247#true, 88#L694true, 43#L694true, 152#L697-4true, 239#true, 171#L708true, 249#true, 245#true, 258#(= |#race~b~0| 0), Black: 251#true, 261#true]) [2025-02-06 09:01:05,802 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-02-06 09:01:05,802 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-06 09:01:05,802 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-06 09:01:05,803 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-02-06 09:01:05,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L708-3-->L708: Formula: (and (= |v_thr1Thread1of3ForFork1_#t~ret8#1_1| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#mutex~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#mutex~0.base_25|) |v_~#mutex~0.offset_25| 0)))) InVars {~#mutex~0.base=|v_~#mutex~0.base_25|, ~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_38|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread1of3ForFork1_#t~ret8#1=|v_thr1Thread1of3ForFork1_#t~ret8#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork1_#t~ret8#1][46], [42#L717-1true, Black: 256#true, 247#true, 239#true, 209#L694-4true, 136#L693true, 171#L708true, 180#L693true, 249#true, 245#true, Black: 251#true, 261#true, 258#(= |#race~b~0| 0)]) [2025-02-06 09:01:05,829 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-02-06 09:01:05,829 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-02-06 09:01:05,829 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-06 09:01:05,829 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-02-06 09:01:06,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([698] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][66], [42#L717-1true, Black: 256#true, 247#true, 239#true, 54#thr2ENTRYtrue, 237#L695true, 171#L708true, 249#true, 245#true, 92#L694-4true, 258#(= |#race~b~0| 0), 261#true, Black: 251#true]) [2025-02-06 09:01:06,373 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-02-06 09:01:06,373 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-02-06 09:01:06,373 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-06 09:01:06,373 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-02-06 09:01:08,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([698] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][66], [42#L717-1true, Black: 256#true, 247#true, 84#L694-2true, 239#true, 237#L695true, 171#L708true, 249#true, 245#true, 92#L694-4true, 258#(= |#race~b~0| 0), Black: 251#true, 261#true]) [2025-02-06 09:01:08,284 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2025-02-06 09:01:08,284 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-02-06 09:01:08,284 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-02-06 09:01:08,284 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-02-06 09:01:08,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L694-2-->L694: Formula: (= |v_#race~temp~0_6| |v_thr2Thread3of3ForFork0_#t~nondet2_3|) InVars {thr2Thread3of3ForFork0_#t~nondet2=|v_thr2Thread3of3ForFork0_#t~nondet2_3|} OutVars{#race~temp~0=|v_#race~temp~0_6|, thr2Thread3of3ForFork0_#t~nondet2=|v_thr2Thread3of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[#race~temp~0][105], [42#L717-1true, Black: 256#true, 247#true, 43#L694true, 117#L698true, 239#true, 155#L695true, 171#L708true, 249#true, 245#true, 261#true, 258#(= |#race~b~0| 0), Black: 251#true]) [2025-02-06 09:01:08,951 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-02-06 09:01:08,952 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:01:08,952 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:01:08,952 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:01:09,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L695-2-->L695: Formula: (= |v_thr2Thread2of3ForFork0_#t~nondet3_3| |v_#race~a~0_3|) InVars {thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][114], [42#L717-1true, Black: 256#true, 247#true, 239#true, 155#L695true, 209#L694-4true, 171#L708true, 101#L694-4true, 249#true, 245#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0), 261#true]) [2025-02-06 09:01:09,378 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-02-06 09:01:09,378 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-06 09:01:09,378 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-06 09:01:09,378 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-06 09:01:09,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L708-3-->L708: Formula: (and (= |v_thr1Thread1of3ForFork1_#t~ret8#1_1| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#mutex~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#mutex~0.base_25|) |v_~#mutex~0.offset_25| 0)))) InVars {~#mutex~0.base=|v_~#mutex~0.base_25|, ~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_38|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread1of3ForFork1_#t~ret8#1=|v_thr1Thread1of3ForFork1_#t~ret8#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork1_#t~ret8#1][46], [42#L717-1true, Black: 256#true, 247#true, 88#L694true, 43#L694true, 117#L698true, 239#true, 171#L708true, 249#true, 245#true, 258#(= |#race~b~0| 0), Black: 251#true, 261#true]) [2025-02-06 09:01:09,635 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-02-06 09:01:09,636 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-06 09:01:09,636 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-06 09:01:09,636 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-06 09:01:09,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([820] L708-3-->L708: Formula: (and (= |v_thr1Thread1of3ForFork1_#t~ret8#1_1| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#mutex~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#mutex~0.base_25|) |v_~#mutex~0.offset_25| 0)))) InVars {~#mutex~0.base=|v_~#mutex~0.base_25|, ~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_38|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread1of3ForFork1_#t~ret8#1=|v_thr1Thread1of3ForFork1_#t~ret8#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork1_#t~ret8#1][81], [42#L717-1true, Black: 256#true, 247#true, 50#L694-1true, 239#true, 263#(= |thr2Thread1of3ForFork0_#t~nondet2| |#race~temp~0|), 171#L708true, 180#L693true, 249#true, 245#true, 92#L694-4true, Black: 251#true, 258#(= |#race~b~0| 0)]) [2025-02-06 09:01:09,637 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-02-06 09:01:09,637 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-06 09:01:09,637 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-06 09:01:09,637 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-02-06 09:01:09,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([698] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][66], [42#L717-1true, Black: 256#true, 247#true, 84#L694-2true, 239#true, 237#L695true, 146#L706true, 249#true, 245#true, 92#L694-4true, Black: 251#true, 258#(= |#race~b~0| 0), 261#true]) [2025-02-06 09:01:09,909 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-02-06 09:01:09,909 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-02-06 09:01:09,909 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-02-06 09:01:09,909 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-06 09:01:10,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L695-2-->L695: Formula: (= |v_thr2Thread2of3ForFork0_#t~nondet3_3| |v_#race~a~0_3|) InVars {thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][114], [42#L717-1true, Black: 256#true, 247#true, 239#true, 155#L695true, 171#L708true, 101#L694-4true, 249#true, 45#L694-5true, 245#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0), 261#true]) [2025-02-06 09:01:10,025 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-02-06 09:01:10,025 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-02-06 09:01:10,025 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-06 09:01:10,025 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-06 09:01:10,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L695-2-->L695: Formula: (= |v_thr2Thread2of3ForFork0_#t~nondet3_3| |v_#race~a~0_3|) InVars {thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][114], [42#L717-1true, Black: 256#true, 247#true, 239#true, 155#L695true, 209#L694-4true, 171#L708true, 124#L694-5true, 249#true, 245#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0), 261#true]) [2025-02-06 09:01:10,026 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-02-06 09:01:10,026 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-02-06 09:01:10,026 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-06 09:01:10,026 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-02-06 09:01:10,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L695-2-->L695: Formula: (= |v_thr2Thread2of3ForFork0_#t~nondet3_3| |v_#race~a~0_3|) InVars {thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][114], [42#L717-1true, Black: 256#true, 247#true, 239#true, 155#L695true, 171#L708true, 124#L694-5true, 249#true, 45#L694-5true, 245#true, Black: 253#(= |#race~a~0| 0), 258#(= |#race~b~0| 0), 261#true]) [2025-02-06 09:01:10,555 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-02-06 09:01:10,555 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-06 09:01:10,555 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-06 09:01:10,555 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event