./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-race-2.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 534bdd637f5e5b671357d3ac8ec1b617321ae1d1d7a44132336275a64f61ed0f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:04:49,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:04:49,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:04:49,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:04:49,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:04:49,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:04:49,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:04:49,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:04:49,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:04:49,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:04:49,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:04:49,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:04:49,491 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:04:49,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:04:49,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:04:49,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:04:49,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:04:49,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:04:49,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:04:49,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:04:49,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:04:49,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:04:49,498 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:04:49,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:04:49,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:04:49,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:04:49,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:04:49,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:04:49,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:04:49,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:04:49,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:04:49,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:04:49,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:04:49,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:04:49,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:04:49,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:04:49,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:04:49,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:04:49,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:04:49,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:04:49,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:04:49,508 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 -> 534bdd637f5e5b671357d3ac8ec1b617321ae1d1d7a44132336275a64f61ed0f [2024-11-09 07:04:49,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:04:49,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:04:49,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:04:49,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:04:49,799 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:04:49,801 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-race-2.i [2024-11-09 07:04:51,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:04:51,590 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:04:51,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i [2024-11-09 07:04:51,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c746c15/7328edff7527447b8f069c400d513b0b/FLAG57df62efc [2024-11-09 07:04:51,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c746c15/7328edff7527447b8f069c400d513b0b [2024-11-09 07:04:51,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:04:51,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:04:51,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:04:51,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:04:51,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:04:51,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:04:51" (1/1) ... [2024-11-09 07:04:51,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5719bc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:51, skipping insertion in model container [2024-11-09 07:04:51,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:04:51" (1/1) ... [2024-11-09 07:04:51,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:04:52,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:04:52,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:04:52,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:04:52,336 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:04:52,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52 WrapperNode [2024-11-09 07:04:52,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:04:52,356 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:04:52,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:04:52,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:04:52,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,431 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 268 [2024-11-09 07:04:52,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:04:52,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:04:52,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:04:52,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:04:52,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:04:52,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:04:52,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:04:52,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:04:52,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (1/1) ... [2024-11-09 07:04:52,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:04:52,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:04:52,519 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-09 07:04:52,522 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-09 07:04:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:04:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 07:04:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:04:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:04:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 07:04:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:04:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:04:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-11-09 07:04:52,573 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-11-09 07:04:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:04:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-09 07:04:52,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-09 07:04:52,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:04:52,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:04:52,576 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:04:52,781 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:04:52,783 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:04:53,352 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:04:53,352 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:04:53,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:04:53,405 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 07:04:53,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:04:53 BoogieIcfgContainer [2024-11-09 07:04:53,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:04:53,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:04:53,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:04:53,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:04:53,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:04:51" (1/3) ... [2024-11-09 07:04:53,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddd3bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:04:53, skipping insertion in model container [2024-11-09 07:04:53,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:04:52" (2/3) ... [2024-11-09 07:04:53,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddd3bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:04:53, skipping insertion in model container [2024-11-09 07:04:53,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:04:53" (3/3) ... [2024-11-09 07:04:53,417 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-2.i [2024-11-09 07:04:53,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:04:53,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-09 07:04:53,434 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:04:53,536 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 07:04:53,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 462 places, 471 transitions, 956 flow [2024-11-09 07:04:53,853 INFO L124 PetriNetUnfolderBase]: 21/590 cut-off events. [2024-11-09 07:04:53,853 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:04:53,872 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-09 07:04:53,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 462 places, 471 transitions, 956 flow [2024-11-09 07:04:53,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 397 transitions, 804 flow [2024-11-09 07:04:53,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:04:53,909 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;@77a0fa2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:04:53,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-11-09 07:04:53,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:04:53,934 INFO L124 PetriNetUnfolderBase]: 0/147 cut-off events. [2024-11-09 07:04:53,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:04:53,935 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:53,936 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-09 07:04:53,936 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-09 07:04:53,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:53,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1980905397, now seen corresponding path program 1 times [2024-11-09 07:04:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:53,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654450012] [2024-11-09 07:04:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:53,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:54,390 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-09 07:04:54,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:54,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654450012] [2024-11-09 07:04:54,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654450012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:54,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:54,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196639787] [2024-11-09 07:04:54,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:54,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:54,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:54,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:54,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 471 [2024-11-09 07:04:54,529 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-09 07:04:54,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:54,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 471 [2024-11-09 07:04:54,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:55,575 INFO L124 PetriNetUnfolderBase]: 654/4297 cut-off events. [2024-11-09 07:04:55,575 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-09 07:04:55,591 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-09 07:04:55,615 INFO L140 encePairwiseOnDemand]: 461/471 looper letters, 28 selfloop transitions, 2 changer transitions 1/387 dead transitions. [2024-11-09 07:04:55,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 387 transitions, 844 flow [2024-11-09 07:04:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2024-11-09 07:04:55,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9271054493984431 [2024-11-09 07:04:55,643 INFO L175 Difference]: Start difference. First operand has 392 places, 397 transitions, 804 flow. Second operand 3 states and 1310 transitions. [2024-11-09 07:04:55,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 387 transitions, 844 flow [2024-11-09 07:04:55,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 387 transitions, 843 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:04:55,662 INFO L231 Difference]: Finished difference. Result has 389 places, 386 transitions, 785 flow [2024-11-09 07:04:55,666 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-09 07:04:55,673 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -3 predicate places. [2024-11-09 07:04:55,674 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 386 transitions, 785 flow [2024-11-09 07:04:55,675 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-09 07:04:55,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:55,675 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-09 07:04:55,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:04:55,676 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-09 07:04:55,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 793970282, now seen corresponding path program 1 times [2024-11-09 07:04:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:55,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344301533] [2024-11-09 07:04:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:55,918 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-09 07:04:55,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344301533] [2024-11-09 07:04:55,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344301533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:55,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:55,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:55,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252658353] [2024-11-09 07:04:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:55,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:55,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:55,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:55,970 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 471 [2024-11-09 07:04:55,972 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-09 07:04:55,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:55,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 471 [2024-11-09 07:04:55,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:56,823 INFO L124 PetriNetUnfolderBase]: 747/4740 cut-off events. [2024-11-09 07:04:56,824 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-09 07:04:56,841 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-09 07:04:56,862 INFO L140 encePairwiseOnDemand]: 463/471 looper letters, 31 selfloop transitions, 1 changer transitions 0/379 dead transitions. [2024-11-09 07:04:56,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 379 transitions, 835 flow [2024-11-09 07:04:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1281 transitions. [2024-11-09 07:04:56,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065817409766455 [2024-11-09 07:04:56,866 INFO L175 Difference]: Start difference. First operand has 389 places, 386 transitions, 785 flow. Second operand 3 states and 1281 transitions. [2024-11-09 07:04:56,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 379 transitions, 835 flow [2024-11-09 07:04:56,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 379 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:04:56,876 INFO L231 Difference]: Finished difference. Result has 381 places, 379 transitions, 769 flow [2024-11-09 07:04:56,877 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-09 07:04:56,878 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-09 07:04:56,878 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 379 transitions, 769 flow [2024-11-09 07:04:56,879 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-09 07:04:56,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:56,880 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-09 07:04:56,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:04:56,880 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-09 07:04:56,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:56,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1272139346, now seen corresponding path program 1 times [2024-11-09 07:04:56,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:56,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948921509] [2024-11-09 07:04:56,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:56,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:57,032 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-09 07:04:57,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:57,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948921509] [2024-11-09 07:04:57,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948921509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:57,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:57,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:57,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414448643] [2024-11-09 07:04:57,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:57,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:57,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:57,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:57,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 471 [2024-11-09 07:04:57,120 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-09 07:04:57,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:57,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 471 [2024-11-09 07:04:57,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:57,920 INFO L124 PetriNetUnfolderBase]: 709/4527 cut-off events. [2024-11-09 07:04:57,921 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-09 07:04:57,939 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-09 07:04:57,966 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 24 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-11-09 07:04:57,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 378 transitions, 819 flow [2024-11-09 07:04:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1311 transitions. [2024-11-09 07:04:57,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9278131634819533 [2024-11-09 07:04:57,971 INFO L175 Difference]: Start difference. First operand has 381 places, 379 transitions, 769 flow. Second operand 3 states and 1311 transitions. [2024-11-09 07:04:57,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 378 transitions, 819 flow [2024-11-09 07:04:57,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 378 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:04:57,982 INFO L231 Difference]: Finished difference. Result has 381 places, 378 transitions, 770 flow [2024-11-09 07:04:57,983 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-09 07:04:57,985 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-09 07:04:57,985 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 378 transitions, 770 flow [2024-11-09 07:04:57,986 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-09 07:04:57,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:57,987 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-09 07:04:57,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:04:57,989 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-09 07:04:57,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2019363145, now seen corresponding path program 1 times [2024-11-09 07:04:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865569079] [2024-11-09 07:04:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:58,102 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-09 07:04:58,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:58,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865569079] [2024-11-09 07:04:58,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865569079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:58,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:58,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119576701] [2024-11-09 07:04:58,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:58,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:58,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:58,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:58,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 471 [2024-11-09 07:04:58,144 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-09 07:04:58,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:58,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 471 [2024-11-09 07:04:58,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:58,929 INFO L124 PetriNetUnfolderBase]: 835/4398 cut-off events. [2024-11-09 07:04:58,930 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-09 07:04:58,948 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-09 07:04:58,967 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-11-09 07:04:58,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 377 transitions, 820 flow [2024-11-09 07:04:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:04:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:04:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2024-11-09 07:04:58,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9256900212314225 [2024-11-09 07:04:58,972 INFO L175 Difference]: Start difference. First operand has 381 places, 378 transitions, 770 flow. Second operand 3 states and 1308 transitions. [2024-11-09 07:04:58,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 377 transitions, 820 flow [2024-11-09 07:04:58,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:04:58,979 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2024-11-09 07:04:58,980 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-09 07:04:58,981 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2024-11-09 07:04:58,982 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2024-11-09 07:04:58,983 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-09 07:04:58,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:04:58,984 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-09 07:04:58,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:04:58,984 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-09 07:04:58,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:58,985 INFO L85 PathProgramCache]: Analyzing trace with hash -32302340, now seen corresponding path program 1 times [2024-11-09 07:04:58,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:04:58,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700382190] [2024-11-09 07:04:58,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:58,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:59,084 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-09 07:04:59,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:04:59,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700382190] [2024-11-09 07:04:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700382190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:59,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:59,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:04:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104566096] [2024-11-09 07:04:59,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:59,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:04:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:04:59,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:04:59,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:04:59,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 471 [2024-11-09 07:04:59,132 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-09 07:04:59,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:04:59,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 471 [2024-11-09 07:04:59,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:04:59,979 INFO L124 PetriNetUnfolderBase]: 991/4631 cut-off events. [2024-11-09 07:04:59,980 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-09 07:04:59,996 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-09 07:05:00,015 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 26 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-11-09 07:05:00,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 376 transitions, 822 flow [2024-11-09 07:05:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2024-11-09 07:05:00,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228591648973815 [2024-11-09 07:05:00,020 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1304 transitions. [2024-11-09 07:05:00,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 376 transitions, 822 flow [2024-11-09 07:05:00,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 376 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:05:00,028 INFO L231 Difference]: Finished difference. Result has 379 places, 376 transitions, 766 flow [2024-11-09 07:05:00,029 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-09 07:05:00,029 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2024-11-09 07:05:00,030 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 376 transitions, 766 flow [2024-11-09 07:05:00,031 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-09 07:05:00,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:00,031 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-09 07:05:00,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:05:00,032 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-09 07:05:00,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash 146436204, now seen corresponding path program 1 times [2024-11-09 07:05:00,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:00,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391208726] [2024-11-09 07:05:00,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:00,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:00,131 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-09 07:05:00,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:00,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391208726] [2024-11-09 07:05:00,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391208726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:00,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:00,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:00,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853275275] [2024-11-09 07:05:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:00,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:00,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:00,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:00,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 471 [2024-11-09 07:05:00,172 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-09 07:05:00,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:00,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 471 [2024-11-09 07:05:00,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:00,965 INFO L124 PetriNetUnfolderBase]: 1448/5230 cut-off events. [2024-11-09 07:05:00,965 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-09 07:05:00,981 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-09 07:05:01,001 INFO L140 encePairwiseOnDemand]: 463/471 looper letters, 38 selfloop transitions, 3 changer transitions 0/384 dead transitions. [2024-11-09 07:05:01,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 384 transitions, 869 flow [2024-11-09 07:05:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2024-11-09 07:05:01,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9179051663128096 [2024-11-09 07:05:01,005 INFO L175 Difference]: Start difference. First operand has 379 places, 376 transitions, 766 flow. Second operand 3 states and 1297 transitions. [2024-11-09 07:05:01,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 384 transitions, 869 flow [2024-11-09 07:05:01,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 384 transitions, 865 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:05:01,014 INFO L231 Difference]: Finished difference. Result has 375 places, 374 transitions, 773 flow [2024-11-09 07:05:01,014 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-09 07:05:01,015 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2024-11-09 07:05:01,015 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 374 transitions, 773 flow [2024-11-09 07:05:01,016 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-09 07:05:01,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:01,017 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-09 07:05:01,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:05:01,017 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-09 07:05:01,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2019436876, now seen corresponding path program 1 times [2024-11-09 07:05:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:01,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796362918] [2024-11-09 07:05:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:01,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:01,106 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-09 07:05:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:01,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796362918] [2024-11-09 07:05:01,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796362918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:01,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:01,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792014697] [2024-11-09 07:05:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:01,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:01,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:01,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 471 [2024-11-09 07:05:01,129 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-09 07:05:01,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:01,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 471 [2024-11-09 07:05:01,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:01,928 INFO L124 PetriNetUnfolderBase]: 1016/5687 cut-off events. [2024-11-09 07:05:01,928 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-09 07:05:01,964 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-09 07:05:01,989 INFO L140 encePairwiseOnDemand]: 465/471 looper letters, 30 selfloop transitions, 3 changer transitions 0/380 dead transitions. [2024-11-09 07:05:01,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 380 transitions, 851 flow [2024-11-09 07:05:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2024-11-09 07:05:01,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9299363057324841 [2024-11-09 07:05:01,993 INFO L175 Difference]: Start difference. First operand has 375 places, 374 transitions, 773 flow. Second operand 3 states and 1314 transitions. [2024-11-09 07:05:01,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 380 transitions, 851 flow [2024-11-09 07:05:01,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 380 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:02,000 INFO L231 Difference]: Finished difference. Result has 375 places, 374 transitions, 788 flow [2024-11-09 07:05:02,001 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-09 07:05:02,002 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2024-11-09 07:05:02,002 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 374 transitions, 788 flow [2024-11-09 07:05:02,003 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-09 07:05:02,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:02,003 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-09 07:05:02,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:05:02,004 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-09 07:05:02,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:02,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1849658247, now seen corresponding path program 1 times [2024-11-09 07:05:02,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:02,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470334130] [2024-11-09 07:05:02,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:02,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:02,115 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-09 07:05:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470334130] [2024-11-09 07:05:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470334130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:02,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:02,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759673241] [2024-11-09 07:05:02,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:02,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:02,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 471 [2024-11-09 07:05:02,158 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-09 07:05:02,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:02,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 471 [2024-11-09 07:05:02,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:03,830 INFO L124 PetriNetUnfolderBase]: 1742/8115 cut-off events. [2024-11-09 07:05:03,830 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-09 07:05:03,859 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-09 07:05:03,886 INFO L140 encePairwiseOnDemand]: 460/471 looper letters, 44 selfloop transitions, 8 changer transitions 0/398 dead transitions. [2024-11-09 07:05:03,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 398 transitions, 946 flow [2024-11-09 07:05:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1327 transitions. [2024-11-09 07:05:03,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9391365888181175 [2024-11-09 07:05:03,890 INFO L175 Difference]: Start difference. First operand has 375 places, 374 transitions, 788 flow. Second operand 3 states and 1327 transitions. [2024-11-09 07:05:03,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 398 transitions, 946 flow [2024-11-09 07:05:03,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 398 transitions, 946 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:03,897 INFO L231 Difference]: Finished difference. Result has 379 places, 382 transitions, 858 flow [2024-11-09 07:05:03,898 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-09 07:05:03,898 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2024-11-09 07:05:03,898 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 858 flow [2024-11-09 07:05:03,899 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-09 07:05:03,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:03,900 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-09 07:05:03,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:05:03,900 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-09 07:05:03,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:03,901 INFO L85 PathProgramCache]: Analyzing trace with hash -962895313, now seen corresponding path program 1 times [2024-11-09 07:05:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033672337] [2024-11-09 07:05:03,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:03,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:03,986 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-09 07:05:03,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033672337] [2024-11-09 07:05:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033672337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:03,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:03,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:03,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864118205] [2024-11-09 07:05:03,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:03,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:03,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:03,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:03,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:04,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 471 [2024-11-09 07:05:04,009 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-09 07:05:04,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:04,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 471 [2024-11-09 07:05:04,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:05,846 INFO L124 PetriNetUnfolderBase]: 2070/10589 cut-off events. [2024-11-09 07:05:05,846 INFO L125 PetriNetUnfolderBase]: For 268/280 co-relation queries the response was YES. [2024-11-09 07:05:05,876 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-09 07:05:05,912 INFO L140 encePairwiseOnDemand]: 466/471 looper letters, 35 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2024-11-09 07:05:05,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 392 transitions, 955 flow [2024-11-09 07:05:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1309 transitions. [2024-11-09 07:05:05,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9263977353149327 [2024-11-09 07:05:05,916 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 858 flow. Second operand 3 states and 1309 transitions. [2024-11-09 07:05:05,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 392 transitions, 955 flow [2024-11-09 07:05:05,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 392 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:05:05,931 INFO L231 Difference]: Finished difference. Result has 377 places, 381 transitions, 850 flow [2024-11-09 07:05:05,931 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-09 07:05:05,932 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2024-11-09 07:05:05,933 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 381 transitions, 850 flow [2024-11-09 07:05:05,933 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-09 07:05:05,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:05,934 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-09 07:05:05,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:05:05,934 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-09 07:05:05,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:05,935 INFO L85 PathProgramCache]: Analyzing trace with hash 473249743, now seen corresponding path program 1 times [2024-11-09 07:05:05,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:05,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646746372] [2024-11-09 07:05:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:06,231 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-09 07:05:06,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:06,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646746372] [2024-11-09 07:05:06,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646746372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:06,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:06,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305388899] [2024-11-09 07:05:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:06,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:06,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:06,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 471 [2024-11-09 07:05:06,335 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-09 07:05:06,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:06,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 471 [2024-11-09 07:05:06,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:09,881 INFO L124 PetriNetUnfolderBase]: 4584/20530 cut-off events. [2024-11-09 07:05:09,881 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-09 07:05:09,932 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-09 07:05:10,001 INFO L140 encePairwiseOnDemand]: 461/471 looper letters, 45 selfloop transitions, 9 changer transitions 0/404 dead transitions. [2024-11-09 07:05:10,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 404 transitions, 1010 flow [2024-11-09 07:05:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1327 transitions. [2024-11-09 07:05:10,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9391365888181175 [2024-11-09 07:05:10,005 INFO L175 Difference]: Start difference. First operand has 377 places, 381 transitions, 850 flow. Second operand 3 states and 1327 transitions. [2024-11-09 07:05:10,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 404 transitions, 1010 flow [2024-11-09 07:05:10,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 404 transitions, 1010 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:10,016 INFO L231 Difference]: Finished difference. Result has 381 places, 389 transitions, 920 flow [2024-11-09 07:05:10,017 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-09 07:05:10,017 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-09 07:05:10,018 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 389 transitions, 920 flow [2024-11-09 07:05:10,019 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-09 07:05:10,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:10,019 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-09 07:05:10,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:05:10,019 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-09 07:05:10,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1798965973, now seen corresponding path program 1 times [2024-11-09 07:05:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:10,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163835279] [2024-11-09 07:05:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:10,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:10,244 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-09 07:05:10,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:10,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163835279] [2024-11-09 07:05:10,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163835279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:10,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:10,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:10,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001619808] [2024-11-09 07:05:10,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:10,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:05:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:05:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:05:10,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 471 [2024-11-09 07:05:10,327 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-09 07:05:10,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:10,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 471 [2024-11-09 07:05:10,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:12,778 INFO L124 PetriNetUnfolderBase]: 2541/15468 cut-off events. [2024-11-09 07:05:12,778 INFO L125 PetriNetUnfolderBase]: For 498/562 co-relation queries the response was YES. [2024-11-09 07:05:12,822 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-09 07:05:12,862 INFO L140 encePairwiseOnDemand]: 462/471 looper letters, 36 selfloop transitions, 8 changer transitions 0/403 dead transitions. [2024-11-09 07:05:12,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 403 transitions, 1035 flow [2024-11-09 07:05:12,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2607 transitions. [2024-11-09 07:05:12,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9225053078556263 [2024-11-09 07:05:12,868 INFO L175 Difference]: Start difference. First operand has 381 places, 389 transitions, 920 flow. Second operand 6 states and 2607 transitions. [2024-11-09 07:05:12,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 403 transitions, 1035 flow [2024-11-09 07:05:12,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 403 transitions, 1017 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:05:12,880 INFO L231 Difference]: Finished difference. Result has 388 places, 393 transitions, 947 flow [2024-11-09 07:05:12,880 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-09 07:05:12,881 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -4 predicate places. [2024-11-09 07:05:12,881 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 393 transitions, 947 flow [2024-11-09 07:05:12,882 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-09 07:05:12,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:12,883 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-09 07:05:12,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:05:12,883 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-09 07:05:12,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 359231543, now seen corresponding path program 1 times [2024-11-09 07:05:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:12,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316469430] [2024-11-09 07:05:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:12,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:13,317 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-09 07:05:13,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:13,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316469430] [2024-11-09 07:05:13,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316469430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:13,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:13,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:05:13,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250250773] [2024-11-09 07:05:13,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:13,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:13,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:13,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:13,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 471 [2024-11-09 07:05:13,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 393 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 435.6666666666667) internal successors, (1307), 3 states have internal predecessors, (1307), 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-09 07:05:13,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:13,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 471 [2024-11-09 07:05:13,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:15,956 INFO L124 PetriNetUnfolderBase]: 3173/17007 cut-off events. [2024-11-09 07:05:15,956 INFO L125 PetriNetUnfolderBase]: For 203/218 co-relation queries the response was YES. [2024-11-09 07:05:16,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24181 conditions, 17007 events. 3173/17007 cut-off events. For 203/218 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 185495 event pairs, 1565 based on Foata normal form. 8/15211 useless extension candidates. Maximal degree in co-relation 24012. Up to 3710 conditions per place. [2024-11-09 07:05:16,052 INFO L140 encePairwiseOnDemand]: 467/471 looper letters, 33 selfloop transitions, 3 changer transitions 0/407 dead transitions. [2024-11-09 07:05:16,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 407 transitions, 1050 flow [2024-11-09 07:05:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:05:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:05:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1339 transitions. [2024-11-09 07:05:16,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9476291578202406 [2024-11-09 07:05:16,056 INFO L175 Difference]: Start difference. First operand has 388 places, 393 transitions, 947 flow. Second operand 3 states and 1339 transitions. [2024-11-09 07:05:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 407 transitions, 1050 flow [2024-11-09 07:05:16,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 407 transitions, 1046 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:05:16,065 INFO L231 Difference]: Finished difference. Result has 390 places, 394 transitions, 957 flow [2024-11-09 07:05:16,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=957, PETRI_PLACES=390, PETRI_TRANSITIONS=394} [2024-11-09 07:05:16,066 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -2 predicate places. [2024-11-09 07:05:16,066 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 394 transitions, 957 flow [2024-11-09 07:05:16,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.6666666666667) internal successors, (1307), 3 states have internal predecessors, (1307), 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-09 07:05:16,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:16,068 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-09 07:05:16,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:05:16,068 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-09 07:05:16,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:16,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1913080549, now seen corresponding path program 1 times [2024-11-09 07:05:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:16,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035986238] [2024-11-09 07:05:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:16,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:16,234 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-09 07:05:16,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035986238] [2024-11-09 07:05:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035986238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:16,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:16,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942598890] [2024-11-09 07:05:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:16,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:05:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:16,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:05:16,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:05:16,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 471 [2024-11-09 07:05:16,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 394 transitions, 957 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-09 07:05:16,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:16,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 471 [2024-11-09 07:05:16,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:19,609 INFO L124 PetriNetUnfolderBase]: 3643/18721 cut-off events. [2024-11-09 07:05:19,609 INFO L125 PetriNetUnfolderBase]: For 575/604 co-relation queries the response was YES. [2024-11-09 07:05:19,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27017 conditions, 18721 events. 3643/18721 cut-off events. For 575/604 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 204722 event pairs, 2422 based on Foata normal form. 4/17033 useless extension candidates. Maximal degree in co-relation 26845. Up to 4925 conditions per place. [2024-11-09 07:05:19,730 INFO L140 encePairwiseOnDemand]: 462/471 looper letters, 27 selfloop transitions, 4 changer transitions 13/402 dead transitions. [2024-11-09 07:05:19,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 402 transitions, 1056 flow [2024-11-09 07:05:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2024-11-09 07:05:19,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.921443736730361 [2024-11-09 07:05:19,736 INFO L175 Difference]: Start difference. First operand has 390 places, 394 transitions, 957 flow. Second operand 6 states and 2604 transitions. [2024-11-09 07:05:19,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 402 transitions, 1056 flow [2024-11-09 07:05:19,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 402 transitions, 1053 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:05:19,746 INFO L231 Difference]: Finished difference. Result has 396 places, 389 transitions, 941 flow [2024-11-09 07:05:19,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=396, PETRI_TRANSITIONS=389} [2024-11-09 07:05:19,747 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 4 predicate places. [2024-11-09 07:05:19,747 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 389 transitions, 941 flow [2024-11-09 07:05:19,748 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-09 07:05:19,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:19,749 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-09 07:05:19,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:05:19,749 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-09 07:05:19,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2102859458, now seen corresponding path program 1 times [2024-11-09 07:05:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:19,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882433995] [2024-11-09 07:05:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:19,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:20,780 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-09 07:05:20,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:20,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882433995] [2024-11-09 07:05:20,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882433995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:20,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:20,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:05:20,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281864148] [2024-11-09 07:05:20,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:20,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:05:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:20,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:05:20,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:05:21,015 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 471 [2024-11-09 07:05:21,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 389 transitions, 941 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-09 07:05:21,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:21,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 471 [2024-11-09 07:05:21,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:26,424 INFO L124 PetriNetUnfolderBase]: 9664/33464 cut-off events. [2024-11-09 07:05:26,424 INFO L125 PetriNetUnfolderBase]: For 2690/2826 co-relation queries the response was YES. [2024-11-09 07:05:26,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56271 conditions, 33464 events. 9664/33464 cut-off events. For 2690/2826 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 373150 event pairs, 4663 based on Foata normal form. 4/30501 useless extension candidates. Maximal degree in co-relation 56095. Up to 11453 conditions per place. [2024-11-09 07:05:26,688 INFO L140 encePairwiseOnDemand]: 457/471 looper letters, 95 selfloop transitions, 46 changer transitions 0/485 dead transitions. [2024-11-09 07:05:26,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 485 transitions, 1497 flow [2024-11-09 07:05:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:05:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:05:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2591 transitions. [2024-11-09 07:05:26,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9168435951875442 [2024-11-09 07:05:26,694 INFO L175 Difference]: Start difference. First operand has 396 places, 389 transitions, 941 flow. Second operand 6 states and 2591 transitions. [2024-11-09 07:05:26,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 485 transitions, 1497 flow [2024-11-09 07:05:26,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 485 transitions, 1469 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-11-09 07:05:26,728 INFO L231 Difference]: Finished difference. Result has 392 places, 434 transitions, 1248 flow [2024-11-09 07:05:26,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1248, PETRI_PLACES=392, PETRI_TRANSITIONS=434} [2024-11-09 07:05:26,730 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 0 predicate places. [2024-11-09 07:05:26,730 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 434 transitions, 1248 flow [2024-11-09 07:05:26,732 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-09 07:05:26,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:26,732 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-09 07:05:26,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:05:26,733 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-09 07:05:26,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1262754258, now seen corresponding path program 1 times [2024-11-09 07:05:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:26,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140736370] [2024-11-09 07:05:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:27,013 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-09 07:05:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140736370] [2024-11-09 07:05:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140736370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:27,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:27,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:05:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339154506] [2024-11-09 07:05:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:27,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:05:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:05:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:05:27,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 471 [2024-11-09 07:05:27,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 434 transitions, 1248 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-09 07:05:27,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:27,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 471 [2024-11-09 07:05:27,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:33,978 INFO L124 PetriNetUnfolderBase]: 9319/39095 cut-off events. [2024-11-09 07:05:33,979 INFO L125 PetriNetUnfolderBase]: For 3842/5885 co-relation queries the response was YES. [2024-11-09 07:05:34,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65215 conditions, 39095 events. 9319/39095 cut-off events. For 3842/5885 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 477248 event pairs, 4584 based on Foata normal form. 225/35521 useless extension candidates. Maximal degree in co-relation 65045. Up to 10400 conditions per place. [2024-11-09 07:05:34,300 INFO L140 encePairwiseOnDemand]: 459/471 looper letters, 64 selfloop transitions, 14 changer transitions 5/479 dead transitions. [2024-11-09 07:05:34,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 479 transitions, 1511 flow [2024-11-09 07:05:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:05:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 07:05:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4284 transitions. [2024-11-09 07:05:34,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9095541401273886 [2024-11-09 07:05:34,307 INFO L175 Difference]: Start difference. First operand has 392 places, 434 transitions, 1248 flow. Second operand 10 states and 4284 transitions. [2024-11-09 07:05:34,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 479 transitions, 1511 flow [2024-11-09 07:05:34,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 479 transitions, 1511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:05:34,331 INFO L231 Difference]: Finished difference. Result has 405 places, 442 transitions, 1320 flow [2024-11-09 07:05:34,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1320, PETRI_PLACES=405, PETRI_TRANSITIONS=442} [2024-11-09 07:05:34,332 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 13 predicate places. [2024-11-09 07:05:34,332 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 442 transitions, 1320 flow [2024-11-09 07:05:34,334 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-09 07:05:34,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:34,334 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-09 07:05:34,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:05:34,334 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-09 07:05:34,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash -509119512, now seen corresponding path program 1 times [2024-11-09 07:05:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14785370] [2024-11-09 07:05:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:34,843 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-09 07:05:34,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:34,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14785370] [2024-11-09 07:05:34,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14785370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:34,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:34,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:05:34,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477727846] [2024-11-09 07:05:34,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:34,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:05:34,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:34,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:05:34,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:05:35,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 471 [2024-11-09 07:05:35,267 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-09 07:05:35,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:35,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 471 [2024-11-09 07:05:35,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:42,742 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][403], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 288#L1066-8true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 536#true, Black: 493#true, 461#true, 526#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, Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-09 07:05:42,742 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2024-11-09 07:05:42,742 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:42,742 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-09 07:05:42,742 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:42,767 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][403], [486#(= |#race~tids~0| 0), Black: 515#(<= (+ ~threads_alive~0 1) 0), 247#L1034-5true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 461#true, 17#L1066-9true, 526#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, Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-09 07:05:42,767 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2024-11-09 07:05:42,767 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:42,767 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:42,767 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-09 07:05:42,770 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][403], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 288#L1066-8true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 536#true, Black: 493#true, 461#true, 526#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), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-09 07:05:42,770 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2024-11-09 07:05:42,770 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:42,770 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-09 07:05:42,770 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:42,770 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][403], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 461#true, 17#L1066-9true, 526#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), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-09 07:05:42,770 INFO L294 olderBase$Statistics]: this new event has 417 ancestors and is cut-off event [2024-11-09 07:05:42,771 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:42,771 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-09 07:05:42,771 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:42,793 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][403], [486#(= |#race~tids~0| 0), Black: 515#(<= (+ ~threads_alive~0 1) 0), 247#L1034-5true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, Black: 493#true, 536#true, 461#true, 526#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), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-09 07:05:42,794 INFO L294 olderBase$Statistics]: this new event has 418 ancestors and is cut-off event [2024-11-09 07:05:42,794 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:42,794 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:42,794 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-09 07:05:42,794 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][403], [486#(= |#race~tids~0| 0), Black: 515#(<= (+ ~threads_alive~0 1) 0), 247#L1034-5true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, Black: 493#true, 536#true, 461#true, 526#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, Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-09 07:05:42,794 INFO L294 olderBase$Statistics]: this new event has 417 ancestors and is cut-off event [2024-11-09 07:05:42,794 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:42,794 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:42,794 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-09 07:05:42,981 INFO L124 PetriNetUnfolderBase]: 11388/45999 cut-off events. [2024-11-09 07:05:42,981 INFO L125 PetriNetUnfolderBase]: For 15756/17530 co-relation queries the response was YES. [2024-11-09 07:05:43,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85174 conditions, 45999 events. 11388/45999 cut-off events. For 15756/17530 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 564291 event pairs, 4090 based on Foata normal form. 119/42124 useless extension candidates. Maximal degree in co-relation 84998. Up to 9114 conditions per place. [2024-11-09 07:05:43,415 INFO L140 encePairwiseOnDemand]: 458/471 looper letters, 101 selfloop transitions, 44 changer transitions 0/512 dead transitions. [2024-11-09 07:05:43,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 512 transitions, 1902 flow [2024-11-09 07:05:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:05:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 07:05:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4661 transitions. [2024-11-09 07:05:43,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8996332754294538 [2024-11-09 07:05:43,425 INFO L175 Difference]: Start difference. First operand has 405 places, 442 transitions, 1320 flow. Second operand 11 states and 4661 transitions. [2024-11-09 07:05:43,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 512 transitions, 1902 flow [2024-11-09 07:05:43,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 512 transitions, 1894 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 07:05:43,473 INFO L231 Difference]: Finished difference. Result has 415 places, 463 transitions, 1637 flow [2024-11-09 07:05:43,474 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-09 07:05:43,474 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 23 predicate places. [2024-11-09 07:05:43,474 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 463 transitions, 1637 flow [2024-11-09 07:05:43,475 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-09 07:05:43,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:05:43,476 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-09 07:05:43,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:05:43,476 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-09 07:05:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1061565791, now seen corresponding path program 1 times [2024-11-09 07:05:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:05:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155042379] [2024-11-09 07:05:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:43,564 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-09 07:05:43,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:05:43,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155042379] [2024-11-09 07:05:43,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155042379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:43,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:05:43,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:05:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277736234] [2024-11-09 07:05:43,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:43,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:05:43,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:05:43,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:05:43,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:05:43,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 433 out of 471 [2024-11-09 07:05:43,580 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-09 07:05:43,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:05:43,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 433 of 471 [2024-11-09 07:05:43,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:05:45,434 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][356], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), 225#L1066-11true, Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 454#L1040-7true, Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 526#true, 461#true, Black: 499#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 482#(= |#race~flags_mutex~0| 0), Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,435 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is not cut-off event [2024-11-09 07:05:45,435 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-09 07:05:45,435 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-09 07:05:45,435 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-09 07:05:45,559 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][390], [486#(= |#race~tids~0| 0), 288#L1066-8true, 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 461#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,559 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-09 07:05:45,559 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:45,559 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:45,559 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:45,572 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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 536#true, Black: 493#true, 17#L1066-9true, 461#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,572 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,572 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,572 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,572 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,573 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][390], [486#(= |#race~tids~0| 0), 288#L1066-8true, 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 461#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,573 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,574 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,574 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,574 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,589 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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, Black: 493#true, 536#true, 461#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,589 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,589 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,589 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,589 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 536#true, Black: 493#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,590 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,590 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,590 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,590 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,591 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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, 288#L1066-8true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,591 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-09 07:05:45,591 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:45,592 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:45,592 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:45,592 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-09 07:05:45,610 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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, Black: 493#true, 536#true, 526#true, 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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,610 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-09 07:05:45,610 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:45,610 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:45,610 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:45,612 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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 17#L1066-9true, 461#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,612 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,612 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,612 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,612 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,612 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,613 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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, 288#L1066-8true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 526#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), Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,613 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,613 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,613 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,613 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,614 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,615 INFO L292 olderBase$Statistics]: inserting event number 6 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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 288#L1066-8true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 461#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,615 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-09 07:05:45,615 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:45,615 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:45,616 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-09 07:05:45,616 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-09 07:05:45,616 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-09 07:05:45,636 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][390], [486#(= |#race~tids~0| 0), Black: 515#(<= (+ ~threads_alive~0 1) 0), 247#L1034-5true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 215#L1066-10true, Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 461#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,636 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,636 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,636 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,636 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,636 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,637 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][390], [486#(= |#race~tids~0| 0), Black: 515#(<= (+ ~threads_alive~0 1) 0), 247#L1034-5true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 484#true, Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 17#L1066-9true, 461#true, 526#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), Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,637 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,637 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,637 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,637 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,637 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,638 INFO L292 olderBase$Statistics]: inserting event number 6 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][390], [486#(= |#race~tids~0| 0), Black: 515#(<= (+ ~threads_alive~0 1) 0), 247#L1034-5true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 461#true, 17#L1066-9true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,638 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,638 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,638 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,638 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,638 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,638 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,640 INFO L292 olderBase$Statistics]: inserting event number 6 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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 288#L1066-8true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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|)), 495#(= |#race~flags~0| 0), 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 461#true, 526#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), Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,640 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,640 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,640 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,640 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,640 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-09 07:05:45,640 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-09 07:05:45,660 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][390], [486#(= |#race~tids~0| 0), 247#L1034-5true, Black: 515#(<= (+ ~threads_alive~0 1) 0), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 215#L1066-10true, Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 526#true, 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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,660 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-09 07:05:45,660 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-09 07:05:45,661 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:45,661 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:45,661 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:45,662 INFO L292 olderBase$Statistics]: inserting event number 6 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][390], [486#(= |#race~tids~0| 0), Black: 515#(<= (+ ~threads_alive~0 1) 0), 247#L1034-5true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, Black: 493#true, 536#true, 461#true, 526#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, Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,662 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,662 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,662 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,663 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,663 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,663 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,663 INFO L292 olderBase$Statistics]: inserting event number 6 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][390], [486#(= |#race~tids~0| 0), Black: 515#(<= (+ ~threads_alive~0 1) 0), 247#L1034-5true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), Black: 493#true, 536#true, 461#true, 17#L1066-9true, 526#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), Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,663 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,663 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,663 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,663 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:05:45,664 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,664 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-09 07:05:45,687 INFO L292 olderBase$Statistics]: inserting event number 6 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][390], [486#(= |#race~tids~0| 0), Black: 515#(<= (+ ~threads_alive~0 1) 0), 247#L1034-5true, 568#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 470#(= |#race~threads_total~0| 0), Black: 529#(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: 528#(= (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) (+ 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) (+ 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: 480#true, 575#true, 463#true, Black: 540#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 541#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 548#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 484#true, Black: 542#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 490#(= |#race~threads_alive~0| 0), 215#L1066-10true, Black: 493#true, 536#true, 461#true, 526#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), Black: 570#(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: 558#(not (= ~flags~0.base ~tids~0.base)), Black: 504#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 559#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0))]) [2024-11-09 07:05:45,687 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-09 07:05:45,687 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-09 07:05:45,687 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:45,687 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-09 07:05:45,687 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-09 07:05:45,687 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event