./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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-3.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 21bb8f266262880d0d6873fb2e4e8bc5cd60f79baa0774ffc8a8aedd31b66692 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:02:38,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:02:38,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:02:38,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:02:38,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:02:38,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:02:38,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:02:38,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:02:38,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:02:38,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:02:38,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:02:38,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:02:38,460 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:02:38,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:02:38,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:02:38,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:02:38,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:02:38,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:02:38,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:02:38,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:02:38,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:02:38,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:02:38,466 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:02:38,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:02:38,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:02:38,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:02:38,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:02:38,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:02:38,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:02:38,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:02:38,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:02:38,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:02:38,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:02:38,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:02:38,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:02:38,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:02:38,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:02:38,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:02:38,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:02:38,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:02:38,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:02:38,472 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 -> 21bb8f266262880d0d6873fb2e4e8bc5cd60f79baa0774ffc8a8aedd31b66692 [2024-11-19 06:02:38,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:02:38,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:02:38,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:02:38,773 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:02:38,774 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:02:38,775 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-3.i [2024-11-19 06:02:40,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:02:40,632 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:02:40,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-3.i [2024-11-19 06:02:40,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a493e4d4/c1a0e1c2b5d34f8fa2316bd3616a6f71/FLAG21f7a31e1 [2024-11-19 06:02:40,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a493e4d4/c1a0e1c2b5d34f8fa2316bd3616a6f71 [2024-11-19 06:02:40,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:02:40,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:02:40,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:02:40,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:02:40,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:02:40,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:02:40" (1/1) ... [2024-11-19 06:02:40,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790b1f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:40, skipping insertion in model container [2024-11-19 06:02:40,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:02:40" (1/1) ... [2024-11-19 06:02:40,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:02:41,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:02:41,581 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:02:41,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:02:41,715 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:02:41,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41 WrapperNode [2024-11-19 06:02:41,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:02:41,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:02:41,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:02:41,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:02:41,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,797 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 268 [2024-11-19 06:02:41,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:02:41,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:02:41,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:02:41,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:02:41,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:02:41,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:02:41,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:02:41,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:02:41,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (1/1) ... [2024-11-19 06:02:41,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:02:41,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:02:41,893 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-19 06:02:41,897 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-19 06:02:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:02:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 06:02:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 06:02:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 06:02:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 06:02:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:02:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:02:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-11-19 06:02:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-11-19 06:02:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 06:02:41,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-19 06:02:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-19 06:02:41,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:02:41,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:02:41,956 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 06:02:42,146 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:02:42,150 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:02:42,688 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:02:42,689 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:02:42,759 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:02:42,761 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 06:02:42,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:02:42 BoogieIcfgContainer [2024-11-19 06:02:42,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:02:42,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:02:42,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:02:42,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:02:42,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:02:40" (1/3) ... [2024-11-19 06:02:42,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773a5b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:02:42, skipping insertion in model container [2024-11-19 06:02:42,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:41" (2/3) ... [2024-11-19 06:02:42,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773a5b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:02:42, skipping insertion in model container [2024-11-19 06:02:42,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:02:42" (3/3) ... [2024-11-19 06:02:42,773 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-3.i [2024-11-19 06:02:42,794 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:02:42,794 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-19 06:02:42,795 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:02:42,916 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 06:02:43,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 458 places, 467 transitions, 948 flow [2024-11-19 06:02:43,249 INFO L124 PetriNetUnfolderBase]: 21/588 cut-off events. [2024-11-19 06:02:43,250 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 06:02:43,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 588 events. 21/588 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 910 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 376. Up to 6 conditions per place. [2024-11-19 06:02:43,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 458 places, 467 transitions, 948 flow [2024-11-19 06:02:43,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 390 places, 395 transitions, 800 flow [2024-11-19 06:02:43,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:02:43,306 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;@678f466, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:02:43,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-11-19 06:02:43,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:02:43,332 INFO L124 PetriNetUnfolderBase]: 0/147 cut-off events. [2024-11-19 06:02:43,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:02:43,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:43,333 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-19 06:02:43,333 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-19 06:02:43,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1820901917, now seen corresponding path program 1 times [2024-11-19 06:02:43,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:43,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193736575] [2024-11-19 06:02:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:43,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:43,881 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-19 06:02:43,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:43,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193736575] [2024-11-19 06:02:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193736575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:43,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:43,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603650381] [2024-11-19 06:02:43,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:43,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:43,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:43,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:44,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 467 [2024-11-19 06:02:44,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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-19 06:02:44,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:44,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 467 [2024-11-19 06:02:44,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:45,107 INFO L124 PetriNetUnfolderBase]: 654/4279 cut-off events. [2024-11-19 06:02:45,107 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-19 06:02:45,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5315 conditions, 4279 events. 654/4279 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 33073 event pairs, 489 based on Foata normal form. 182/3774 useless extension candidates. Maximal degree in co-relation 5083. Up to 1006 conditions per place. [2024-11-19 06:02:45,149 INFO L140 encePairwiseOnDemand]: 457/467 looper letters, 28 selfloop transitions, 2 changer transitions 1/385 dead transitions. [2024-11-19 06:02:45,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 385 transitions, 840 flow [2024-11-19 06:02:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2024-11-19 06:02:45,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.926481084939329 [2024-11-19 06:02:45,178 INFO L175 Difference]: Start difference. First operand has 390 places, 395 transitions, 800 flow. Second operand 3 states and 1298 transitions. [2024-11-19 06:02:45,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 385 transitions, 840 flow [2024-11-19 06:02:45,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 385 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:02:45,196 INFO L231 Difference]: Finished difference. Result has 387 places, 384 transitions, 781 flow [2024-11-19 06:02:45,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=387, PETRI_TRANSITIONS=384} [2024-11-19 06:02:45,205 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -3 predicate places. [2024-11-19 06:02:45,205 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 384 transitions, 781 flow [2024-11-19 06:02:45,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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-19 06:02:45,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:45,207 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-19 06:02:45,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:02:45,207 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-19 06:02:45,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1725122573, now seen corresponding path program 1 times [2024-11-19 06:02:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:45,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943268771] [2024-11-19 06:02:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:45,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:45,356 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-19 06:02:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:45,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943268771] [2024-11-19 06:02:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943268771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:45,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596301073] [2024-11-19 06:02:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:45,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:45,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 467 [2024-11-19 06:02:45,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 384 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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-19 06:02:45,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:45,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 467 [2024-11-19 06:02:45,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:46,315 INFO L124 PetriNetUnfolderBase]: 747/4722 cut-off events. [2024-11-19 06:02:46,315 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-19 06:02:46,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5909 conditions, 4722 events. 747/4722 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 37730 event pairs, 571 based on Foata normal form. 0/4002 useless extension candidates. Maximal degree in co-relation 5752. Up to 1153 conditions per place. [2024-11-19 06:02:46,353 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 31 selfloop transitions, 1 changer transitions 0/377 dead transitions. [2024-11-19 06:02:46,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 377 transitions, 831 flow [2024-11-19 06:02:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-19 06:02:46,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9057815845824411 [2024-11-19 06:02:46,357 INFO L175 Difference]: Start difference. First operand has 387 places, 384 transitions, 781 flow. Second operand 3 states and 1269 transitions. [2024-11-19 06:02:46,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 377 transitions, 831 flow [2024-11-19 06:02:46,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 377 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:46,372 INFO L231 Difference]: Finished difference. Result has 379 places, 377 transitions, 765 flow [2024-11-19 06:02:46,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=379, PETRI_TRANSITIONS=377} [2024-11-19 06:02:46,374 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -11 predicate places. [2024-11-19 06:02:46,374 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 377 transitions, 765 flow [2024-11-19 06:02:46,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 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-19 06:02:46,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:46,375 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-19 06:02:46,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:02:46,375 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-19 06:02:46,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 435785670, now seen corresponding path program 1 times [2024-11-19 06:02:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:46,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782875781] [2024-11-19 06:02:46,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:46,569 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-19 06:02:46,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:46,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782875781] [2024-11-19 06:02:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782875781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:46,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:46,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:46,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947197096] [2024-11-19 06:02:46,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:46,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:46,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:46,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:46,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:46,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 467 [2024-11-19 06:02:46,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 377 transitions, 765 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-19 06:02:46,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:46,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 467 [2024-11-19 06:02:46,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:47,477 INFO L124 PetriNetUnfolderBase]: 709/4507 cut-off events. [2024-11-19 06:02:47,477 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-19 06:02:47,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5641 conditions, 4507 events. 709/4507 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 36414 event pairs, 546 based on Foata normal form. 0/3832 useless extension candidates. Maximal degree in co-relation 5484. Up to 1102 conditions per place. [2024-11-19 06:02:47,516 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-11-19 06:02:47,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 376 transitions, 815 flow [2024-11-19 06:02:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2024-11-19 06:02:47,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9271948608137045 [2024-11-19 06:02:47,521 INFO L175 Difference]: Start difference. First operand has 379 places, 377 transitions, 765 flow. Second operand 3 states and 1299 transitions. [2024-11-19 06:02:47,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 376 transitions, 815 flow [2024-11-19 06:02:47,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 376 transitions, 814 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:02:47,529 INFO L231 Difference]: Finished difference. Result has 379 places, 376 transitions, 766 flow [2024-11-19 06:02:47,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, 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-19 06:02:47,530 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -11 predicate places. [2024-11-19 06:02:47,531 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 376 transitions, 766 flow [2024-11-19 06:02:47,532 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-19 06:02:47,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:47,532 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-19 06:02:47,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:02:47,533 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-19 06:02:47,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash -141388662, now seen corresponding path program 1 times [2024-11-19 06:02:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477989572] [2024-11-19 06:02:47,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:47,642 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-19 06:02:47,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:47,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477989572] [2024-11-19 06:02:47,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477989572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:47,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:47,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:47,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125499637] [2024-11-19 06:02:47,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:47,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:47,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:47,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:47,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:47,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2024-11-19 06:02:47,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 376 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-19 06:02:47,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:47,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2024-11-19 06:02:47,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:48,666 INFO L124 PetriNetUnfolderBase]: 835/4382 cut-off events. [2024-11-19 06:02:48,666 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-19 06:02:48,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5680 conditions, 4382 events. 835/4382 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 33610 event pairs, 605 based on Foata normal form. 0/3747 useless extension candidates. Maximal degree in co-relation 5523. Up to 1258 conditions per place. [2024-11-19 06:02:48,705 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2024-11-19 06:02:48,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 375 transitions, 816 flow [2024-11-19 06:02:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2024-11-19 06:02:48,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9250535331905781 [2024-11-19 06:02:48,709 INFO L175 Difference]: Start difference. First operand has 379 places, 376 transitions, 766 flow. Second operand 3 states and 1296 transitions. [2024-11-19 06:02:48,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 375 transitions, 816 flow [2024-11-19 06:02:48,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 375 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:48,715 INFO L231 Difference]: Finished difference. Result has 378 places, 375 transitions, 764 flow [2024-11-19 06:02:48,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=378, PETRI_TRANSITIONS=375} [2024-11-19 06:02:48,716 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -12 predicate places. [2024-11-19 06:02:48,717 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 764 flow [2024-11-19 06:02:48,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-19 06:02:48,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:48,718 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-19 06:02:48,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:02:48,719 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-19 06:02:48,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1948743584, now seen corresponding path program 1 times [2024-11-19 06:02:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:48,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131871502] [2024-11-19 06:02:48,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:48,896 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-19 06:02:48,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:48,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131871502] [2024-11-19 06:02:48,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131871502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:48,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:48,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:48,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088095061] [2024-11-19 06:02:48,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:48,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:48,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2024-11-19 06:02:48,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 375 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 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-19 06:02:48,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:48,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2024-11-19 06:02:48,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:49,770 INFO L124 PetriNetUnfolderBase]: 991/4615 cut-off events. [2024-11-19 06:02:49,771 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-19 06:02:49,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6132 conditions, 4615 events. 991/4615 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 36117 event pairs, 713 based on Foata normal form. 0/3955 useless extension candidates. Maximal degree in co-relation 5975. Up to 1475 conditions per place. [2024-11-19 06:02:49,810 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 26 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2024-11-19 06:02:49,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 374 transitions, 818 flow [2024-11-19 06:02:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1292 transitions. [2024-11-19 06:02:49,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9221984296930764 [2024-11-19 06:02:49,814 INFO L175 Difference]: Start difference. First operand has 378 places, 375 transitions, 764 flow. Second operand 3 states and 1292 transitions. [2024-11-19 06:02:49,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 374 transitions, 818 flow [2024-11-19 06:02:49,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 374 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:49,821 INFO L231 Difference]: Finished difference. Result has 377 places, 374 transitions, 762 flow [2024-11-19 06:02:49,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=377, PETRI_TRANSITIONS=374} [2024-11-19 06:02:49,822 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -13 predicate places. [2024-11-19 06:02:49,824 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 374 transitions, 762 flow [2024-11-19 06:02:49,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 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-19 06:02:49,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:49,825 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-19 06:02:49,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:02:49,826 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-19 06:02:49,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash -487062641, now seen corresponding path program 1 times [2024-11-19 06:02:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:49,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872697823] [2024-11-19 06:02:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:49,929 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-19 06:02:49,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872697823] [2024-11-19 06:02:49,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872697823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:49,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:49,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489504893] [2024-11-19 06:02:49,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:49,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:49,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:49,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:49,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:49,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 467 [2024-11-19 06:02:49,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 374 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 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-19 06:02:49,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:49,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 467 [2024-11-19 06:02:49,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:50,818 INFO L124 PetriNetUnfolderBase]: 1448/5216 cut-off events. [2024-11-19 06:02:50,818 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-19 06:02:50,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7410 conditions, 5216 events. 1448/5216 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40079 event pairs, 666 based on Foata normal form. 0/4639 useless extension candidates. Maximal degree in co-relation 7254. Up to 2100 conditions per place. [2024-11-19 06:02:50,870 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 38 selfloop transitions, 3 changer transitions 0/382 dead transitions. [2024-11-19 06:02:50,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 382 transitions, 865 flow [2024-11-19 06:02:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:50,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2024-11-19 06:02:50,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9172019985724482 [2024-11-19 06:02:50,875 INFO L175 Difference]: Start difference. First operand has 377 places, 374 transitions, 762 flow. Second operand 3 states and 1285 transitions. [2024-11-19 06:02:50,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 382 transitions, 865 flow [2024-11-19 06:02:50,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 382 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:50,883 INFO L231 Difference]: Finished difference. Result has 373 places, 372 transitions, 769 flow [2024-11-19 06:02:50,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=373, PETRI_TRANSITIONS=372} [2024-11-19 06:02:50,886 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -17 predicate places. [2024-11-19 06:02:50,887 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 372 transitions, 769 flow [2024-11-19 06:02:50,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 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-19 06:02:50,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:50,890 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-19 06:02:50,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:02:50,891 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-19 06:02:50,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash -563579689, now seen corresponding path program 1 times [2024-11-19 06:02:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599732297] [2024-11-19 06:02:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:50,992 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-19 06:02:50,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:50,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599732297] [2024-11-19 06:02:50,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599732297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:50,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:50,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703828604] [2024-11-19 06:02:50,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:50,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:50,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:50,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:50,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:51,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2024-11-19 06:02:51,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 372 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-19 06:02:51,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:51,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2024-11-19 06:02:51,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:51,982 INFO L124 PetriNetUnfolderBase]: 1016/5667 cut-off events. [2024-11-19 06:02:51,982 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-19 06:02:52,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7406 conditions, 5667 events. 1016/5667 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 48530 event pairs, 681 based on Foata normal form. 0/5034 useless extension candidates. Maximal degree in co-relation 7250. Up to 1521 conditions per place. [2024-11-19 06:02:52,024 INFO L140 encePairwiseOnDemand]: 461/467 looper letters, 30 selfloop transitions, 3 changer transitions 0/378 dead transitions. [2024-11-19 06:02:52,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 378 transitions, 847 flow [2024-11-19 06:02:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2024-11-19 06:02:52,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9293361884368309 [2024-11-19 06:02:52,028 INFO L175 Difference]: Start difference. First operand has 373 places, 372 transitions, 769 flow. Second operand 3 states and 1302 transitions. [2024-11-19 06:02:52,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 378 transitions, 847 flow [2024-11-19 06:02:52,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 378 transitions, 847 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:52,034 INFO L231 Difference]: Finished difference. Result has 373 places, 372 transitions, 784 flow [2024-11-19 06:02:52,035 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=373, PETRI_TRANSITIONS=372} [2024-11-19 06:02:52,036 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -17 predicate places. [2024-11-19 06:02:52,036 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 372 transitions, 784 flow [2024-11-19 06:02:52,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-19 06:02:52,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:52,037 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-19 06:02:52,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:02:52,038 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-19 06:02:52,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash -263439936, now seen corresponding path program 1 times [2024-11-19 06:02:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629991340] [2024-11-19 06:02:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:52,114 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-19 06:02:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629991340] [2024-11-19 06:02:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629991340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:52,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:52,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:52,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201092954] [2024-11-19 06:02:52,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:52,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:52,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:52,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:52,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:52,148 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 467 [2024-11-19 06:02:52,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 372 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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-19 06:02:52,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:52,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 467 [2024-11-19 06:02:52,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:53,535 INFO L124 PetriNetUnfolderBase]: 1809/8546 cut-off events. [2024-11-19 06:02:53,536 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-19 06:02:53,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11625 conditions, 8546 events. 1809/8546 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 76047 event pairs, 655 based on Foata normal form. 0/7383 useless extension candidates. Maximal degree in co-relation 11468. Up to 1443 conditions per place. [2024-11-19 06:02:53,606 INFO L140 encePairwiseOnDemand]: 456/467 looper letters, 44 selfloop transitions, 8 changer transitions 0/396 dead transitions. [2024-11-19 06:02:53,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 396 transitions, 942 flow [2024-11-19 06:02:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1315 transitions. [2024-11-19 06:02:53,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9386152748037117 [2024-11-19 06:02:53,610 INFO L175 Difference]: Start difference. First operand has 373 places, 372 transitions, 784 flow. Second operand 3 states and 1315 transitions. [2024-11-19 06:02:53,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 396 transitions, 942 flow [2024-11-19 06:02:53,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 396 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:53,619 INFO L231 Difference]: Finished difference. Result has 377 places, 380 transitions, 854 flow [2024-11-19 06:02:53,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=377, PETRI_TRANSITIONS=380} [2024-11-19 06:02:53,622 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -13 predicate places. [2024-11-19 06:02:53,622 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 380 transitions, 854 flow [2024-11-19 06:02:53,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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-19 06:02:53,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:53,624 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-19 06:02:53,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:02:53,628 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-19 06:02:53,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:53,629 INFO L85 PathProgramCache]: Analyzing trace with hash 13248787, now seen corresponding path program 1 times [2024-11-19 06:02:53,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:53,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135542161] [2024-11-19 06:02:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:53,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:53,736 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-19 06:02:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:53,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135542161] [2024-11-19 06:02:53,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135542161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:53,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:53,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:53,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889628264] [2024-11-19 06:02:53,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:53,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:53,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:53,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:53,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:53,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 467 [2024-11-19 06:02:53,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 380 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-19 06:02:53,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:53,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 467 [2024-11-19 06:02:53,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:55,613 INFO L124 PetriNetUnfolderBase]: 2070/10403 cut-off events. [2024-11-19 06:02:55,613 INFO L125 PetriNetUnfolderBase]: For 268/280 co-relation queries the response was YES. [2024-11-19 06:02:55,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14505 conditions, 10403 events. 2070/10403 cut-off events. For 268/280 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 98509 event pairs, 1154 based on Foata normal form. 0/9377 useless extension candidates. Maximal degree in co-relation 14346. Up to 2624 conditions per place. [2024-11-19 06:02:55,724 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 35 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2024-11-19 06:02:55,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 390 transitions, 951 flow [2024-11-19 06:02:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2024-11-19 06:02:55,728 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257673090649536 [2024-11-19 06:02:55,728 INFO L175 Difference]: Start difference. First operand has 377 places, 380 transitions, 854 flow. Second operand 3 states and 1297 transitions. [2024-11-19 06:02:55,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 390 transitions, 951 flow [2024-11-19 06:02:55,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 390 transitions, 935 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:55,742 INFO L231 Difference]: Finished difference. Result has 375 places, 379 transitions, 846 flow [2024-11-19 06:02:55,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=375, PETRI_TRANSITIONS=379} [2024-11-19 06:02:55,744 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -15 predicate places. [2024-11-19 06:02:55,744 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 379 transitions, 846 flow [2024-11-19 06:02:55,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-19 06:02:55,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:55,746 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-19 06:02:55,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:02:55,746 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-19 06:02:55,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash -441432345, now seen corresponding path program 1 times [2024-11-19 06:02:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343655186] [2024-11-19 06:02:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:56,014 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-19 06:02:56,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:56,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343655186] [2024-11-19 06:02:56,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343655186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:56,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:56,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:56,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408536532] [2024-11-19 06:02:56,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:56,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:56,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:56,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:56,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:56,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 467 [2024-11-19 06:02:56,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 379 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 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-19 06:02:56,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:56,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 467 [2024-11-19 06:02:56,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:58,676 INFO L124 PetriNetUnfolderBase]: 4584/20444 cut-off events. [2024-11-19 06:02:58,677 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-19 06:02:58,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29170 conditions, 20444 events. 4584/20444 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 219923 event pairs, 2480 based on Foata normal form. 0/18521 useless extension candidates. Maximal degree in co-relation 29010. Up to 5342 conditions per place. [2024-11-19 06:02:58,846 INFO L140 encePairwiseOnDemand]: 457/467 looper letters, 45 selfloop transitions, 9 changer transitions 0/402 dead transitions. [2024-11-19 06:02:58,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 402 transitions, 1006 flow [2024-11-19 06:02:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1315 transitions. [2024-11-19 06:02:58,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9386152748037117 [2024-11-19 06:02:58,853 INFO L175 Difference]: Start difference. First operand has 375 places, 379 transitions, 846 flow. Second operand 3 states and 1315 transitions. [2024-11-19 06:02:58,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 402 transitions, 1006 flow [2024-11-19 06:02:58,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 402 transitions, 1006 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:58,862 INFO L231 Difference]: Finished difference. Result has 379 places, 387 transitions, 916 flow [2024-11-19 06:02:58,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=916, PETRI_PLACES=379, PETRI_TRANSITIONS=387} [2024-11-19 06:02:58,864 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -11 predicate places. [2024-11-19 06:02:58,865 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 387 transitions, 916 flow [2024-11-19 06:02:58,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 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-19 06:02:58,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:58,866 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-19 06:02:58,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:02:58,866 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-19 06:02:58,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2015945854, now seen corresponding path program 1 times [2024-11-19 06:02:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:58,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244249823] [2024-11-19 06:02:58,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:58,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:59,056 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-19 06:02:59,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:59,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244249823] [2024-11-19 06:02:59,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244249823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:59,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:59,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:59,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049935209] [2024-11-19 06:02:59,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:59,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:02:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:02:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:02:59,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2024-11-19 06:02:59,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 387 transitions, 916 flow. Second operand has 5 states, 5 states have (on average 424.8) internal successors, (2124), 5 states have internal predecessors, (2124), 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-19 06:02:59,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:59,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2024-11-19 06:02:59,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:01,135 INFO L124 PetriNetUnfolderBase]: 2538/15328 cut-off events. [2024-11-19 06:03:01,136 INFO L125 PetriNetUnfolderBase]: For 519/583 co-relation queries the response was YES. [2024-11-19 06:03:01,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21652 conditions, 15328 events. 2538/15328 cut-off events. For 519/583 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 166223 event pairs, 1887 based on Foata normal form. 4/13914 useless extension candidates. Maximal degree in co-relation 21488. Up to 3397 conditions per place. [2024-11-19 06:03:01,296 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 36 selfloop transitions, 8 changer transitions 0/401 dead transitions. [2024-11-19 06:03:01,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 401 transitions, 1031 flow [2024-11-19 06:03:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2583 transitions. [2024-11-19 06:03:01,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9218415417558886 [2024-11-19 06:03:01,305 INFO L175 Difference]: Start difference. First operand has 379 places, 387 transitions, 916 flow. Second operand 6 states and 2583 transitions. [2024-11-19 06:03:01,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 401 transitions, 1031 flow [2024-11-19 06:03:01,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 401 transitions, 1013 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:01,323 INFO L231 Difference]: Finished difference. Result has 386 places, 391 transitions, 943 flow [2024-11-19 06:03:01,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=386, PETRI_TRANSITIONS=391} [2024-11-19 06:03:01,325 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -4 predicate places. [2024-11-19 06:03:01,325 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 391 transitions, 943 flow [2024-11-19 06:03:01,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 424.8) internal successors, (2124), 5 states have internal predecessors, (2124), 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-19 06:03:01,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:01,327 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-19 06:03:01,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:03:01,327 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-19 06:03:01,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash 216055538, now seen corresponding path program 1 times [2024-11-19 06:03:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:01,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703483424] [2024-11-19 06:03:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:01,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:01,430 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-19 06:03:01,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703483424] [2024-11-19 06:03:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703483424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:01,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:01,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:01,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861150673] [2024-11-19 06:03:01,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:01,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:01,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:01,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:01,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 467 [2024-11-19 06:03:01,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 391 transitions, 943 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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-19 06:03:01,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:01,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 467 [2024-11-19 06:03:01,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:03,884 INFO L124 PetriNetUnfolderBase]: 3409/17516 cut-off events. [2024-11-19 06:03:03,884 INFO L125 PetriNetUnfolderBase]: For 225/256 co-relation queries the response was YES. [2024-11-19 06:03:04,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25078 conditions, 17516 events. 3409/17516 cut-off events. For 225/256 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 191527 event pairs, 1915 based on Foata normal form. 2/15579 useless extension candidates. Maximal degree in co-relation 24910. Up to 3412 conditions per place. [2024-11-19 06:03:04,079 INFO L140 encePairwiseOnDemand]: 463/467 looper letters, 29 selfloop transitions, 3 changer transitions 0/402 dead transitions. [2024-11-19 06:03:04,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 402 transitions, 1032 flow [2024-11-19 06:03:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1326 transitions. [2024-11-19 06:03:04,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9464668094218416 [2024-11-19 06:03:04,082 INFO L175 Difference]: Start difference. First operand has 386 places, 391 transitions, 943 flow. Second operand 3 states and 1326 transitions. [2024-11-19 06:03:04,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 402 transitions, 1032 flow [2024-11-19 06:03:04,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 402 transitions, 1028 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:03:04,092 INFO L231 Difference]: Finished difference. Result has 389 places, 393 transitions, 961 flow [2024-11-19 06:03:04,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=961, PETRI_PLACES=389, PETRI_TRANSITIONS=393} [2024-11-19 06:03:04,093 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, -1 predicate places. [2024-11-19 06:03:04,093 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 393 transitions, 961 flow [2024-11-19 06:03:04,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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-19 06:03:04,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:04,095 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-19 06:03:04,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:03:04,095 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-19 06:03:04,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:04,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1187314765, now seen corresponding path program 1 times [2024-11-19 06:03:04,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:04,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513494384] [2024-11-19 06:03:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:04,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:04,288 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-19 06:03:04,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:04,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513494384] [2024-11-19 06:03:04,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513494384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:04,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:04,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:04,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433465714] [2024-11-19 06:03:04,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:04,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:03:04,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:04,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:03:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:03:04,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2024-11-19 06:03:04,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 393 transitions, 961 flow. Second operand has 5 states, 5 states have (on average 425.0) internal successors, (2125), 5 states have internal predecessors, (2125), 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-19 06:03:04,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:04,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2024-11-19 06:03:04,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:07,993 INFO L124 PetriNetUnfolderBase]: 3863/20177 cut-off events. [2024-11-19 06:03:07,993 INFO L125 PetriNetUnfolderBase]: For 766/798 co-relation queries the response was YES. [2024-11-19 06:03:08,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29614 conditions, 20177 events. 3863/20177 cut-off events. For 766/798 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 225438 event pairs, 2596 based on Foata normal form. 6/18413 useless extension candidates. Maximal degree in co-relation 29443. Up to 5261 conditions per place. [2024-11-19 06:03:08,236 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 27 selfloop transitions, 4 changer transitions 17/405 dead transitions. [2024-11-19 06:03:08,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 405 transitions, 1076 flow [2024-11-19 06:03:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2584 transitions. [2024-11-19 06:03:08,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9221984296930764 [2024-11-19 06:03:08,242 INFO L175 Difference]: Start difference. First operand has 389 places, 393 transitions, 961 flow. Second operand 6 states and 2584 transitions. [2024-11-19 06:03:08,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 405 transitions, 1076 flow [2024-11-19 06:03:08,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 405 transitions, 1070 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:08,261 INFO L231 Difference]: Finished difference. Result has 394 places, 388 transitions, 942 flow [2024-11-19 06:03:08,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=394, PETRI_TRANSITIONS=388} [2024-11-19 06:03:08,263 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, 4 predicate places. [2024-11-19 06:03:08,264 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 388 transitions, 942 flow [2024-11-19 06:03:08,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 425.0) internal successors, (2125), 5 states have internal predecessors, (2125), 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-19 06:03:08,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:08,265 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-19 06:03:08,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:03:08,266 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-19 06:03:08,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1791889725, now seen corresponding path program 1 times [2024-11-19 06:03:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:08,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813462423] [2024-11-19 06:03:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:09,211 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-19 06:03:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813462423] [2024-11-19 06:03:09,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813462423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:09,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053045791] [2024-11-19 06:03:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:09,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:03:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:09,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:03:09,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:03:09,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 467 [2024-11-19 06:03:09,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 388 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 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-19 06:03:09,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:09,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 467 [2024-11-19 06:03:09,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:15,491 INFO L124 PetriNetUnfolderBase]: 8712/33426 cut-off events. [2024-11-19 06:03:15,491 INFO L125 PetriNetUnfolderBase]: For 2608/3106 co-relation queries the response was YES. [2024-11-19 06:03:15,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54166 conditions, 33426 events. 8712/33426 cut-off events. For 2608/3106 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 385388 event pairs, 4892 based on Foata normal form. 3/29908 useless extension candidates. Maximal degree in co-relation 53991. Up to 11080 conditions per place. [2024-11-19 06:03:15,825 INFO L140 encePairwiseOnDemand]: 453/467 looper letters, 95 selfloop transitions, 46 changer transitions 0/484 dead transitions. [2024-11-19 06:03:15,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 484 transitions, 1498 flow [2024-11-19 06:03:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2567 transitions. [2024-11-19 06:03:15,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.916131334760885 [2024-11-19 06:03:15,831 INFO L175 Difference]: Start difference. First operand has 394 places, 388 transitions, 942 flow. Second operand 6 states and 2567 transitions. [2024-11-19 06:03:15,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 484 transitions, 1498 flow [2024-11-19 06:03:15,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 484 transitions, 1470 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-11-19 06:03:15,854 INFO L231 Difference]: Finished difference. Result has 390 places, 433 transitions, 1249 flow [2024-11-19 06:03:15,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1249, PETRI_PLACES=390, PETRI_TRANSITIONS=433} [2024-11-19 06:03:15,855 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, 0 predicate places. [2024-11-19 06:03:15,856 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 433 transitions, 1249 flow [2024-11-19 06:03:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 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-19 06:03:15,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:15,858 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-19 06:03:15,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:03:15,858 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-19 06:03:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 308940398, now seen corresponding path program 1 times [2024-11-19 06:03:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796049888] [2024-11-19 06:03:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:16,254 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-19 06:03:16,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796049888] [2024-11-19 06:03:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796049888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:16,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:16,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:03:16,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425820753] [2024-11-19 06:03:16,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:16,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:03:16,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:16,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:03:16,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:03:16,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 467 [2024-11-19 06:03:16,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 433 transitions, 1249 flow. Second operand has 7 states, 7 states have (on average 418.0) internal successors, (2926), 7 states have internal predecessors, (2926), 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-19 06:03:16,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:16,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 467 [2024-11-19 06:03:16,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:23,096 INFO L124 PetriNetUnfolderBase]: 9628/40071 cut-off events. [2024-11-19 06:03:23,097 INFO L125 PetriNetUnfolderBase]: For 3853/5890 co-relation queries the response was YES. [2024-11-19 06:03:23,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66672 conditions, 40071 events. 9628/40071 cut-off events. For 3853/5890 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 491299 event pairs, 4721 based on Foata normal form. 254/36211 useless extension candidates. Maximal degree in co-relation 66503. Up to 10838 conditions per place. [2024-11-19 06:03:23,464 INFO L140 encePairwiseOnDemand]: 455/467 looper letters, 64 selfloop transitions, 14 changer transitions 10/482 dead transitions. [2024-11-19 06:03:23,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 482 transitions, 1528 flow [2024-11-19 06:03:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:03:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 06:03:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4248 transitions. [2024-11-19 06:03:23,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9096359743040685 [2024-11-19 06:03:23,472 INFO L175 Difference]: Start difference. First operand has 390 places, 433 transitions, 1249 flow. Second operand 10 states and 4248 transitions. [2024-11-19 06:03:23,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 482 transitions, 1528 flow [2024-11-19 06:03:23,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 482 transitions, 1528 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:23,497 INFO L231 Difference]: Finished difference. Result has 403 places, 440 transitions, 1316 flow [2024-11-19 06:03:23,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1316, PETRI_PLACES=403, PETRI_TRANSITIONS=440} [2024-11-19 06:03:23,500 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, 13 predicate places. [2024-11-19 06:03:23,500 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 440 transitions, 1316 flow [2024-11-19 06:03:23,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 418.0) internal successors, (2926), 7 states have internal predecessors, (2926), 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-19 06:03:23,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:23,502 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-19 06:03:23,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:03:23,503 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-19 06:03:23,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash 551754371, now seen corresponding path program 1 times [2024-11-19 06:03:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:23,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862736067] [2024-11-19 06:03:23,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:23,990 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-19 06:03:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:23,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862736067] [2024-11-19 06:03:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862736067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:23,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:03:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006787236] [2024-11-19 06:03:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:23,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:03:23,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:23,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:03:23,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:03:24,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 467 [2024-11-19 06:03:24,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 440 transitions, 1316 flow. Second operand has 8 states, 8 states have (on average 412.875) internal successors, (3303), 8 states have internal predecessors, (3303), 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-19 06:03:24,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:24,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 467 [2024-11-19 06:03:24,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:32,458 INFO L124 PetriNetUnfolderBase]: 11549/46171 cut-off events. [2024-11-19 06:03:32,458 INFO L125 PetriNetUnfolderBase]: For 15905/17728 co-relation queries the response was YES. [2024-11-19 06:03:32,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86423 conditions, 46171 events. 11549/46171 cut-off events. For 15905/17728 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 566791 event pairs, 3993 based on Foata normal form. 118/42508 useless extension candidates. Maximal degree in co-relation 86248. Up to 8409 conditions per place. [2024-11-19 06:03:32,863 INFO L140 encePairwiseOnDemand]: 454/467 looper letters, 101 selfloop transitions, 44 changer transitions 0/510 dead transitions. [2024-11-19 06:03:32,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 510 transitions, 1898 flow [2024-11-19 06:03:32,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:03:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 06:03:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4617 transitions. [2024-11-19 06:03:32,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8987736032703912 [2024-11-19 06:03:32,870 INFO L175 Difference]: Start difference. First operand has 403 places, 440 transitions, 1316 flow. Second operand 11 states and 4617 transitions. [2024-11-19 06:03:32,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 510 transitions, 1898 flow [2024-11-19 06:03:32,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 510 transitions, 1890 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 06:03:32,911 INFO L231 Difference]: Finished difference. Result has 413 places, 461 transitions, 1633 flow [2024-11-19 06:03:32,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1633, PETRI_PLACES=413, PETRI_TRANSITIONS=461} [2024-11-19 06:03:32,912 INFO L277 CegarLoopForPetriNet]: 390 programPoint places, 23 predicate places. [2024-11-19 06:03:32,913 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 461 transitions, 1633 flow [2024-11-19 06:03:32,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.875) internal successors, (3303), 8 states have internal predecessors, (3303), 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-19 06:03:32,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:32,914 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-19 06:03:32,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:03:32,915 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-19 06:03:32,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1718398520, now seen corresponding path program 1 times [2024-11-19 06:03:32,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:32,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560892026] [2024-11-19 06:03:32,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:32,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:32,988 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-19 06:03:32,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:32,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560892026] [2024-11-19 06:03:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560892026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744735523] [2024-11-19 06:03:32,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:32,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:33,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 467 [2024-11-19 06:03:33,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 461 transitions, 1633 flow. Second operand has 3 states, 3 states have (on average 431.0) internal successors, (1293), 3 states have internal predecessors, (1293), 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-19 06:03:33,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:33,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 467 [2024-11-19 06:03:33,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:35,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][359], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 220#L1066-11true, 533#true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 232#L1040-7true, Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 480#true, Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 486#(= |#race~threads_alive~0| 0), 478#(= |#race~flags_mutex~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,138 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is not cut-off event [2024-11-19 06:03:35,138 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-19 06:03:35,138 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-19 06:03:35,138 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is not cut-off event [2024-11-19 06:03:35,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 287#L1066-8true, Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 486#(= |#race~threads_alive~0| 0), 478#(= |#race~flags_mutex~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0), 388#L1043-4true]) [2024-11-19 06:03:35,341 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-19 06:03:35,342 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 06:03:35,342 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 06:03:35,342 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 06:03:35,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 523#true, 572#true, 533#true, 20#L1066-9true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 486#(= |#race~threads_alive~0| 0), 478#(= |#race~flags_mutex~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0), 388#L1043-4true]) [2024-11-19 06:03:35,362 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,363 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,363 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,363 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 287#L1066-8true, Black: 476#true, 326#L1043-5true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 486#(= |#race~threads_alive~0| 0), 478#(= |#race~flags_mutex~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,365 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,365 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,365 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,365 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 523#true, 572#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, 211#L1066-10true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 480#true, Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 486#(= |#race~threads_alive~0| 0), 478#(= |#race~flags_mutex~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0), 388#L1043-4true]) [2024-11-19 06:03:35,613 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,613 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,613 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,613 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 20#L1066-9true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, 326#L1043-5true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 486#(= |#race~threads_alive~0| 0), 478#(= |#race~flags_mutex~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,614 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,614 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,614 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,614 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,615 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 287#L1066-8true, Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 480#true, Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0), 388#L1043-4true]) [2024-11-19 06:03:35,615 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-19 06:03:35,615 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-19 06:03:35,615 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 06:03:35,616 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 06:03:35,616 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 06:03:35,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 523#true, 572#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, 211#L1066-10true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, 326#L1043-5true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 480#true, Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 486#(= |#race~threads_alive~0| 0), 478#(= |#race~flags_mutex~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,634 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-19 06:03:35,634 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:03:35,634 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:03:35,635 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:03:35,636 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 20#L1066-9true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 480#true, Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0), 388#L1043-4true]) [2024-11-19 06:03:35,636 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,636 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,636 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,636 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,636 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,637 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 287#L1066-8true, Black: 476#true, 326#L1043-5true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 480#true, Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,637 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,637 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,637 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,637 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,637 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,638 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 287#L1066-8true, Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 388#L1043-4true]) [2024-11-19 06:03:35,638 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-19 06:03:35,638 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-19 06:03:35,638 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-19 06:03:35,638 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 06:03:35,638 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 06:03:35,638 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-19 06:03:35,657 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, 211#L1066-10true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0), 388#L1043-4true]) [2024-11-19 06:03:35,657 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,657 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,657 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,657 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,657 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,658 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 20#L1066-9true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, 326#L1043-5true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 480#true, Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,658 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,658 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,658 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,658 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,658 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,659 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 20#L1066-9true, 533#true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0), 388#L1043-4true]) [2024-11-19 06:03:35,659 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,659 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,659 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,659 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,659 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,660 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,661 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 523#true, 572#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 287#L1066-8true, Black: 476#true, 326#L1043-5true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,661 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,661 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,661 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,661 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-19 06:03:35,661 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,661 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:35,683 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 523#true, 572#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, 211#L1066-10true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, 326#L1043-5true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,683 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-19 06:03:35,683 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-19 06:03:35,683 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:03:35,683 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:03:35,683 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:03:35,685 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, 211#L1066-10true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0), 388#L1043-4true]) [2024-11-19 06:03:35,685 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,685 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,685 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,685 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,685 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,685 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,686 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 20#L1066-9true, 533#true, 491#(= |#race~flags~0| 0), 459#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, 326#L1043-5true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,686 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,686 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,686 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,686 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,686 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-19 06:03:35,686 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-19 06:03:35,709 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([997] 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_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][388], [Black: 511#(= |#race~data~0| 0), 572#true, 523#true, 533#true, 491#(= |#race~flags~0| 0), 459#true, 211#L1066-10true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 476#true, 326#L1043-5true, Black: 537#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 545#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 480#true, 565#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 538#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 478#(= |#race~flags_mutex~0| 0), Black: 486#(= |#race~threads_alive~0| 0), 457#true, 70#L1034-5true, Black: 489#true, Black: 495#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 466#(= |#race~threads_total~0| 0), 482#(= |#race~tids~0| 0), Black: 556#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 555#(not (= ~flags~0.base ~tids~0.base)), Black: 567#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 500#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-19 06:03:35,709 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-19 06:03:35,709 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-19 06:03:35,709 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:03:35,709 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-19 06:03:35,709 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:03:35,709 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-19 06:03:39,286 INFO L124 PetriNetUnfolderBase]: 7483/33626 cut-off events. [2024-11-19 06:03:39,286 INFO L125 PetriNetUnfolderBase]: For 15062/17940 co-relation queries the response was YES.