./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.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-race-challenges/per-thread-array-join-counter.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 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:01:42,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:01:42,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-22 18:01:42,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:01:42,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:01:42,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:01:42,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:01:42,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:01:42,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:01:42,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:01:42,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:01:42,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:01:42,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:01:42,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:01:42,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:01:42,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:01:42,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:01:42,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:01:42,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:01:42,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:01:42,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:01:42,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:01:42,255 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-22 18:01:42,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:01:42,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:01:42,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:01:42,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:01:42,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:01:42,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:01:42,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:01:42,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:01:42,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:01:42,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:01:42,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:01:42,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 18:01:42,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:01:42,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:01:42,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:01:42,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:01:42,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:01:42,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:01:42,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 [2024-11-22 18:01:42,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:01:42,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:01:42,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:01:42,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:01:42,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:01:42,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2024-11-22 18:01:43,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:01:43,921 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:01:43,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2024-11-22 18:01:43,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72815660/b6db75b9ebc744e8a0103a51ecfa30de/FLAGccdce457c [2024-11-22 18:01:43,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e72815660/b6db75b9ebc744e8a0103a51ecfa30de [2024-11-22 18:01:43,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:01:43,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:01:43,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:01:43,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:01:43,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:01:43,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:01:43" (1/1) ... [2024-11-22 18:01:43,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6a5798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:43, skipping insertion in model container [2024-11-22 18:01:43,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:01:43" (1/1) ... [2024-11-22 18:01:43,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:01:44,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:01:44,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:01:44,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:01:44,448 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:01:44,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44 WrapperNode [2024-11-22 18:01:44,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:01:44,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:01:44,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:01:44,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:01:44,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,492 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 268 [2024-11-22 18:01:44,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:01:44,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:01:44,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:01:44,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:01:44,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:01:44,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:01:44,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:01:44,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:01:44,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (1/1) ... [2024-11-22 18:01:44,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:01:44,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:01:44,553 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) [2024-11-22 18:01:44,560 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 [2024-11-22 18:01:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:01:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-22 18:01:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 18:01:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 18:01:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-22 18:01:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:01:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:01:44,603 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-11-22 18:01:44,603 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-11-22 18:01:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 18:01:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-22 18:01:44,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-22 18:01:44,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:01:44,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:01:44,606 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 18:01:44,770 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:01:44,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:01:45,220 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 18:01:45,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:01:45,280 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:01:45,282 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-22 18:01:45,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:01:45 BoogieIcfgContainer [2024-11-22 18:01:45,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:01:45,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:01:45,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:01:45,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:01:45,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:01:43" (1/3) ... [2024-11-22 18:01:45,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18626672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:01:45, skipping insertion in model container [2024-11-22 18:01:45,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:01:44" (2/3) ... [2024-11-22 18:01:45,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18626672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:01:45, skipping insertion in model container [2024-11-22 18:01:45,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:01:45" (3/3) ... [2024-11-22 18:01:45,293 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter.i [2024-11-22 18:01:45,306 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:01:45,306 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-22 18:01:45,308 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 18:01:45,395 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-22 18:01:45,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 462 places, 471 transitions, 956 flow [2024-11-22 18:01:45,628 INFO L124 PetriNetUnfolderBase]: 21/590 cut-off events. [2024-11-22 18:01:45,628 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-22 18:01:45,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 590 events. 21/590 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 933 event pairs, 0 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 378. Up to 6 conditions per place. [2024-11-22 18:01:45,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 462 places, 471 transitions, 956 flow [2024-11-22 18:01:45,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 397 transitions, 804 flow [2024-11-22 18:01:45,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:01:45,674 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;@2e671006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:01:45,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-11-22 18:01:45,688 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 18:01:45,688 INFO L124 PetriNetUnfolderBase]: 0/147 cut-off events. [2024-11-22 18:01:45,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:01:45,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:45,690 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:45,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:45,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1980905397, now seen corresponding path program 1 times [2024-11-22 18:01:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:45,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715899736] [2024-11-22 18:01:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:46,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:46,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715899736] [2024-11-22 18:01:46,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715899736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:46,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:46,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:46,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129945766] [2024-11-22 18:01:46,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:46,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:46,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:46,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 471 [2024-11-22 18:01:46,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 397 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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) [2024-11-22 18:01:46,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:46,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 471 [2024-11-22 18:01:46,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:46,893 INFO L124 PetriNetUnfolderBase]: 654/4297 cut-off events. [2024-11-22 18:01:46,894 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-22 18:01:46,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5333 conditions, 4297 events. 654/4297 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 33318 event pairs, 489 based on Foata normal form. 182/3788 useless extension candidates. Maximal degree in co-relation 5101. Up to 1006 conditions per place. [2024-11-22 18:01:46,924 INFO L140 encePairwiseOnDemand]: 461/471 looper letters, 28 selfloop transitions, 2 changer transitions 1/387 dead transitions. [2024-11-22 18:01:46,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 387 transitions, 844 flow [2024-11-22 18:01:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2024-11-22 18:01:46,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9271054493984431 [2024-11-22 18:01:46,944 INFO L175 Difference]: Start difference. First operand has 392 places, 397 transitions, 804 flow. Second operand 3 states and 1310 transitions. [2024-11-22 18:01:46,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 387 transitions, 844 flow [2024-11-22 18:01:46,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 387 transitions, 843 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 18:01:46,960 INFO L231 Difference]: Finished difference. Result has 389 places, 386 transitions, 785 flow [2024-11-22 18:01:46,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=389, PETRI_TRANSITIONS=386} [2024-11-22 18:01:46,965 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -3 predicate places. [2024-11-22 18:01:46,967 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 386 transitions, 785 flow [2024-11-22 18:01:46,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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) [2024-11-22 18:01:46,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:46,968 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:01:46,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:46,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 793970282, now seen corresponding path program 1 times [2024-11-22 18:01:46,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:46,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018131837] [2024-11-22 18:01:46,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:46,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:47,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:47,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018131837] [2024-11-22 18:01:47,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018131837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:47,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:47,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:47,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298985410] [2024-11-22 18:01:47,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:47,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:47,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:47,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:47,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 471 [2024-11-22 18:01:47,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 386 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 415.0) internal successors, (1245), 3 states have internal predecessors, (1245), 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) [2024-11-22 18:01:47,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:47,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 471 [2024-11-22 18:01:47,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:47,727 INFO L124 PetriNetUnfolderBase]: 747/4740 cut-off events. [2024-11-22 18:01:47,727 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-22 18:01:47,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5927 conditions, 4740 events. 747/4740 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 38009 event pairs, 571 based on Foata normal form. 0/4015 useless extension candidates. Maximal degree in co-relation 5770. Up to 1153 conditions per place. [2024-11-22 18:01:47,758 INFO L140 encePairwiseOnDemand]: 463/471 looper letters, 31 selfloop transitions, 1 changer transitions 0/379 dead transitions. [2024-11-22 18:01:47,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 379 transitions, 835 flow [2024-11-22 18:01:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1281 transitions. [2024-11-22 18:01:47,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065817409766455 [2024-11-22 18:01:47,765 INFO L175 Difference]: Start difference. First operand has 389 places, 386 transitions, 785 flow. Second operand 3 states and 1281 transitions. [2024-11-22 18:01:47,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 379 transitions, 835 flow [2024-11-22 18:01:47,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 379 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:01:47,771 INFO L231 Difference]: Finished difference. Result has 381 places, 379 transitions, 769 flow [2024-11-22 18:01:47,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=381, PETRI_TRANSITIONS=379} [2024-11-22 18:01:47,772 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-22 18:01:47,772 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 379 transitions, 769 flow [2024-11-22 18:01:47,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.0) internal successors, (1245), 3 states have internal predecessors, (1245), 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) [2024-11-22 18:01:47,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:47,773 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:47,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:01:47,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:47,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1272139346, now seen corresponding path program 1 times [2024-11-22 18:01:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:47,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106105477] [2024-11-22 18:01:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:47,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:47,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106105477] [2024-11-22 18:01:47,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106105477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:47,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:47,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:47,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377161489] [2024-11-22 18:01:47,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:47,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:47,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:47,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:47,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:47,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 471 [2024-11-22 18:01:47,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 379 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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) [2024-11-22 18:01:47,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:47,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 471 [2024-11-22 18:01:47,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:48,472 INFO L124 PetriNetUnfolderBase]: 709/4527 cut-off events. [2024-11-22 18:01:48,472 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-22 18:01:48,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5661 conditions, 4527 events. 709/4527 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 36688 event pairs, 546 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 5504. Up to 1102 conditions per place. [2024-11-22 18:01:48,501 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 24 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-11-22 18:01:48,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 378 transitions, 819 flow [2024-11-22 18:01:48,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1311 transitions. [2024-11-22 18:01:48,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9278131634819533 [2024-11-22 18:01:48,504 INFO L175 Difference]: Start difference. First operand has 381 places, 379 transitions, 769 flow. Second operand 3 states and 1311 transitions. [2024-11-22 18:01:48,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 378 transitions, 819 flow [2024-11-22 18:01:48,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 378 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 18:01:48,509 INFO L231 Difference]: Finished difference. Result has 381 places, 378 transitions, 770 flow [2024-11-22 18:01:48,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=381, PETRI_TRANSITIONS=378} [2024-11-22 18:01:48,510 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-22 18:01:48,510 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 378 transitions, 770 flow [2024-11-22 18:01:48,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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) [2024-11-22 18:01:48,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:48,511 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:48,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:01:48,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:48,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2019363145, now seen corresponding path program 1 times [2024-11-22 18:01:48,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:48,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531858704] [2024-11-22 18:01:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:48,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:48,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531858704] [2024-11-22 18:01:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531858704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:48,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:48,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744553465] [2024-11-22 18:01:48,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:48,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:48,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:48,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:48,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 471 [2024-11-22 18:01:48,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 378 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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) [2024-11-22 18:01:48,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:48,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 471 [2024-11-22 18:01:48,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:49,116 INFO L124 PetriNetUnfolderBase]: 835/4398 cut-off events. [2024-11-22 18:01:49,117 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-22 18:01:49,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5696 conditions, 4398 events. 835/4398 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 33833 event pairs, 605 based on Foata normal form. 0/3758 useless extension candidates. Maximal degree in co-relation 5539. Up to 1258 conditions per place. [2024-11-22 18:01:49,142 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-11-22 18:01:49,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 377 transitions, 820 flow [2024-11-22 18:01:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2024-11-22 18:01:49,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9256900212314225 [2024-11-22 18:01:49,145 INFO L175 Difference]: Start difference. First operand has 381 places, 378 transitions, 770 flow. Second operand 3 states and 1308 transitions. [2024-11-22 18:01:49,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 377 transitions, 820 flow [2024-11-22 18:01:49,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:01:49,210 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2024-11-22 18:01:49,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=380, PETRI_TRANSITIONS=377} [2024-11-22 18:01:49,212 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2024-11-22 18:01:49,212 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2024-11-22 18:01:49,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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) [2024-11-22 18:01:49,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:49,213 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:49,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:01:49,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:49,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash -32302340, now seen corresponding path program 1 times [2024-11-22 18:01:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771885207] [2024-11-22 18:01:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:49,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771885207] [2024-11-22 18:01:49,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771885207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:49,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:49,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206943427] [2024-11-22 18:01:49,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:49,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:49,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:49,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:49,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:49,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 471 [2024-11-22 18:01:49,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2024-11-22 18:01:49,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:49,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 471 [2024-11-22 18:01:49,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:50,010 INFO L124 PetriNetUnfolderBase]: 991/4631 cut-off events. [2024-11-22 18:01:50,011 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-22 18:01:50,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6148 conditions, 4631 events. 991/4631 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 36419 event pairs, 713 based on Foata normal form. 0/3967 useless extension candidates. Maximal degree in co-relation 5991. Up to 1475 conditions per place. [2024-11-22 18:01:50,034 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 26 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-11-22 18:01:50,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 376 transitions, 822 flow [2024-11-22 18:01:50,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2024-11-22 18:01:50,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228591648973815 [2024-11-22 18:01:50,039 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1304 transitions. [2024-11-22 18:01:50,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 376 transitions, 822 flow [2024-11-22 18:01:50,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 376 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:01:50,043 INFO L231 Difference]: Finished difference. Result has 379 places, 376 transitions, 766 flow [2024-11-22 18:01:50,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=379, PETRI_TRANSITIONS=376} [2024-11-22 18:01:50,046 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2024-11-22 18:01:50,046 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 376 transitions, 766 flow [2024-11-22 18:01:50,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2024-11-22 18:01:50,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:50,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:50,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:01:50,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:50,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash 146436204, now seen corresponding path program 1 times [2024-11-22 18:01:50,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:50,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618925889] [2024-11-22 18:01:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618925889] [2024-11-22 18:01:50,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618925889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:50,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586963087] [2024-11-22 18:01:50,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:50,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:50,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:50,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:50,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:50,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 471 [2024-11-22 18:01:50,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 376 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 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) [2024-11-22 18:01:50,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:50,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 471 [2024-11-22 18:01:50,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:50,733 INFO L124 PetriNetUnfolderBase]: 1448/5230 cut-off events. [2024-11-22 18:01:50,733 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-22 18:01:50,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7424 conditions, 5230 events. 1448/5230 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40203 event pairs, 666 based on Foata normal form. 0/4647 useless extension candidates. Maximal degree in co-relation 7268. Up to 2100 conditions per place. [2024-11-22 18:01:50,758 INFO L140 encePairwiseOnDemand]: 463/471 looper letters, 38 selfloop transitions, 3 changer transitions 0/384 dead transitions. [2024-11-22 18:01:50,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 384 transitions, 869 flow [2024-11-22 18:01:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2024-11-22 18:01:50,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9179051663128096 [2024-11-22 18:01:50,761 INFO L175 Difference]: Start difference. First operand has 379 places, 376 transitions, 766 flow. Second operand 3 states and 1297 transitions. [2024-11-22 18:01:50,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 384 transitions, 869 flow [2024-11-22 18:01:50,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 384 transitions, 865 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:01:50,767 INFO L231 Difference]: Finished difference. Result has 375 places, 374 transitions, 773 flow [2024-11-22 18:01:50,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=375, PETRI_TRANSITIONS=374} [2024-11-22 18:01:50,769 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2024-11-22 18:01:50,770 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 374 transitions, 773 flow [2024-11-22 18:01:50,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 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) [2024-11-22 18:01:50,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:50,772 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:50,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:01:50,772 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:50,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2019436876, now seen corresponding path program 1 times [2024-11-22 18:01:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:50,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198075046] [2024-11-22 18:01:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:50,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198075046] [2024-11-22 18:01:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198075046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:50,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348895961] [2024-11-22 18:01:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:50,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:50,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:50,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:50,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 471 [2024-11-22 18:01:50,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 374 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2024-11-22 18:01:50,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:50,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 471 [2024-11-22 18:01:50,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:51,467 INFO L124 PetriNetUnfolderBase]: 1016/5687 cut-off events. [2024-11-22 18:01:51,467 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-22 18:01:51,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 5687 events. 1016/5687 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 48825 event pairs, 681 based on Foata normal form. 0/5046 useless extension candidates. Maximal degree in co-relation 7270. Up to 1521 conditions per place. [2024-11-22 18:01:51,497 INFO L140 encePairwiseOnDemand]: 465/471 looper letters, 30 selfloop transitions, 3 changer transitions 0/380 dead transitions. [2024-11-22 18:01:51,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 380 transitions, 851 flow [2024-11-22 18:01:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2024-11-22 18:01:51,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9299363057324841 [2024-11-22 18:01:51,500 INFO L175 Difference]: Start difference. First operand has 375 places, 374 transitions, 773 flow. Second operand 3 states and 1314 transitions. [2024-11-22 18:01:51,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 380 transitions, 851 flow [2024-11-22 18:01:51,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 380 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:01:51,505 INFO L231 Difference]: Finished difference. Result has 375 places, 374 transitions, 788 flow [2024-11-22 18:01:51,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=375, PETRI_TRANSITIONS=374} [2024-11-22 18:01:51,507 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2024-11-22 18:01:51,507 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 374 transitions, 788 flow [2024-11-22 18:01:51,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2024-11-22 18:01:51,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:51,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:51,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:01:51,509 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:51,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1849658247, now seen corresponding path program 1 times [2024-11-22 18:01:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699786763] [2024-11-22 18:01:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:51,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699786763] [2024-11-22 18:01:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699786763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:51,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:51,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:51,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061417723] [2024-11-22 18:01:51,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:51,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:51,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:51,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:51,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:51,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 471 [2024-11-22 18:01:51,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 374 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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) [2024-11-22 18:01:51,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:51,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 471 [2024-11-22 18:01:51,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:52,723 INFO L124 PetriNetUnfolderBase]: 1742/8115 cut-off events. [2024-11-22 18:01:52,723 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-22 18:01:52,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11185 conditions, 8115 events. 1742/8115 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 71738 event pairs, 642 based on Foata normal form. 0/7073 useless extension candidates. Maximal degree in co-relation 11028. Up to 1443 conditions per place. [2024-11-22 18:01:52,776 INFO L140 encePairwiseOnDemand]: 460/471 looper letters, 44 selfloop transitions, 8 changer transitions 0/398 dead transitions. [2024-11-22 18:01:52,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 398 transitions, 946 flow [2024-11-22 18:01:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1327 transitions. [2024-11-22 18:01:52,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9391365888181175 [2024-11-22 18:01:52,780 INFO L175 Difference]: Start difference. First operand has 375 places, 374 transitions, 788 flow. Second operand 3 states and 1327 transitions. [2024-11-22 18:01:52,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 398 transitions, 946 flow [2024-11-22 18:01:52,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 398 transitions, 946 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:01:52,786 INFO L231 Difference]: Finished difference. Result has 379 places, 382 transitions, 858 flow [2024-11-22 18:01:52,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=379, PETRI_TRANSITIONS=382} [2024-11-22 18:01:52,787 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2024-11-22 18:01:52,787 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 858 flow [2024-11-22 18:01:52,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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) [2024-11-22 18:01:52,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:52,788 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:52,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:01:52,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:52,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash -962895313, now seen corresponding path program 1 times [2024-11-22 18:01:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909925920] [2024-11-22 18:01:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:52,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:52,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909925920] [2024-11-22 18:01:52,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909925920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:52,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:52,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:52,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833009760] [2024-11-22 18:01:52,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:52,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:52,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:52,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 471 [2024-11-22 18:01:52,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 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) [2024-11-22 18:01:52,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:52,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 471 [2024-11-22 18:01:52,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:54,549 INFO L124 PetriNetUnfolderBase]: 2070/10589 cut-off events. [2024-11-22 18:01:54,550 INFO L125 PetriNetUnfolderBase]: For 268/280 co-relation queries the response was YES. [2024-11-22 18:01:54,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14691 conditions, 10589 events. 2070/10589 cut-off events. For 268/280 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 100956 event pairs, 1154 based on Foata normal form. 0/9574 useless extension candidates. Maximal degree in co-relation 14532. Up to 2624 conditions per place. [2024-11-22 18:01:54,642 INFO L140 encePairwiseOnDemand]: 466/471 looper letters, 35 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2024-11-22 18:01:54,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 392 transitions, 955 flow [2024-11-22 18:01:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1309 transitions. [2024-11-22 18:01:54,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9263977353149327 [2024-11-22 18:01:54,646 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 858 flow. Second operand 3 states and 1309 transitions. [2024-11-22 18:01:54,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 392 transitions, 955 flow [2024-11-22 18:01:54,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 392 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:01:54,657 INFO L231 Difference]: Finished difference. Result has 377 places, 381 transitions, 850 flow [2024-11-22 18:01:54,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=377, PETRI_TRANSITIONS=381} [2024-11-22 18:01:54,659 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2024-11-22 18:01:54,660 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 381 transitions, 850 flow [2024-11-22 18:01:54,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 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) [2024-11-22 18:01:54,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:54,661 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:54,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:01:54,661 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:54,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash 473249743, now seen corresponding path program 1 times [2024-11-22 18:01:54,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:54,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187909230] [2024-11-22 18:01:54,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:54,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187909230] [2024-11-22 18:01:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187909230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:54,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:54,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:54,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682782538] [2024-11-22 18:01:54,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:54,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:54,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:54,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:54,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 471 [2024-11-22 18:01:54,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 381 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2024-11-22 18:01:54,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:54,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 471 [2024-11-22 18:01:54,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:57,140 INFO L124 PetriNetUnfolderBase]: 4584/20530 cut-off events. [2024-11-22 18:01:57,140 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-22 18:01:57,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29256 conditions, 20530 events. 4584/20530 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 221123 event pairs, 2480 based on Foata normal form. 0/18588 useless extension candidates. Maximal degree in co-relation 29096. Up to 5342 conditions per place. [2024-11-22 18:01:57,287 INFO L140 encePairwiseOnDemand]: 461/471 looper letters, 45 selfloop transitions, 9 changer transitions 0/404 dead transitions. [2024-11-22 18:01:57,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 404 transitions, 1010 flow [2024-11-22 18:01:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:01:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:01:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1327 transitions. [2024-11-22 18:01:57,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9391365888181175 [2024-11-22 18:01:57,290 INFO L175 Difference]: Start difference. First operand has 377 places, 381 transitions, 850 flow. Second operand 3 states and 1327 transitions. [2024-11-22 18:01:57,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 404 transitions, 1010 flow [2024-11-22 18:01:57,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 404 transitions, 1010 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:01:57,296 INFO L231 Difference]: Finished difference. Result has 381 places, 389 transitions, 920 flow [2024-11-22 18:01:57,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=920, PETRI_PLACES=381, PETRI_TRANSITIONS=389} [2024-11-22 18:01:57,297 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-22 18:01:57,297 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 389 transitions, 920 flow [2024-11-22 18:01:57,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2024-11-22 18:01:57,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:57,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:57,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:01:57,298 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:57,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1798965973, now seen corresponding path program 1 times [2024-11-22 18:01:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:57,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040557134] [2024-11-22 18:01:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:57,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:57,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:57,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040557134] [2024-11-22 18:01:57,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040557134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:57,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:57,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:01:57,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468585760] [2024-11-22 18:01:57,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:57,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:01:57,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:57,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:01:57,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:01:57,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 471 [2024-11-22 18:01:57,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 389 transitions, 920 flow. Second operand has 5 states, 5 states have (on average 428.8) internal successors, (2144), 5 states have internal predecessors, (2144), 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) [2024-11-22 18:01:57,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:57,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 471 [2024-11-22 18:01:57,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:01:59,280 INFO L124 PetriNetUnfolderBase]: 2541/15468 cut-off events. [2024-11-22 18:01:59,280 INFO L125 PetriNetUnfolderBase]: For 498/562 co-relation queries the response was YES. [2024-11-22 18:01:59,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21806 conditions, 15468 events. 2541/15468 cut-off events. For 498/562 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 167608 event pairs, 1874 based on Foata normal form. 4/14031 useless extension candidates. Maximal degree in co-relation 21642. Up to 3397 conditions per place. [2024-11-22 18:01:59,401 INFO L140 encePairwiseOnDemand]: 462/471 looper letters, 36 selfloop transitions, 8 changer transitions 0/403 dead transitions. [2024-11-22 18:01:59,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 403 transitions, 1035 flow [2024-11-22 18:01:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:01:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 18:01:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2607 transitions. [2024-11-22 18:01:59,406 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9225053078556263 [2024-11-22 18:01:59,406 INFO L175 Difference]: Start difference. First operand has 381 places, 389 transitions, 920 flow. Second operand 6 states and 2607 transitions. [2024-11-22 18:01:59,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 403 transitions, 1035 flow [2024-11-22 18:01:59,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 403 transitions, 1017 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:01:59,417 INFO L231 Difference]: Finished difference. Result has 388 places, 393 transitions, 947 flow [2024-11-22 18:01:59,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=947, PETRI_PLACES=388, PETRI_TRANSITIONS=393} [2024-11-22 18:01:59,418 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -4 predicate places. [2024-11-22 18:01:59,418 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 393 transitions, 947 flow [2024-11-22 18:01:59,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 428.8) internal successors, (2144), 5 states have internal predecessors, (2144), 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) [2024-11-22 18:01:59,419 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:01:59,419 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:01:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:01:59,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:01:59,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:01:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash 359231543, now seen corresponding path program 1 times [2024-11-22 18:01:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:01:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777908653] [2024-11-22 18:01:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:01:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:01:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:01:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:01:59,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:01:59,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777908653] [2024-11-22 18:01:59,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777908653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:01:59,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:01:59,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:01:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798323323] [2024-11-22 18:01:59,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:01:59,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:01:59,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:01:59,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:01:59,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:01:59,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 471 [2024-11-22 18:01:59,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 393 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 436.6666666666667) internal successors, (1310), 3 states have internal predecessors, (1310), 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) [2024-11-22 18:01:59,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:01:59,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 471 [2024-11-22 18:01:59,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:02:01,628 INFO L124 PetriNetUnfolderBase]: 3409/17754 cut-off events. [2024-11-22 18:02:01,628 INFO L125 PetriNetUnfolderBase]: For 196/227 co-relation queries the response was YES. [2024-11-22 18:02:01,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25316 conditions, 17754 events. 3409/17754 cut-off events. For 196/227 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 194786 event pairs, 1915 based on Foata normal form. 2/15828 useless extension candidates. Maximal degree in co-relation 25148. Up to 3412 conditions per place. [2024-11-22 18:02:01,785 INFO L140 encePairwiseOnDemand]: 467/471 looper letters, 29 selfloop transitions, 3 changer transitions 0/404 dead transitions. [2024-11-22 18:02:01,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 404 transitions, 1036 flow [2024-11-22 18:02:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:02:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:02:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2024-11-22 18:02:01,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9469214437367304 [2024-11-22 18:02:01,788 INFO L175 Difference]: Start difference. First operand has 388 places, 393 transitions, 947 flow. Second operand 3 states and 1338 transitions. [2024-11-22 18:02:01,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 404 transitions, 1036 flow [2024-11-22 18:02:01,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 404 transitions, 1032 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 18:02:01,794 INFO L231 Difference]: Finished difference. Result has 391 places, 395 transitions, 965 flow [2024-11-22 18:02:01,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=965, PETRI_PLACES=391, PETRI_TRANSITIONS=395} [2024-11-22 18:02:01,795 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2024-11-22 18:02:01,795 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 395 transitions, 965 flow [2024-11-22 18:02:01,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 436.6666666666667) internal successors, (1310), 3 states have internal predecessors, (1310), 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) [2024-11-22 18:02:01,796 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:02:01,796 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:02:01,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 18:02:01,797 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:02:01,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:02:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1913080549, now seen corresponding path program 1 times [2024-11-22 18:02:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:02:01,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159207232] [2024-11-22 18:02:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:02:01,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:02:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:02:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:02:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:02:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159207232] [2024-11-22 18:02:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159207232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:02:01,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:02:01,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:02:01,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707593975] [2024-11-22 18:02:01,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:02:01,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:02:01,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:02:01,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:02:01,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:02:02,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 471 [2024-11-22 18:02:02,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 395 transitions, 965 flow. Second operand has 5 states, 5 states have (on average 429.0) internal successors, (2145), 5 states have internal predecessors, (2145), 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) [2024-11-22 18:02:02,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:02:02,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 471 [2024-11-22 18:02:02,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:02:05,004 INFO L124 PetriNetUnfolderBase]: 3863/20275 cut-off events. [2024-11-22 18:02:05,004 INFO L125 PetriNetUnfolderBase]: For 741/773 co-relation queries the response was YES. [2024-11-22 18:02:05,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29712 conditions, 20275 events. 3863/20275 cut-off events. For 741/773 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 226855 event pairs, 2596 based on Foata normal form. 6/18502 useless extension candidates. Maximal degree in co-relation 29541. Up to 5261 conditions per place. [2024-11-22 18:02:05,188 INFO L140 encePairwiseOnDemand]: 462/471 looper letters, 27 selfloop transitions, 4 changer transitions 17/407 dead transitions. [2024-11-22 18:02:05,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 407 transitions, 1080 flow [2024-11-22 18:02:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:02:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 18:02:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2608 transitions. [2024-11-22 18:02:05,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228591648973815 [2024-11-22 18:02:05,193 INFO L175 Difference]: Start difference. First operand has 391 places, 395 transitions, 965 flow. Second operand 6 states and 2608 transitions. [2024-11-22 18:02:05,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 407 transitions, 1080 flow [2024-11-22 18:02:05,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 407 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:02:05,207 INFO L231 Difference]: Finished difference. Result has 396 places, 390 transitions, 946 flow [2024-11-22 18:02:05,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=946, PETRI_PLACES=396, PETRI_TRANSITIONS=390} [2024-11-22 18:02:05,208 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 4 predicate places. [2024-11-22 18:02:05,208 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 390 transitions, 946 flow [2024-11-22 18:02:05,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 429.0) internal successors, (2145), 5 states have internal predecessors, (2145), 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) [2024-11-22 18:02:05,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:02:05,209 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:02:05,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:02:05,210 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:02:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:02:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2102859458, now seen corresponding path program 1 times [2024-11-22 18:02:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:02:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138811374] [2024-11-22 18:02:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:02:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:02:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:02:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:02:05,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:02:05,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138811374] [2024-11-22 18:02:05,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138811374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:02:05,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:02:05,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:02:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118678344] [2024-11-22 18:02:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:02:05,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:02:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:02:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:02:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:02:05,935 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 471 [2024-11-22 18:02:05,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 390 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 412.8333333333333) internal successors, (2477), 6 states have internal predecessors, (2477), 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) [2024-11-22 18:02:05,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:02:05,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 471 [2024-11-22 18:02:05,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:02:09,820 INFO L124 PetriNetUnfolderBase]: 9030/32036 cut-off events. [2024-11-22 18:02:09,820 INFO L125 PetriNetUnfolderBase]: For 2465/2588 co-relation queries the response was YES. [2024-11-22 18:02:10,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53446 conditions, 32036 events. 9030/32036 cut-off events. For 2465/2588 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 360813 event pairs, 4757 based on Foata normal form. 4/29082 useless extension candidates. Maximal degree in co-relation 53271. Up to 11109 conditions per place. [2024-11-22 18:02:10,193 INFO L140 encePairwiseOnDemand]: 457/471 looper letters, 95 selfloop transitions, 46 changer transitions 0/486 dead transitions. [2024-11-22 18:02:10,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 486 transitions, 1502 flow [2024-11-22 18:02:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:02:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 18:02:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2591 transitions. [2024-11-22 18:02:10,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9168435951875442 [2024-11-22 18:02:10,197 INFO L175 Difference]: Start difference. First operand has 396 places, 390 transitions, 946 flow. Second operand 6 states and 2591 transitions. [2024-11-22 18:02:10,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 486 transitions, 1502 flow [2024-11-22 18:02:10,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 486 transitions, 1474 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-11-22 18:02:10,217 INFO L231 Difference]: Finished difference. Result has 392 places, 435 transitions, 1253 flow [2024-11-22 18:02:10,218 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1253, PETRI_PLACES=392, PETRI_TRANSITIONS=435} [2024-11-22 18:02:10,218 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 0 predicate places. [2024-11-22 18:02:10,219 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 435 transitions, 1253 flow [2024-11-22 18:02:10,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 412.8333333333333) internal successors, (2477), 6 states have internal predecessors, (2477), 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) [2024-11-22 18:02:10,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:02:10,220 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:02:10,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:02:10,220 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:02:10,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:02:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1262754258, now seen corresponding path program 1 times [2024-11-22 18:02:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:02:10,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875235132] [2024-11-22 18:02:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:02:10,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:02:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:02:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:02:10,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:02:10,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875235132] [2024-11-22 18:02:10,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875235132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:02:10,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:02:10,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:02:10,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211328172] [2024-11-22 18:02:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:02:10,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:02:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:02:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:02:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:02:10,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 471 [2024-11-22 18:02:10,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 435 transitions, 1253 flow. Second operand has 7 states, 7 states have (on average 422.0) internal successors, (2954), 7 states have internal predecessors, (2954), 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) [2024-11-22 18:02:10,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:02:10,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 471 [2024-11-22 18:02:10,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:02:16,554 INFO L124 PetriNetUnfolderBase]: 9626/40438 cut-off events. [2024-11-22 18:02:16,554 INFO L125 PetriNetUnfolderBase]: For 3819/5854 co-relation queries the response was YES. [2024-11-22 18:02:16,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67040 conditions, 40438 events. 9626/40438 cut-off events. For 3819/5854 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 496878 event pairs, 4721 based on Foata normal form. 254/36575 useless extension candidates. Maximal degree in co-relation 66871. Up to 10838 conditions per place. [2024-11-22 18:02:16,821 INFO L140 encePairwiseOnDemand]: 459/471 looper letters, 64 selfloop transitions, 14 changer transitions 10/484 dead transitions. [2024-11-22 18:02:16,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 484 transitions, 1532 flow [2024-11-22 18:02:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:02:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 18:02:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4288 transitions. [2024-11-22 18:02:16,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9104033970276009 [2024-11-22 18:02:16,826 INFO L175 Difference]: Start difference. First operand has 392 places, 435 transitions, 1253 flow. Second operand 10 states and 4288 transitions. [2024-11-22 18:02:16,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 484 transitions, 1532 flow [2024-11-22 18:02:16,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 484 transitions, 1532 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:02:16,842 INFO L231 Difference]: Finished difference. Result has 405 places, 442 transitions, 1320 flow [2024-11-22 18:02:16,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1320, PETRI_PLACES=405, PETRI_TRANSITIONS=442} [2024-11-22 18:02:16,844 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 13 predicate places. [2024-11-22 18:02:16,844 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 442 transitions, 1320 flow [2024-11-22 18:02:16,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 422.0) internal successors, (2954), 7 states have internal predecessors, (2954), 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) [2024-11-22 18:02:16,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:02:16,846 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:02:16,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:02:16,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:02:16,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:02:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash -509119512, now seen corresponding path program 1 times [2024-11-22 18:02:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:02:16,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399544569] [2024-11-22 18:02:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:02:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:02:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:02:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:02:17,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:02:17,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399544569] [2024-11-22 18:02:17,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399544569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:02:17,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:02:17,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:02:17,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719051291] [2024-11-22 18:02:17,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:02:17,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:02:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:02:17,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:02:17,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:02:17,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 471 [2024-11-22 18:02:17,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 442 transitions, 1320 flow. Second operand has 8 states, 8 states have (on average 416.875) internal successors, (3335), 8 states have internal predecessors, (3335), 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) [2024-11-22 18:02:17,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:02:17,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 471 [2024-11-22 18:02:17,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:02:24,205 INFO L124 PetriNetUnfolderBase]: 11330/45550 cut-off events. [2024-11-22 18:02:24,206 INFO L125 PetriNetUnfolderBase]: For 15840/17581 co-relation queries the response was YES. [2024-11-22 18:02:24,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85247 conditions, 45550 events. 11330/45550 cut-off events. For 15840/17581 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 560008 event pairs, 3992 based on Foata normal form. 114/41861 useless extension candidates. Maximal degree in co-relation 85072. Up to 8193 conditions per place. [2024-11-22 18:02:24,617 INFO L140 encePairwiseOnDemand]: 458/471 looper letters, 101 selfloop transitions, 44 changer transitions 0/512 dead transitions. [2024-11-22 18:02:24,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 512 transitions, 1902 flow [2024-11-22 18:02:24,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:02:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 18:02:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4661 transitions. [2024-11-22 18:02:24,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8996332754294538 [2024-11-22 18:02:24,623 INFO L175 Difference]: Start difference. First operand has 405 places, 442 transitions, 1320 flow. Second operand 11 states and 4661 transitions. [2024-11-22 18:02:24,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 512 transitions, 1902 flow [2024-11-22 18:02:24,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 512 transitions, 1894 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 18:02:24,653 INFO L231 Difference]: Finished difference. Result has 415 places, 463 transitions, 1637 flow [2024-11-22 18:02:24,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1637, PETRI_PLACES=415, PETRI_TRANSITIONS=463} [2024-11-22 18:02:24,654 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 23 predicate places. [2024-11-22 18:02:24,654 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 463 transitions, 1637 flow [2024-11-22 18:02:24,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 416.875) internal successors, (3335), 8 states have internal predecessors, (3335), 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) [2024-11-22 18:02:24,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:02:24,656 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:02:24,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 18:02:24,656 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:02:24,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:02:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1061565791, now seen corresponding path program 1 times [2024-11-22 18:02:24,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:02:24,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583885571] [2024-11-22 18:02:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:02:24,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:02:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:02:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:02:24,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:02:24,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583885571] [2024-11-22 18:02:24,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583885571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:02:24,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:02:24,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:02:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334225778] [2024-11-22 18:02:24,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:02:24,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:02:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:02:24,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:02:24,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:02:24,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 433 out of 471 [2024-11-22 18:02:24,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 463 transitions, 1637 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 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) [2024-11-22 18:02:24,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:02:24,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 433 of 471 [2024-11-22 18:02:24,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:02:26,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][360], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), 225#L1066-11true, Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 454#L1040-7true, 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,305 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is cut-off event [2024-11-22 18:02:26,305 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-22 18:02:26,305 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-22 18:02:26,305 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-22 18:02:26,364 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][360], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), 225#L1066-11true, Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 454#L1040-7true, Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 537#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,365 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is not cut-off event [2024-11-22 18:02:26,365 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-22 18:02:26,365 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-22 18:02:26,365 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-22 18:02:26,365 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-22 18:02:26,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, 288#L1066-8true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 576#true, 28#L1043-4true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,548 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-22 18:02:26,548 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-22 18:02:26,548 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-22 18:02:26,548 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-22 18:02:26,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 537#true, 461#true, 17#L1066-9true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 28#L1043-4true, 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,566 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-22 18:02:26,566 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,566 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,567 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, 288#L1066-8true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 78#L1043-5true, 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,567 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-22 18:02:26,567 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,567 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,567 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,568 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, 288#L1066-8true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 537#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 28#L1043-4true, 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,569 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-22 18:02:26,569 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-22 18:02:26,569 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-22 18:02:26,569 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-22 18:02:26,569 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-22 18:02:26,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 28#L1043-4true, 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,590 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-22 18:02:26,590 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,590 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,590 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 537#true, 461#true, 17#L1066-9true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 78#L1043-5true, 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,591 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-22 18:02:26,591 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,591 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,591 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,592 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 537#true, 17#L1066-9true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 28#L1043-4true, 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,593 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-22 18:02:26,593 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-22 18:02:26,593 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,593 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,593 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,593 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, 288#L1066-8true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 537#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 78#L1043-5true, 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,593 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-22 18:02:26,594 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-22 18:02:26,594 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,594 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,594 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:26,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 78#L1043-5true, 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,618 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-22 18:02:26,618 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-22 18:02:26,618 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-22 18:02:26,618 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-22 18:02:26,620 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, Black: 493#true, 537#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 28#L1043-4true, 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,620 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-22 18:02:26,620 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,620 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,620 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,620 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-22 18:02:26,621 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 537#true, 17#L1066-9true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 78#L1043-5true, 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,621 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-22 18:02:26,621 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-22 18:02:26,621 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,621 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,621 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:26,647 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][389], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, Black: 493#true, 537#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 78#L1043-5true, 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:26,647 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-22 18:02:26,647 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-22 18:02:26,647 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-22 18:02:26,647 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-22 18:02:26,647 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-22 18:02:29,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L1041-2-->L1041-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_52| v_~flags_mutex~0.base_10)) (.cse1 (+ v_~flags_mutex~0.offset_10 (* v_cleanerThread1of1ForFork0_~i~1_9 24)))) (and (= (select .cse0 .cse1) 0) (= |v_#pthreadsMutex_51| (store |v_#pthreadsMutex_52| v_~flags_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork0_#t~ret10_1| 0))) InVars {~flags_mutex~0.offset=v_~flags_mutex~0.offset_10, #pthreadsMutex=|v_#pthreadsMutex_52|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~flags_mutex~0.base=v_~flags_mutex~0.base_10} OutVars{~flags_mutex~0.offset=v_~flags_mutex~0.offset_10, #pthreadsMutex=|v_#pthreadsMutex_51|, cleanerThread1of1ForFork0_#t~ret10=|v_cleanerThread1of1ForFork0_#t~ret10_1|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~flags_mutex~0.base=v_~flags_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork0_#t~ret10][230], [486#(= |#race~tids~0| 0), Black: 513#true, 470#(= |#race~threads_total~0| 0), 95#L1041-5true, Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 415#L1035-5true, Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 488#true, 559#(not (= ~flags~0.base ~tids~0.base)), Black: 493#true, 537#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), 144#L1077true, Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-22 18:02:29,919 INFO L294 olderBase$Statistics]: this new event has 412 ancestors and is cut-off event [2024-11-22 18:02:29,920 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2024-11-22 18:02:29,920 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2024-11-22 18:02:29,920 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2024-11-22 18:02:30,117 INFO L124 PetriNetUnfolderBase]: 7252/33184 cut-off events. [2024-11-22 18:02:30,117 INFO L125 PetriNetUnfolderBase]: For 13834/16685 co-relation queries the response was YES. [2024-11-22 18:02:30,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60903 conditions, 33184 events. 7252/33184 cut-off events. For 13834/16685 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 410163 event pairs, 3607 based on Foata normal form. 134/30707 useless extension candidates. Maximal degree in co-relation 60726. Up to 7571 conditions per place. [2024-11-22 18:02:30,437 INFO L140 encePairwiseOnDemand]: 466/471 looper letters, 32 selfloop transitions, 5 changer transitions 0/476 dead transitions. [2024-11-22 18:02:30,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 476 transitions, 1739 flow [2024-11-22 18:02:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:02:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:02:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1336 transitions. [2024-11-22 18:02:30,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9455060155697098 [2024-11-22 18:02:30,440 INFO L175 Difference]: Start difference. First operand has 415 places, 463 transitions, 1637 flow. Second operand 3 states and 1336 transitions. [2024-11-22 18:02:30,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 476 transitions, 1739 flow [2024-11-22 18:02:30,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 476 transitions, 1728 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 18:02:30,493 INFO L231 Difference]: Finished difference. Result has 413 places, 466 transitions, 1662 flow [2024-11-22 18:02:30,493 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1662, PETRI_PLACES=413, PETRI_TRANSITIONS=466} [2024-11-22 18:02:30,494 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 21 predicate places. [2024-11-22 18:02:30,494 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 466 transitions, 1662 flow [2024-11-22 18:02:30,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 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) [2024-11-22 18:02:30,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:02:30,495 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:02:30,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 18:02:30,495 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:02:30,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:02:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1897373624, now seen corresponding path program 1 times [2024-11-22 18:02:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:02:30,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568034109] [2024-11-22 18:02:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:02:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:02:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:02:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:02:30,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:02:30,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568034109] [2024-11-22 18:02:30,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568034109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:02:30,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:02:30,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:02:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196726592] [2024-11-22 18:02:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:02:30,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:02:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:02:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:02:30,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:02:30,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 471 [2024-11-22 18:02:30,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 466 transitions, 1662 flow. Second operand has 3 states, 3 states have (on average 428.6666666666667) internal successors, (1286), 3 states have internal predecessors, (1286), 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) [2024-11-22 18:02:30,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:02:30,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 471 [2024-11-22 18:02:30,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:02:32,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][359], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), 225#L1066-11true, Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 454#L1040-7true, 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 576#true, 581#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:32,547 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is cut-off event [2024-11-22 18:02:32,547 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-22 18:02:32,547 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-22 18:02:32,548 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-22 18:02:32,599 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][359], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), 225#L1066-11true, Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 454#L1040-7true, Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, 581#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:32,599 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is not cut-off event [2024-11-22 18:02:32,599 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-22 18:02:32,599 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-22 18:02:32,599 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-22 18:02:32,600 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-22 18:02:32,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][384], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), 225#L1066-11true, Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 132#L1042-5true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 537#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 576#true, 581#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:32,723 INFO L294 olderBase$Statistics]: this new event has 317 ancestors and is cut-off event [2024-11-22 18:02:32,723 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2024-11-22 18:02:32,723 INFO L297 olderBase$Statistics]: existing Event has 317 ancestors and is cut-off event [2024-11-22 18:02:32,723 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2024-11-22 18:02:32,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [486#(= |#race~tids~0| 0), 247#L1034-5true, 288#L1066-8true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 28#L1043-4true, 576#true, 527#true, 581#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:32,756 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-22 18:02:32,756 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-22 18:02:32,756 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-22 18:02:32,756 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-22 18:02:32,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 17#L1066-9true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 28#L1043-4true, 576#true, 527#true, 581#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:32,771 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-22 18:02:32,771 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:32,771 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:32,771 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:32,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [486#(= |#race~tids~0| 0), 247#L1034-5true, 288#L1066-8true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 78#L1043-5true, 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, 581#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:32,772 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-22 18:02:32,772 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:32,772 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:32,772 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:32,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 215#L1066-10true, Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 28#L1043-4true, 576#true, 527#true, 581#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:32,788 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-22 18:02:32,788 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:32,788 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:32,788 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:32,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 495#(= |#race~flags~0| 0), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 17#L1066-9true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 78#L1043-5true, 482#(= |#race~flags_mutex~0| 0), 576#true, 581#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:32,789 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-22 18:02:32,789 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:32,789 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:32,789 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-22 18:02:32,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1003] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][386], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 215#L1066-10true, Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 78#L1043-5true, 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, 581#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:32,807 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-22 18:02:32,807 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-22 18:02:32,807 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-22 18:02:32,807 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-22 18:02:36,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L1035-2-->L1035-5: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret9_1| 0) (= (store |v_#pthreadsMutex_116| v_~flags_mutex~0.base_18 (store (select |v_#pthreadsMutex_116| v_~flags_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~flags_mutex~0.offset_18) 0)) |v_#pthreadsMutex_115|)) InVars {~flags_mutex~0.offset=v_~flags_mutex~0.offset_18, #pthreadsMutex=|v_#pthreadsMutex_116|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~flags_mutex~0.base=v_~flags_mutex~0.base_18} OutVars{~flags_mutex~0.offset=v_~flags_mutex~0.offset_18, #pthreadsMutex=|v_#pthreadsMutex_115|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~flags_mutex~0.base=v_~flags_mutex~0.base_18, threadThread1of1ForFork1_#t~ret9=|v_threadThread1of1ForFork1_#t~ret9_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret9][393], [486#(= |#race~tids~0| 0), 583#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet36#1|), Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 415#L1035-5true, Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 461#true, 140#L1050-4true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 372#L1068-6true, 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:36,703 INFO L294 olderBase$Statistics]: this new event has 400 ancestors and is cut-off event [2024-11-22 18:02:36,703 INFO L297 olderBase$Statistics]: existing Event has 379 ancestors and is cut-off event [2024-11-22 18:02:36,703 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-22 18:02:36,703 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-22 18:02:36,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L1035-2-->L1035-5: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret9_1| 0) (= (store |v_#pthreadsMutex_116| v_~flags_mutex~0.base_18 (store (select |v_#pthreadsMutex_116| v_~flags_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~flags_mutex~0.offset_18) 0)) |v_#pthreadsMutex_115|)) InVars {~flags_mutex~0.offset=v_~flags_mutex~0.offset_18, #pthreadsMutex=|v_#pthreadsMutex_116|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~flags_mutex~0.base=v_~flags_mutex~0.base_18} OutVars{~flags_mutex~0.offset=v_~flags_mutex~0.offset_18, #pthreadsMutex=|v_#pthreadsMutex_115|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~flags_mutex~0.base=v_~flags_mutex~0.base_18, threadThread1of1ForFork1_#t~ret9=|v_threadThread1of1ForFork1_#t~ret9_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret9][393], [486#(= |#race~tids~0| 0), 451#L1068-7true, 583#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet36#1|), Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), Black: 515#(= |#race~data~0| 0), 470#(= |#race~threads_total~0| 0), Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 415#L1035-5true, Black: 480#true, 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 484#true, Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 490#(= |#race~threads_alive~0| 0), 537#true, Black: 493#true, 461#true, 140#L1050-4true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 576#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 559#(not (= ~flags~0.base ~tids~0.base))]) [2024-11-22 18:02:36,733 INFO L294 olderBase$Statistics]: this new event has 401 ancestors and is cut-off event [2024-11-22 18:02:36,733 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-22 18:02:36,733 INFO L297 olderBase$Statistics]: existing Event has 380 ancestors and is cut-off event [2024-11-22 18:02:36,733 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-22 18:02:37,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L1041-2-->L1041-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_52| v_~flags_mutex~0.base_10)) (.cse1 (+ v_~flags_mutex~0.offset_10 (* v_cleanerThread1of1ForFork0_~i~1_9 24)))) (and (= (select .cse0 .cse1) 0) (= |v_#pthreadsMutex_51| (store |v_#pthreadsMutex_52| v_~flags_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork0_#t~ret10_1| 0))) InVars {~flags_mutex~0.offset=v_~flags_mutex~0.offset_10, #pthreadsMutex=|v_#pthreadsMutex_52|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~flags_mutex~0.base=v_~flags_mutex~0.base_10} OutVars{~flags_mutex~0.offset=v_~flags_mutex~0.offset_10, #pthreadsMutex=|v_#pthreadsMutex_51|, cleanerThread1of1ForFork0_#t~ret10=|v_cleanerThread1of1ForFork0_#t~ret10_1|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~flags_mutex~0.base=v_~flags_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork0_#t~ret10][230], [486#(= |#race~tids~0| 0), Black: 513#true, Black: 578#(= |threadThread1of1ForFork1_#t~nondet5| |#race~data~0|), 470#(= |#race~threads_total~0| 0), 95#L1041-5true, Black: 529#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 495#(= |#race~flags~0| 0), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 532#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 531#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 180#ULTIMATE.startFINALtrue, 415#L1035-5true, Black: 480#true, 463#true, Black: 543#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 541#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#true, Black: 549#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 488#true, 559#(not (= ~flags~0.base ~tids~0.base)), Black: 493#true, 537#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), 576#true, 581#true, 527#true, Black: 560#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 571#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-22 18:02:37,103 INFO L294 olderBase$Statistics]: this new event has 421 ancestors and is cut-off event [2024-11-22 18:02:37,103 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-22 18:02:37,104 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-22 18:02:37,104 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-22 18:02:37,314 INFO L124 PetriNetUnfolderBase]: 9047/41834 cut-off events. [2024-11-22 18:02:37,314 INFO L125 PetriNetUnfolderBase]: For 17863/19552 co-relation queries the response was YES. [2024-11-22 18:02:37,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79606 conditions, 41834 events. 9047/41834 cut-off events. For 17863/19552 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 529795 event pairs, 4665 based on Foata normal form. 169/38621 useless extension candidates. Maximal degree in co-relation 79427. Up to 10145 conditions per place. [2024-11-22 18:02:37,724 INFO L140 encePairwiseOnDemand]: 465/471 looper letters, 40 selfloop transitions, 7 changer transitions 0/480 dead transitions. [2024-11-22 18:02:37,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 480 transitions, 1793 flow [2024-11-22 18:02:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:02:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:02:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1320 transitions. [2024-11-22 18:02:37,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9341825902335457 [2024-11-22 18:02:37,727 INFO L175 Difference]: Start difference. First operand has 413 places, 466 transitions, 1662 flow. Second operand 3 states and 1320 transitions. [2024-11-22 18:02:37,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 480 transitions, 1793 flow [2024-11-22 18:02:37,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 480 transitions, 1783 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:02:37,823 INFO L231 Difference]: Finished difference. Result has 415 places, 471 transitions, 1708 flow [2024-11-22 18:02:37,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1708, PETRI_PLACES=415, PETRI_TRANSITIONS=471} [2024-11-22 18:02:37,823 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 23 predicate places. [2024-11-22 18:02:37,824 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 471 transitions, 1708 flow [2024-11-22 18:02:37,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.6666666666667) internal successors, (1286), 3 states have internal predecessors, (1286), 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) [2024-11-22 18:02:37,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:02:37,824 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:02:37,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 18:02:37,825 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-22 18:02:37,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:02:37,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1369570610, now seen corresponding path program 1 times [2024-11-22 18:02:37,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:02:37,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956291258] [2024-11-22 18:02:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:02:37,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:02:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:02:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:02:38,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:02:38,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956291258] [2024-11-22 18:02:38,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956291258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:02:38,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:02:38,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:02:38,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435020399] [2024-11-22 18:02:38,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:02:38,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:02:38,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:02:38,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:02:38,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:02:39,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 471 [2024-11-22 18:02:39,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 471 transitions, 1708 flow. Second operand has 11 states, 11 states have (on average 405.72727272727275) internal successors, (4463), 11 states have internal predecessors, (4463), 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) [2024-11-22 18:02:39,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:02:39,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 471 [2024-11-22 18:02:39,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand