./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/06_ticket.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/06_ticket.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d21b75ab9211f19b3beb5c83d6d66f0a0906e2f271e4621d3ded70db8a63bb33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:17:10,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:17:10,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:17:10,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:17:10,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:17:10,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:17:10,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:17:10,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:17:10,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:17:10,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:17:10,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:17:10,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:17:10,360 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:17:10,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:17:10,361 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:17:10,362 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:17:10,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:17:10,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:17:10,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:17:10,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:17:10,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:17:10,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:17:10,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:17:10,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:17:10,363 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d21b75ab9211f19b3beb5c83d6d66f0a0906e2f271e4621d3ded70db8a63bb33 [2025-03-14 01:17:10,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:17:10,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:17:10,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:17:10,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:17:10,564 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:17:10,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/06_ticket.i [2025-03-14 01:17:11,728 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551c2e292/927fce6219c84f1eb6f7410e3163cb7e/FLAG3ab3331ff [2025-03-14 01:17:11,965 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:17:11,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/06_ticket.i [2025-03-14 01:17:11,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551c2e292/927fce6219c84f1eb6f7410e3163cb7e/FLAG3ab3331ff [2025-03-14 01:17:11,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551c2e292/927fce6219c84f1eb6f7410e3163cb7e [2025-03-14 01:17:11,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:17:11,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:17:11,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:17:11,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:17:12,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:17:12,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:17:11" (1/1) ... [2025-03-14 01:17:12,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ccb1e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12, skipping insertion in model container [2025-03-14 01:17:12,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:17:11" (1/1) ... [2025-03-14 01:17:12,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:17:12,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:17:12,284 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:17:12,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:17:12,342 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:17:12,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12 WrapperNode [2025-03-14 01:17:12,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:17:12,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:17:12,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:17:12,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:17:12,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,376 INFO L138 Inliner]: procedures = 171, calls = 14, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 95 [2025-03-14 01:17:12,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:17:12,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:17:12,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:17:12,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:17:12,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:17:12,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:17:12,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:17:12,401 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:17:12,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (1/1) ... [2025-03-14 01:17:12,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:17:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:12,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:17:12,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:17:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 01:17:12,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 01:17:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:17:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:17:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:17:12,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:17:12,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:17:12,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:17:12,456 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:17:12,552 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:17:12,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:17:12,704 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:17:12,704 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:17:12,704 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:17:12,762 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:17:12,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:17:12 BoogieIcfgContainer [2025-03-14 01:17:12,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:17:12,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:17:12,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:17:12,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:17:12,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:17:11" (1/3) ... [2025-03-14 01:17:12,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757d3bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:17:12, skipping insertion in model container [2025-03-14 01:17:12,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:12" (2/3) ... [2025-03-14 01:17:12,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757d3bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:17:12, skipping insertion in model container [2025-03-14 01:17:12,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:17:12" (3/3) ... [2025-03-14 01:17:12,773 INFO L128 eAbstractionObserver]: Analyzing ICFG 06_ticket.i [2025-03-14 01:17:12,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:17:12,784 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06_ticket.i that has 2 procedures, 98 locations, 1 initial locations, 2 loop locations, and 13 error locations. [2025-03-14 01:17:12,784 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:17:12,831 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:12,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 104 transitions, 212 flow [2025-03-14 01:17:12,893 INFO L124 PetriNetUnfolderBase]: 6/111 cut-off events. [2025-03-14 01:17:12,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:12,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 111 events. 6/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 90. Up to 3 conditions per place. [2025-03-14 01:17:12,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 104 transitions, 212 flow [2025-03-14 01:17:12,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 104 transitions, 212 flow [2025-03-14 01:17:12,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:12,919 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;@1be87a30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:12,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-14 01:17:12,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:12,933 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-14 01:17:12,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:12,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:12,934 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:17:12,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-14 01:17:12,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash -157052113, now seen corresponding path program 1 times [2025-03-14 01:17:12,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:12,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873312326] [2025-03-14 01:17:12,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:13,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:17:13,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:17:13,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:13,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:13,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:17:13,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:17:13,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:17:13,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:13,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:17:13,064 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:17:13,066 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 27 remaining) [2025-03-14 01:17:13,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-14 01:17:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-14 01:17:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-14 01:17:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-14 01:17:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-14 01:17:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-14 01:17:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-14 01:17:13,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-14 01:17:13,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-14 01:17:13,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-14 01:17:13,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-03-14 01:17:13,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-03-14 01:17:13,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-14 01:17:13,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-14 01:17:13,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-14 01:17:13,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-03-14 01:17:13,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-03-14 01:17:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-14 01:17:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-14 01:17:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-03-14 01:17:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-14 01:17:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-14 01:17:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-14 01:17:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-14 01:17:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-14 01:17:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-14 01:17:13,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:17:13,073 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-14 01:17:13,076 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:17:13,078 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:17:13,132 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:13,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 186 transitions, 382 flow [2025-03-14 01:17:13,197 INFO L124 PetriNetUnfolderBase]: 12/202 cut-off events. [2025-03-14 01:17:13,199 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:17:13,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 202 events. 12/202 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 456 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 171. Up to 3 conditions per place. [2025-03-14 01:17:13,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 186 transitions, 382 flow [2025-03-14 01:17:13,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 186 transitions, 382 flow [2025-03-14 01:17:13,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:13,209 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;@1be87a30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:13,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-14 01:17:13,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:13,217 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-14 01:17:13,218 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:17:13,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:13,218 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] [2025-03-14 01:17:13,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:17:13,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1830893685, now seen corresponding path program 1 times [2025-03-14 01:17:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:13,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627375284] [2025-03-14 01:17:13,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:13,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:13,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:17:13,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:17:13,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:13,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:13,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:13,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627375284] [2025-03-14 01:17:13,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627375284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:13,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:13,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:17:13,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322342749] [2025-03-14 01:17:13,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:13,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:17:13,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:13,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:17:13,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:17:13,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 186 [2025-03-14 01:17:13,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 186 transitions, 382 flow. Second operand has 2 states, 2 states have (on average 162.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:13,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:13,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 186 [2025-03-14 01:17:13,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:13,414 INFO L124 PetriNetUnfolderBase]: 10/300 cut-off events. [2025-03-14 01:17:13,414 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-14 01:17:13,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 300 events. 10/300 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1039 event pairs, 2 based on Foata normal form. 23/275 useless extension candidates. Maximal degree in co-relation 215. Up to 9 conditions per place. [2025-03-14 01:17:13,418 INFO L140 encePairwiseOnDemand]: 167/186 looper letters, 4 selfloop transitions, 0 changer transitions 0/160 dead transitions. [2025-03-14 01:17:13,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 160 transitions, 338 flow [2025-03-14 01:17:13,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:17:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:17:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2025-03-14 01:17:13,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9274193548387096 [2025-03-14 01:17:13,432 INFO L175 Difference]: Start difference. First operand has 179 places, 186 transitions, 382 flow. Second operand 2 states and 345 transitions. [2025-03-14 01:17:13,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 160 transitions, 338 flow [2025-03-14 01:17:13,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 160 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:13,439 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 330 flow [2025-03-14 01:17:13,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=330, PETRI_PLACES=162, PETRI_TRANSITIONS=160} [2025-03-14 01:17:13,444 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, -17 predicate places. [2025-03-14 01:17:13,445 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 330 flow [2025-03-14 01:17:13,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 162.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:13,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:13,446 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] [2025-03-14 01:17:13,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:17:13,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:17:13,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1084824868, now seen corresponding path program 1 times [2025-03-14 01:17:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232126182] [2025-03-14 01:17:13,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:13,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:17:13,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:17:13,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:13,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:13,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:17:13,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:17:13,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:17:13,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:13,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:13,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:17:13,482 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:17:13,482 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-03-14 01:17:13,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-03-14 01:17:13,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-03-14 01:17:13,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-03-14 01:17:13,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-03-14 01:17:13,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-03-14 01:17:13,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-03-14 01:17:13,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-03-14 01:17:13,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-03-14 01:17:13,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-03-14 01:17:13,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-03-14 01:17:13,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-03-14 01:17:13,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-03-14 01:17:13,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-03-14 01:17:13,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-03-14 01:17:13,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-03-14 01:17:13,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-03-14 01:17:13,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-03-14 01:17:13,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:17:13,487 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 01:17:13,487 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:17:13,487 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:17:13,526 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:13,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 268 transitions, 554 flow [2025-03-14 01:17:13,569 INFO L124 PetriNetUnfolderBase]: 18/293 cut-off events. [2025-03-14 01:17:13,570 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:17:13,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 293 events. 18/293 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 933 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 252. Up to 4 conditions per place. [2025-03-14 01:17:13,576 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 268 transitions, 554 flow [2025-03-14 01:17:13,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 268 transitions, 554 flow [2025-03-14 01:17:13,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:13,582 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;@1be87a30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:13,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-14 01:17:13,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:13,586 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-14 01:17:13,586 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:17:13,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:13,586 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] [2025-03-14 01:17:13,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-03-14 01:17:13,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1859233892, now seen corresponding path program 1 times [2025-03-14 01:17:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740165711] [2025-03-14 01:17:13,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:13,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:17:13,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:17:13,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:13,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740165711] [2025-03-14 01:17:13,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740165711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:13,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:13,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:17:13,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756338552] [2025-03-14 01:17:13,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:13,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:17:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:13,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:17:13,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:17:13,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 268 [2025-03-14 01:17:13,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 268 transitions, 554 flow. Second operand has 2 states, 2 states have (on average 232.0) internal successors, (464), 2 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:13,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:13,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 268 [2025-03-14 01:17:13,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:13,730 INFO L124 PetriNetUnfolderBase]: 32/774 cut-off events. [2025-03-14 01:17:13,731 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-14 01:17:13,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 774 events. 32/774 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4707 event pairs, 10 based on Foata normal form. 61/703 useless extension candidates. Maximal degree in co-relation 492. Up to 25 conditions per place. [2025-03-14 01:17:13,740 INFO L140 encePairwiseOnDemand]: 240/268 looper letters, 6 selfloop transitions, 0 changer transitions 0/231 dead transitions. [2025-03-14 01:17:13,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 231 transitions, 492 flow [2025-03-14 01:17:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:17:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:17:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 496 transitions. [2025-03-14 01:17:13,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253731343283582 [2025-03-14 01:17:13,745 INFO L175 Difference]: Start difference. First operand has 257 places, 268 transitions, 554 flow. Second operand 2 states and 496 transitions. [2025-03-14 01:17:13,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 231 transitions, 492 flow [2025-03-14 01:17:13,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 231 transitions, 490 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:13,751 INFO L231 Difference]: Finished difference. Result has 233 places, 231 transitions, 478 flow [2025-03-14 01:17:13,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=478, PETRI_PLACES=233, PETRI_TRANSITIONS=231} [2025-03-14 01:17:13,752 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-03-14 01:17:13,752 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 231 transitions, 478 flow [2025-03-14 01:17:13,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 232.0) internal successors, (464), 2 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:13,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:13,753 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-03-14 01:17:13,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:17:13,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-03-14 01:17:13,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash 263062057, now seen corresponding path program 1 times [2025-03-14 01:17:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:13,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897195237] [2025-03-14 01:17:13,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:13,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:17:13,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:17:13,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:13,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:13,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:13,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897195237] [2025-03-14 01:17:13,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897195237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:13,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:13,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:17:13,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881938098] [2025-03-14 01:17:13,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:13,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:13,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:13,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:13,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:13,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 268 [2025-03-14 01:17:13,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 231 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:13,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:13,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 268 [2025-03-14 01:17:13,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:14,788 INFO L124 PetriNetUnfolderBase]: 1088/6875 cut-off events. [2025-03-14 01:17:14,788 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-14 01:17:14,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8744 conditions, 6875 events. 1088/6875 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 68823 event pairs, 439 based on Foata normal form. 0/5802 useless extension candidates. Maximal degree in co-relation 8738. Up to 1297 conditions per place. [2025-03-14 01:17:14,853 INFO L140 encePairwiseOnDemand]: 244/268 looper letters, 29 selfloop transitions, 18 changer transitions 0/251 dead transitions. [2025-03-14 01:17:14,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 251 transitions, 622 flow [2025-03-14 01:17:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-03-14 01:17:14,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.849502487562189 [2025-03-14 01:17:14,857 INFO L175 Difference]: Start difference. First operand has 233 places, 231 transitions, 478 flow. Second operand 3 states and 683 transitions. [2025-03-14 01:17:14,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 251 transitions, 622 flow [2025-03-14 01:17:14,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 251 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:14,864 INFO L231 Difference]: Finished difference. Result has 237 places, 249 transitions, 634 flow [2025-03-14 01:17:14,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=237, PETRI_TRANSITIONS=249} [2025-03-14 01:17:14,866 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -20 predicate places. [2025-03-14 01:17:14,866 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 249 transitions, 634 flow [2025-03-14 01:17:14,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:14,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:14,868 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:17:14,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:17:14,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-03-14 01:17:14,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash -687742932, now seen corresponding path program 1 times [2025-03-14 01:17:14,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:14,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603317529] [2025-03-14 01:17:14,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:14,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:14,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:17:14,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:17:14,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:14,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:14,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:17:14,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:17:14,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:17:14,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:14,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:14,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:17:14,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:17:14,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-03-14 01:17:14,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-03-14 01:17:14,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-03-14 01:17:14,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-03-14 01:17:14,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-03-14 01:17:14,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-03-14 01:17:14,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-03-14 01:17:14,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-03-14 01:17:14,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-03-14 01:17:14,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-03-14 01:17:14,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-03-14 01:17:14,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-03-14 01:17:14,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-03-14 01:17:14,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-03-14 01:17:14,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-03-14 01:17:14,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-03-14 01:17:14,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-03-14 01:17:14,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-03-14 01:17:14,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:17:14,921 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-14 01:17:14,922 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:17:14,923 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 01:17:14,974 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:14,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 350 transitions, 728 flow [2025-03-14 01:17:15,031 INFO L124 PetriNetUnfolderBase]: 24/384 cut-off events. [2025-03-14 01:17:15,031 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:17:15,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 384 events. 24/384 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1436 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 333. Up to 5 conditions per place. [2025-03-14 01:17:15,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 335 places, 350 transitions, 728 flow [2025-03-14 01:17:15,044 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 350 transitions, 728 flow [2025-03-14 01:17:15,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:15,045 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;@1be87a30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:15,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-03-14 01:17:15,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:15,049 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-14 01:17:15,049 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:17:15,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:15,049 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] [2025-03-14 01:17:15,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2025-03-14 01:17:15,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1815580979, now seen corresponding path program 1 times [2025-03-14 01:17:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:15,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355323010] [2025-03-14 01:17:15,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:15,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:17:15,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:17:15,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:15,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:15,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:15,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355323010] [2025-03-14 01:17:15,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355323010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:15,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:15,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:17:15,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520308262] [2025-03-14 01:17:15,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:15,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:17:15,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:15,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:17:15,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:17:15,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 350 [2025-03-14 01:17:15,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 350 transitions, 728 flow. Second operand has 2 states, 2 states have (on average 302.0) internal successors, (604), 2 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:15,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:15,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 350 [2025-03-14 01:17:15,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:15,328 INFO L124 PetriNetUnfolderBase]: 86/1784 cut-off events. [2025-03-14 01:17:15,329 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-14 01:17:15,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 1784 events. 86/1784 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14808 event pairs, 34 based on Foata normal form. 151/1623 useless extension candidates. Maximal degree in co-relation 1049. Up to 65 conditions per place. [2025-03-14 01:17:15,350 INFO L140 encePairwiseOnDemand]: 313/350 looper letters, 8 selfloop transitions, 0 changer transitions 0/302 dead transitions. [2025-03-14 01:17:15,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 302 transitions, 648 flow [2025-03-14 01:17:15,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:17:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:17:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 647 transitions. [2025-03-14 01:17:15,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9242857142857143 [2025-03-14 01:17:15,353 INFO L175 Difference]: Start difference. First operand has 335 places, 350 transitions, 728 flow. Second operand 2 states and 647 transitions. [2025-03-14 01:17:15,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 302 transitions, 648 flow [2025-03-14 01:17:15,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 302 transitions, 642 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:15,357 INFO L231 Difference]: Finished difference. Result has 304 places, 302 transitions, 626 flow [2025-03-14 01:17:15,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=626, PETRI_PLACES=304, PETRI_TRANSITIONS=302} [2025-03-14 01:17:15,358 INFO L279 CegarLoopForPetriNet]: 335 programPoint places, -31 predicate places. [2025-03-14 01:17:15,358 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 302 transitions, 626 flow [2025-03-14 01:17:15,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 302.0) internal successors, (604), 2 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:15,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:15,358 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-03-14 01:17:15,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:17:15,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2025-03-14 01:17:15,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1259298778, now seen corresponding path program 1 times [2025-03-14 01:17:15,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:15,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689374872] [2025-03-14 01:17:15,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:15,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:15,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:17:15,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:17:15,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:15,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:15,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689374872] [2025-03-14 01:17:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689374872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:15,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:15,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:17:15,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922039945] [2025-03-14 01:17:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:15,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:15,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:15,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:15,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 350 [2025-03-14 01:17:15,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 302 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:15,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:15,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 350 [2025-03-14 01:17:15,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:22,246 INFO L124 PetriNetUnfolderBase]: 15440/65818 cut-off events. [2025-03-14 01:17:22,247 INFO L125 PetriNetUnfolderBase]: For 2056/2056 co-relation queries the response was YES. [2025-03-14 01:17:22,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88938 conditions, 65818 events. 15440/65818 cut-off events. For 2056/2056 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 923018 event pairs, 6393 based on Foata normal form. 0/55404 useless extension candidates. Maximal degree in co-relation 88931. Up to 16154 conditions per place. [2025-03-14 01:17:22,961 INFO L140 encePairwiseOnDemand]: 318/350 looper letters, 39 selfloop transitions, 24 changer transitions 0/329 dead transitions. [2025-03-14 01:17:22,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 329 transitions, 821 flow [2025-03-14 01:17:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 890 transitions. [2025-03-14 01:17:22,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-14 01:17:22,966 INFO L175 Difference]: Start difference. First operand has 304 places, 302 transitions, 626 flow. Second operand 3 states and 890 transitions. [2025-03-14 01:17:22,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 329 transitions, 821 flow [2025-03-14 01:17:22,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 329 transitions, 821 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:22,972 INFO L231 Difference]: Finished difference. Result has 308 places, 326 transitions, 834 flow [2025-03-14 01:17:22,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=308, PETRI_TRANSITIONS=326} [2025-03-14 01:17:22,973 INFO L279 CegarLoopForPetriNet]: 335 programPoint places, -27 predicate places. [2025-03-14 01:17:22,974 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 326 transitions, 834 flow [2025-03-14 01:17:22,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:22,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:22,975 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] [2025-03-14 01:17:22,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:17:22,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2025-03-14 01:17:22,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1954714459, now seen corresponding path program 1 times [2025-03-14 01:17:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556592136] [2025-03-14 01:17:22,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:22,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:17:22,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:17:22,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:22,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:23,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:23,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556592136] [2025-03-14 01:17:23,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556592136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:23,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:23,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:17:23,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518108964] [2025-03-14 01:17:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:23,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:23,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:23,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:23,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 350 [2025-03-14 01:17:23,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 326 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:17:23,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:23,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 350 [2025-03-14 01:17:23,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:26,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L693-->L704-1: Formula: (and (= |v_#race~now_serving~0_27| 0) (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_24 4294967296) .cse1))) (or (and (= |v_#race~next_ticket~0_83| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) .cse0 (= |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= 3 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)) (and (not .cse0) (= v_~next_ticket~0_56 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= v_~next_ticket~0_55 .cse1)))))) InVars {~now_serving~0=v_~now_serving~0_24, ~next_ticket~0=v_~next_ticket~0_56, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|} OutVars{~now_serving~0=v_~now_serving~0_24, #race~now_serving~0=|v_#race~now_serving~0_27|, ~next_ticket~0=v_~next_ticket~0_55, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, #race~next_ticket~0=|v_#race~next_ticket~0_83|, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|} AuxVars[] AssignedVars[~next_ticket~0, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, #race~now_serving~0, #race~next_ticket~0, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1][142], [338#true, 336#true, 172#L728-6true, 233#L713-1true, 191#L704-1true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 48#L713true, 330#true, 55#L734-2true, 342#(= |#race~now_serving~0| 0)]) [2025-03-14 01:17:26,397 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-14 01:17:26,397 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:17:26,397 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:17:26,397 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 01:17:26,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L693-->L704-1: Formula: (and (= |v_#race~now_serving~0_27| 0) (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_24 4294967296) .cse1))) (or (and (= |v_#race~next_ticket~0_83| 0) (= 3 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= v_~next_ticket~0_56 v_~next_ticket~0_55) .cse0 (= |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|)) (and (not .cse0) (= v_~next_ticket~0_55 .cse1) (= v_~next_ticket~0_56 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)))))) InVars {~now_serving~0=v_~now_serving~0_24, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|, ~next_ticket~0=v_~next_ticket~0_56} OutVars{~now_serving~0=v_~now_serving~0_24, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|, #race~now_serving~0=|v_#race~now_serving~0_27|, ~next_ticket~0=v_~next_ticket~0_55, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, #race~next_ticket~0=|v_#race~next_ticket~0_83|} AuxVars[] AssignedVars[~next_ticket~0, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1, #race~now_serving~0, #race~next_ticket~0][180], [338#true, 336#true, 18#L704-1true, 172#L728-6true, 233#L713-1true, 211#L713true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:26,610 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-14 01:17:26,610 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:17:26,610 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 01:17:26,610 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:17:26,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1229] L693-->L704-1: Formula: (and (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_24 4294967296) .cse1))) (or (and (not .cse0) (= v_~next_ticket~0_55 .cse1) (= v_~next_ticket~0_56 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)) (and (= |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= |v_#race~next_ticket~0_83| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) (= 3 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) .cse0)))) (= |v_#race~now_serving~0_27| 0)) InVars {~now_serving~0=v_~now_serving~0_24, ~next_ticket~0=v_~next_ticket~0_56, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|} OutVars{~now_serving~0=v_~now_serving~0_24, #race~now_serving~0=|v_#race~now_serving~0_27|, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, ~next_ticket~0=v_~next_ticket~0_55, #race~next_ticket~0=|v_#race~next_ticket~0_83|, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|} AuxVars[] AssignedVars[~next_ticket~0, #race~now_serving~0, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, #race~next_ticket~0, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1][107], [338#true, 336#true, 286#L704-1true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 12#L728-6true, 309#L713-1true, 48#L713true, 330#true, 55#L734-2true, 342#(= |#race~now_serving~0| 0)]) [2025-03-14 01:17:26,758 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-14 01:17:26,758 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:17:26,758 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 01:17:26,758 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:17:26,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L693-->L704-1: Formula: (and (= |v_#race~now_serving~0_27| 0) (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_24 4294967296) .cse1))) (or (and (= |v_#race~next_ticket~0_83| 0) (= 3 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= v_~next_ticket~0_56 v_~next_ticket~0_55) .cse0 (= |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|)) (and (not .cse0) (= v_~next_ticket~0_55 .cse1) (= v_~next_ticket~0_56 |v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)))))) InVars {~now_serving~0=v_~now_serving~0_24, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|, ~next_ticket~0=v_~next_ticket~0_56} OutVars{~now_serving~0=v_~now_serving~0_24, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|, #race~now_serving~0=|v_#race~now_serving~0_27|, ~next_ticket~0=v_~next_ticket~0_55, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, #race~next_ticket~0=|v_#race~next_ticket~0_83|} AuxVars[] AssignedVars[~next_ticket~0, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, thr1Thread4of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1, #race~now_serving~0, #race~next_ticket~0][180], [338#true, 9#L728-7true, 336#true, 18#L704-1true, 233#L713-1true, 211#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:26,843 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-14 01:17:26,843 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 01:17:26,843 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:17:26,843 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 01:17:26,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L693-->L704-1: Formula: (and (= |v_#race~now_serving~0_27| 0) (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_24 4294967296) .cse1))) (or (and (= |v_#race~next_ticket~0_83| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) .cse0 (= |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= 3 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)) (and (not .cse0) (= v_~next_ticket~0_56 |v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) (= v_~next_ticket~0_55 .cse1)))))) InVars {~now_serving~0=v_~now_serving~0_24, ~next_ticket~0=v_~next_ticket~0_56, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|} OutVars{~now_serving~0=v_~now_serving~0_24, #race~now_serving~0=|v_#race~now_serving~0_27|, ~next_ticket~0=v_~next_ticket~0_55, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, #race~next_ticket~0=|v_#race~next_ticket~0_83|, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|} AuxVars[] AssignedVars[~next_ticket~0, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, #race~now_serving~0, #race~next_ticket~0, thr1Thread3of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1][142], [338#true, 336#true, 9#L728-7true, 233#L713-1true, 191#L704-1true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 48#L713true, 330#true, 55#L734-2true, 342#(= |#race~now_serving~0| 0)]) [2025-03-14 01:17:26,852 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-14 01:17:26,852 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:17:26,852 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 01:17:26,853 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 01:17:26,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1229] L693-->L704-1: Formula: (and (let ((.cse1 (mod (mod (+ v_~next_ticket~0_56 1) 4294967296) 3))) (let ((.cse0 (= (mod v_~now_serving~0_24 4294967296) .cse1))) (or (and (not .cse0) (= v_~next_ticket~0_55 .cse1) (= v_~next_ticket~0_56 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|)) (and (= |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6| |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|) (= |v_#race~next_ticket~0_83| 0) (= v_~next_ticket~0_56 v_~next_ticket~0_55) (= 3 |v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|) .cse0)))) (= |v_#race~now_serving~0_27| 0)) InVars {~now_serving~0=v_~now_serving~0_24, ~next_ticket~0=v_~next_ticket~0_56, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_5|} OutVars{~now_serving~0=v_~now_serving~0_24, #race~now_serving~0=|v_#race~now_serving~0_27|, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1_13|, ~next_ticket~0=v_~next_ticket~0_55, #race~next_ticket~0=|v_#race~next_ticket~0_83|, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1=|v_thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1_6|} AuxVars[] AssignedVars[~next_ticket~0, #race~now_serving~0, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_~value~0#1, #race~next_ticket~0, thr1Thread1of4ForFork0_fetch_and_increment__next_ticket_#t~nondet3#1][107], [338#true, 336#true, 286#L704-1true, 328#L728-7true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 309#L713-1true, 48#L713true, 330#true, 55#L734-2true, 342#(= |#race~now_serving~0| 0)]) [2025-03-14 01:17:26,995 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-14 01:17:26,995 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:17:26,995 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 01:17:26,995 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 01:17:27,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 193#L727-1true, 286#L704-1true, 260#L726-6true, 211#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:27,339 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-03-14 01:17:27,339 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:17:27,340 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 01:17:27,340 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 01:17:27,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 172#L728-6true, 190#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 257#L704-1true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:27,563 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-03-14 01:17:27,563 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 01:17:27,563 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 01:17:27,563 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 01:17:27,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 9#L728-7true, 190#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 257#L704-1true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:27,856 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-14 01:17:27,856 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:17:27,856 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:17:27,856 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-14 01:17:27,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 286#L704-1true, 260#L726-6true, 211#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 12#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:27,907 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-14 01:17:27,907 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:17:27,907 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:17:27,907 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-14 01:17:28,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 9#L728-7true, 211#L713true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 257#L704-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:28,338 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-03-14 01:17:28,338 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 01:17:28,338 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 01:17:28,338 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 01:17:28,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 286#L704-1true, 328#L728-7true, 260#L726-6true, 211#L713true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:28,418 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-03-14 01:17:28,418 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 01:17:28,419 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-14 01:17:28,419 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 01:17:33,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 172#L728-6true, 190#L726-6true, 105#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:33,512 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-14 01:17:33,512 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:17:33,512 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-14 01:17:33,512 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:17:34,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 172#L728-6true, 190#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 244#L726-7true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:34,347 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-14 01:17:34,347 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:17:34,347 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:17:34,347 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-14 01:17:34,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 9#L728-7true, 336#true, 190#L726-6true, 105#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:34,364 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-14 01:17:34,364 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-14 01:17:34,364 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:17:34,364 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:17:35,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1085] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][219], [338#true, 336#true, 9#L728-7true, 190#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 244#L726-7true, 45#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:35,158 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-03-14 01:17:35,158 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-14 01:17:35,158 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:17:35,158 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:17:35,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 9#L728-7true, 336#true, 105#L726-6true, 211#L713true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:35,174 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-03-14 01:17:35,174 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:17:35,174 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:17:35,174 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:17:35,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 9#L728-7true, 211#L713true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 244#L726-7true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:35,979 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-14 01:17:35,979 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:17:35,979 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:17:35,979 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:17:36,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 328#L728-7true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 74#L726-6true, 332#true, Black: 340#true, 309#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:36,146 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2025-03-14 01:17:36,146 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-14 01:17:36,146 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:17:36,146 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-14 01:17:36,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 328#L728-7true, 260#L726-6true, 211#L713true, 347#(= |#race~c~0| 0), 334#true, 74#L726-6true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:36,767 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-03-14 01:17:36,767 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-14 01:17:36,767 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:17:36,767 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:17:37,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 328#L728-7true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 309#L713-1true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true, 256#L726-7true]) [2025-03-14 01:17:37,127 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-03-14 01:17:37,127 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-14 01:17:37,127 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:17:37,127 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-14 01:17:37,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 328#L728-7true, 211#L713true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 330#true, 256#L726-7true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:37,827 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-03-14 01:17:37,827 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:17:37,827 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-14 01:17:37,827 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-14 01:17:48,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 193#L727-1true, 286#L704-1true, 260#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true, 287#L721-6true]) [2025-03-14 01:17:48,398 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-03-14 01:17:48,398 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-14 01:17:48,398 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-14 01:17:48,398 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-14 01:17:49,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 172#L728-6true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 257#L704-1true, 330#true, 287#L721-6true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:49,802 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:17:49,802 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:17:49,802 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:17:49,802 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:17:49,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 286#L704-1true, 260#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 12#L728-6true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true, 287#L721-6true]) [2025-03-14 01:17:49,923 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-14 01:17:49,923 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:17:49,924 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 01:17:49,924 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-14 01:17:52,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 9#L728-7true, 260#L726-6true, 334#true, 347#(= |#race~c~0| 0), 332#true, Black: 340#true, 257#L704-1true, 330#true, 287#L721-6true, 342#(= |#race~now_serving~0| 0), 55#L734-2true]) [2025-03-14 01:17:52,417 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-03-14 01:17:52,417 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-14 01:17:52,417 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-14 01:17:52,417 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-14 01:17:52,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1166] L725-->L726-6: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][256], [338#true, 336#true, 286#L704-1true, 328#L728-7true, 260#L726-6true, 347#(= |#race~c~0| 0), 334#true, 332#true, Black: 340#true, 330#true, 342#(= |#race~now_serving~0| 0), 55#L734-2true, 287#L721-6true]) [2025-03-14 01:17:52,548 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-03-14 01:17:52,548 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-14 01:17:52,548 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-14 01:17:52,548 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event